./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/forester-heap/sll-buckets-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_591c9764-1c60-4d33-9be1-a66b6e830003/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_591c9764-1c60-4d33-9be1-a66b6e830003/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_591c9764-1c60-4d33-9be1-a66b6e830003/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_591c9764-1c60-4d33-9be1-a66b6e830003/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/forester-heap/sll-buckets-2.i -s /tmp/vcloud-vcloud-master/worker/working_dir_591c9764-1c60-4d33-9be1-a66b6e830003/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_591c9764-1c60-4d33-9be1-a66b6e830003/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ec7b34841527490886cd362d78588ff0f0e72200 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_591c9764-1c60-4d33-9be1-a66b6e830003/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_591c9764-1c60-4d33-9be1-a66b6e830003/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_591c9764-1c60-4d33-9be1-a66b6e830003/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_591c9764-1c60-4d33-9be1-a66b6e830003/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/forester-heap/sll-buckets-2.i -s /tmp/vcloud-vcloud-master/worker/working_dir_591c9764-1c60-4d33-9be1-a66b6e830003/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_591c9764-1c60-4d33-9be1-a66b6e830003/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ec7b34841527490886cd362d78588ff0f0e72200 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: UnsupportedOperationException: expected NNF --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 11:21:54,767 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 11:21:54,768 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 11:21:54,778 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 11:21:54,778 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 11:21:54,779 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 11:21:54,780 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 11:21:54,781 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 11:21:54,783 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 11:21:54,783 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 11:21:54,784 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 11:21:54,785 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 11:21:54,785 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 11:21:54,786 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 11:21:54,787 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 11:21:54,788 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 11:21:54,789 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 11:21:54,789 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 11:21:54,791 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 11:21:54,792 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 11:21:54,793 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 11:21:54,800 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 11:21:54,801 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 11:21:54,802 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 11:21:54,804 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 11:21:54,804 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 11:21:54,805 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 11:21:54,805 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 11:21:54,806 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 11:21:54,807 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 11:21:54,807 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 11:21:54,807 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 11:21:54,808 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 11:21:54,809 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 11:21:54,813 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 11:21:54,814 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 11:21:54,814 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 11:21:54,814 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 11:21:54,814 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 11:21:54,815 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 11:21:54,816 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 11:21:54,816 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_591c9764-1c60-4d33-9be1-a66b6e830003/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-10-22 11:21:54,827 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 11:21:54,827 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 11:21:54,828 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-22 11:21:54,828 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-22 11:21:54,828 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-22 11:21:54,828 INFO L138 SettingsManager]: * Explicit value domain=true [2019-10-22 11:21:54,829 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-10-22 11:21:54,829 INFO L138 SettingsManager]: * Octagon Domain=false [2019-10-22 11:21:54,829 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-10-22 11:21:54,829 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-10-22 11:21:54,830 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-10-22 11:21:54,830 INFO L138 SettingsManager]: * Interval Domain=false [2019-10-22 11:21:54,830 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 11:21:54,831 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 11:21:54,831 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 11:21:54,831 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 11:21:54,831 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 11:21:54,831 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 11:21:54,831 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 11:21:54,832 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 11:21:54,832 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 11:21:54,832 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 11:21:54,832 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 11:21:54,832 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 11:21:54,833 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 11:21:54,833 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 11:21:54,833 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 11:21:54,833 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:21:54,834 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 11:21:54,834 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 11:21:54,834 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 11:21:54,834 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-22 11:21:54,834 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 11:21:54,835 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 11:21:54,835 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-22 11:21:54,835 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_591c9764-1c60-4d33-9be1-a66b6e830003/bin/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ec7b34841527490886cd362d78588ff0f0e72200 [2019-10-22 11:21:54,869 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 11:21:54,883 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 11:21:54,887 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 11:21:54,888 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 11:21:54,889 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 11:21:54,889 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_591c9764-1c60-4d33-9be1-a66b6e830003/bin/utaipan/../../sv-benchmarks/c/forester-heap/sll-buckets-2.i [2019-10-22 11:21:54,938 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_591c9764-1c60-4d33-9be1-a66b6e830003/bin/utaipan/data/2f63eb2ef/925b5b575b8b44f0924ee8eaa2f2ce0d/FLAG73a9616dc [2019-10-22 11:21:55,336 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 11:21:55,336 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_591c9764-1c60-4d33-9be1-a66b6e830003/sv-benchmarks/c/forester-heap/sll-buckets-2.i [2019-10-22 11:21:55,345 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_591c9764-1c60-4d33-9be1-a66b6e830003/bin/utaipan/data/2f63eb2ef/925b5b575b8b44f0924ee8eaa2f2ce0d/FLAG73a9616dc [2019-10-22 11:21:55,354 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_591c9764-1c60-4d33-9be1-a66b6e830003/bin/utaipan/data/2f63eb2ef/925b5b575b8b44f0924ee8eaa2f2ce0d [2019-10-22 11:21:55,357 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 11:21:55,358 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 11:21:55,359 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 11:21:55,359 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 11:21:55,362 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 11:21:55,363 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:21:55" (1/1) ... [2019-10-22 11:21:55,365 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b055d82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:55, skipping insertion in model container [2019-10-22 11:21:55,365 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:21:55" (1/1) ... [2019-10-22 11:21:55,371 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 11:21:55,414 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 11:21:55,732 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:21:55,744 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 11:21:55,816 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:21:55,858 INFO L192 MainTranslator]: Completed translation [2019-10-22 11:21:55,858 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:55 WrapperNode [2019-10-22 11:21:55,858 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 11:21:55,859 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 11:21:55,859 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 11:21:55,859 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 11:21:55,868 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:55" (1/1) ... [2019-10-22 11:21:55,881 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:55" (1/1) ... [2019-10-22 11:21:55,904 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 11:21:55,904 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 11:21:55,904 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 11:21:55,905 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 11:21:55,913 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:55" (1/1) ... [2019-10-22 11:21:55,913 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:55" (1/1) ... [2019-10-22 11:21:55,917 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:55" (1/1) ... [2019-10-22 11:21:55,917 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:55" (1/1) ... [2019-10-22 11:21:55,925 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:55" (1/1) ... [2019-10-22 11:21:55,939 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:55" (1/1) ... [2019-10-22 11:21:55,941 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:55" (1/1) ... [2019-10-22 11:21:55,943 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 11:21:55,944 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 11:21:55,944 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 11:21:55,944 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 11:21:55,945 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:55" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_591c9764-1c60-4d33-9be1-a66b6e830003/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:21:56,015 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 11:21:56,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 11:21:56,015 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-22 11:21:56,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-22 11:21:56,015 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-22 11:21:56,015 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 11:21:56,016 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 11:21:56,016 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 11:21:56,477 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 11:21:56,477 INFO L284 CfgBuilder]: Removed 19 assume(true) statements. [2019-10-22 11:21:56,478 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:21:56 BoogieIcfgContainer [2019-10-22 11:21:56,479 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 11:21:56,479 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 11:21:56,479 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 11:21:56,482 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 11:21:56,482 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 11:21:55" (1/3) ... [2019-10-22 11:21:56,483 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60c97ce5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:21:56, skipping insertion in model container [2019-10-22 11:21:56,483 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:55" (2/3) ... [2019-10-22 11:21:56,484 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60c97ce5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:21:56, skipping insertion in model container [2019-10-22 11:21:56,484 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:21:56" (3/3) ... [2019-10-22 11:21:56,485 INFO L109 eAbstractionObserver]: Analyzing ICFG sll-buckets-2.i [2019-10-22 11:21:56,494 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 11:21:56,501 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-10-22 11:21:56,510 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-10-22 11:21:56,530 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 11:21:56,530 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 11:21:56,530 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 11:21:56,530 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 11:21:56,530 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 11:21:56,531 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 11:21:56,531 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 11:21:56,531 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 11:21:56,541 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2019-10-22 11:21:56,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-10-22 11:21:56,546 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:56,546 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:56,548 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:56,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:56,551 INFO L82 PathProgramCache]: Analyzing trace with hash 179510098, now seen corresponding path program 1 times [2019-10-22 11:21:56,557 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:56,557 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900390608] [2019-10-22 11:21:56,557 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:56,557 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:56,557 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:56,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:56,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:56,725 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900390608] [2019-10-22 11:21:56,726 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:56,726 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:21:56,727 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83365854] [2019-10-22 11:21:56,730 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:21:56,732 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:56,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:21:56,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:21:56,747 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 4 states. [2019-10-22 11:21:56,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:56,855 INFO L93 Difference]: Finished difference Result 112 states and 188 transitions. [2019-10-22 11:21:56,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:21:56,856 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-10-22 11:21:56,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:56,865 INFO L225 Difference]: With dead ends: 112 [2019-10-22 11:21:56,865 INFO L226 Difference]: Without dead ends: 66 [2019-10-22 11:21:56,868 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:21:56,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-10-22 11:21:56,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 41. [2019-10-22 11:21:56,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-10-22 11:21:56,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2019-10-22 11:21:56,904 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 8 [2019-10-22 11:21:56,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:56,904 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2019-10-22 11:21:56,904 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:21:56,905 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2019-10-22 11:21:56,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-10-22 11:21:56,905 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:56,905 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:56,906 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:56,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:56,906 INFO L82 PathProgramCache]: Analyzing trace with hash 1306111283, now seen corresponding path program 1 times [2019-10-22 11:21:56,906 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:56,906 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90382509] [2019-10-22 11:21:56,906 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:56,907 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:56,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:56,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:56,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:56,962 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90382509] [2019-10-22 11:21:56,962 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:56,962 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:21:56,962 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705343409] [2019-10-22 11:21:56,964 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:21:56,964 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:56,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:21:56,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:21:56,965 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand 3 states. [2019-10-22 11:21:57,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:57,034 INFO L93 Difference]: Finished difference Result 45 states and 54 transitions. [2019-10-22 11:21:57,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:21:57,035 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-10-22 11:21:57,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:57,035 INFO L225 Difference]: With dead ends: 45 [2019-10-22 11:21:57,035 INFO L226 Difference]: Without dead ends: 43 [2019-10-22 11:21:57,036 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:21:57,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-10-22 11:21:57,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 39. [2019-10-22 11:21:57,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-10-22 11:21:57,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 47 transitions. [2019-10-22 11:21:57,041 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 47 transitions. Word has length 9 [2019-10-22 11:21:57,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:57,041 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 47 transitions. [2019-10-22 11:21:57,042 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:21:57,042 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions. [2019-10-22 11:21:57,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-10-22 11:21:57,042 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:57,042 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:57,043 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:57,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:57,043 INFO L82 PathProgramCache]: Analyzing trace with hash 1834780084, now seen corresponding path program 1 times [2019-10-22 11:21:57,043 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:57,043 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521882134] [2019-10-22 11:21:57,043 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:57,044 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:57,044 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:57,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:57,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:57,330 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521882134] [2019-10-22 11:21:57,330 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:57,330 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:21:57,331 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083321714] [2019-10-22 11:21:57,331 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:21:57,331 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:57,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:21:57,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:21:57,332 INFO L87 Difference]: Start difference. First operand 39 states and 47 transitions. Second operand 5 states. [2019-10-22 11:21:57,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:57,511 INFO L93 Difference]: Finished difference Result 61 states and 74 transitions. [2019-10-22 11:21:57,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:21:57,511 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-10-22 11:21:57,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:57,513 INFO L225 Difference]: With dead ends: 61 [2019-10-22 11:21:57,514 INFO L226 Difference]: Without dead ends: 50 [2019-10-22 11:21:57,514 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-22 11:21:57,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-10-22 11:21:57,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 44. [2019-10-22 11:21:57,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-10-22 11:21:57,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2019-10-22 11:21:57,521 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 10 [2019-10-22 11:21:57,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:57,521 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2019-10-22 11:21:57,522 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:21:57,522 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2019-10-22 11:21:57,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-10-22 11:21:57,522 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:57,522 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:57,523 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:57,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:57,523 INFO L82 PathProgramCache]: Analyzing trace with hash 710639734, now seen corresponding path program 1 times [2019-10-22 11:21:57,523 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:57,523 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071208237] [2019-10-22 11:21:57,524 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:57,524 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:57,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:57,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:57,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:57,580 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071208237] [2019-10-22 11:21:57,581 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:57,581 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:21:57,581 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272423056] [2019-10-22 11:21:57,581 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:21:57,582 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:57,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:21:57,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:21:57,582 INFO L87 Difference]: Start difference. First operand 44 states and 53 transitions. Second operand 3 states. [2019-10-22 11:21:57,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:57,727 INFO L93 Difference]: Finished difference Result 45 states and 54 transitions. [2019-10-22 11:21:57,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:21:57,729 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-10-22 11:21:57,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:57,729 INFO L225 Difference]: With dead ends: 45 [2019-10-22 11:21:57,729 INFO L226 Difference]: Without dead ends: 43 [2019-10-22 11:21:57,730 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:21:57,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-10-22 11:21:57,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2019-10-22 11:21:57,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-10-22 11:21:57,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 51 transitions. [2019-10-22 11:21:57,738 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 51 transitions. Word has length 10 [2019-10-22 11:21:57,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:57,738 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 51 transitions. [2019-10-22 11:21:57,738 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:21:57,738 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions. [2019-10-22 11:21:57,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-22 11:21:57,739 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:57,739 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:57,739 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:57,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:57,739 INFO L82 PathProgramCache]: Analyzing trace with hash 625501225, now seen corresponding path program 1 times [2019-10-22 11:21:57,740 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:57,740 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64566346] [2019-10-22 11:21:57,740 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:57,740 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:57,740 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:57,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:58,207 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:58,207 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64566346] [2019-10-22 11:21:58,207 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [422515308] [2019-10-22 11:21:58,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_591c9764-1c60-4d33-9be1-a66b6e830003/bin/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 11:21:58,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:58,288 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 40 conjunts are in the unsatisfiable core [2019-10-22 11:21:58,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:21:58,575 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:21:58,576 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2019-10-22 11:21:58,577 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:21:58,790 WARN L191 SmtUtils]: Spent 212.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2019-10-22 11:21:58,790 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:21:58,799 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_35|, |v_#memory_$Pointer$.base_36|, |v_#memory_$Pointer$.offset_37|, |v_#memory_$Pointer$.offset_35|], 1=[|v_#memory_$Pointer$.base_37|, |v_#memory_$Pointer$.offset_36|]} [2019-10-22 11:21:58,828 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:21:58,915 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 17 [2019-10-22 11:21:58,915 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 11:21:59,084 WARN L191 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2019-10-22 11:21:59,084 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:21:59,091 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 11:21:59,211 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2019-10-22 11:21:59,211 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:21:59,242 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:21:59,264 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 17 [2019-10-22 11:21:59,265 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-22 11:21:59,326 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:21:59,331 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 11:21:59,377 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:21:59,384 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:21:59,390 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 58 [2019-10-22 11:21:59,391 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-10-22 11:21:59,488 INFO L567 ElimStorePlain]: treesize reduction 4, result has 96.7 percent of original size [2019-10-22 11:21:59,495 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:21:59,496 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:21:59,499 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 58 [2019-10-22 11:21:59,500 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-10-22 11:21:59,542 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:21:59,544 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 6 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:21:59,544 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 9 variables, input treesize:207, output treesize:150 [2019-10-22 11:21:59,663 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:21:59,664 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-22 11:21:59,764 INFO L341 Elim1Store]: treesize reduction 8, result has 91.6 percent of original size [2019-10-22 11:21:59,764 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 16 case distinctions, treesize of input 144 treesize of output 171 [2019-10-22 11:21:59,767 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:21:59,854 INFO L567 ElimStorePlain]: treesize reduction 164, result has 49.8 percent of original size [2019-10-22 11:21:59,866 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:21:59,867 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:21:59,870 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 5 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 87 [2019-10-22 11:21:59,872 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 11:21:59,897 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:21:59,897 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:21:59,897 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:176, output treesize:150 [2019-10-22 11:21:59,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:59,960 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:21:59,961 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-22 11:22:00,016 INFO L341 Elim1Store]: treesize reduction 16, result has 76.5 percent of original size [2019-10-22 11:22:00,017 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 9 new quantified variables, introduced 20 case distinctions, treesize of input 171 treesize of output 126 [2019-10-22 11:22:00,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:00,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:00,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:00,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:00,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:00,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:00,026 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-22 11:22:00,079 INFO L567 ElimStorePlain]: treesize reduction 20, result has 78.9 percent of original size [2019-10-22 11:22:00,091 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:22:00,092 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 5 disjoint index pairs (out of 21 index pairs), introduced 8 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 43 [2019-10-22 11:22:00,093 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 11:22:00,103 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:22:00,104 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:22:00,104 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:185, output treesize:7 [2019-10-22 11:22:00,124 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:00,124 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:22:00,265 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:00,266 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [1929599767] [2019-10-22 11:22:00,270 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 16 [2019-10-22 11:22:00,302 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-10-22 11:22:00,302 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-22 11:22:00,598 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 11:22:00,598 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: inappropriate decl info IMPLEMENTATION at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Boogie2SmtSymbolTable.getBoogieVar(Boogie2SmtSymbolTable.java:222) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.getBoogieVar(NonrelationalStatementProcessor.java:348) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.handleHavocStatement(NonrelationalStatementProcessor.java:325) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.processStatement(NonrelationalStatementProcessor.java:159) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.process(NonrelationalStatementProcessor.java:138) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.process(NonrelationalStatementProcessor.java:107) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.handleInternalTransition(NonrelationalPostOperator.java:422) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.handleInternalTransition(NonrelationalPostOperator.java:413) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.apply(NonrelationalPostOperator.java:140) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.apply(NonrelationalPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.applyInternally(CompoundDomainPostOperator.java:306) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.apply(CompoundDomainPostOperator.java:131) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.apply(CompoundDomainPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormanCachedPostOperation.restoreOriginalStateVariables(PoormanCachedPostOperation.java:322) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.applyPost(PoormansAbstractPostOperator.java:217) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.apply(PoormansAbstractPostOperator.java:120) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.apply(PoormansAbstractPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.absint.DisjunctiveAbstractState.lambda$17(DisjunctiveAbstractState.java:323) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.absint.DisjunctiveAbstractState.mapCollection(DisjunctiveAbstractState.java:519) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.absint.DisjunctiveAbstractState.apply(DisjunctiveAbstractState.java:323) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.FixpointEngine.calculateAbstractPost(FixpointEngine.java:249) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.FixpointEngine.calculateFixpoint(FixpointEngine.java:134) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.FixpointEngine.run(FixpointEngine.java:105) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.tool.AbstractInterpreter.runWithoutTimeoutAndResults(AbstractInterpreter.java:149) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarAbsIntRunner.generateFixpoints(CegarAbsIntRunner.java:227) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarAbsIntRunner.(CegarAbsIntRunner.java:158) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleAbstractInterpretation.getOrConstructRunner(IpTcStrategyModuleAbstractInterpretation.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleAbstractInterpretation.construct(IpTcStrategyModuleAbstractInterpretation.java:81) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:299) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.generateProof(TraceAbstractionRefinementEngine.java:184) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-10-22 11:22:00,602 INFO L168 Benchmark]: Toolchain (without parser) took 5244.13 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.0 MB). Free memory was 939.7 MB in the beginning and 950.9 MB in the end (delta: -11.3 MB). Peak memory consumption was 106.7 MB. Max. memory is 11.5 GB. [2019-10-22 11:22:00,602 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 963.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:22:00,602 INFO L168 Benchmark]: CACSL2BoogieTranslator took 499.71 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.0 MB). Free memory was 939.7 MB in the beginning and 1.1 GB in the end (delta: -162.1 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2019-10-22 11:22:00,603 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.23 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-10-22 11:22:00,603 INFO L168 Benchmark]: Boogie Preprocessor took 39.21 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:22:00,603 INFO L168 Benchmark]: RCFGBuilder took 534.85 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 39.8 MB). Peak memory consumption was 39.8 MB. Max. memory is 11.5 GB. [2019-10-22 11:22:00,604 INFO L168 Benchmark]: TraceAbstraction took 4121.23 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 950.9 MB in the end (delta: 105.6 MB). Peak memory consumption was 105.6 MB. Max. memory is 11.5 GB. [2019-10-22 11:22:00,609 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 963.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 499.71 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.0 MB). Free memory was 939.7 MB in the beginning and 1.1 GB in the end (delta: -162.1 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 45.23 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 39.21 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 534.85 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 39.8 MB). Peak memory consumption was 39.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4121.23 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 950.9 MB in the end (delta: 105.6 MB). Peak memory consumption was 105.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: inappropriate decl info IMPLEMENTATION de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: inappropriate decl info IMPLEMENTATION: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Boogie2SmtSymbolTable.getBoogieVar(Boogie2SmtSymbolTable.java:222) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-cad4683 [2019-10-22 11:22:02,773 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 11:22:02,775 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 11:22:02,786 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 11:22:02,786 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 11:22:02,787 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 11:22:02,788 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 11:22:02,790 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 11:22:02,792 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 11:22:02,792 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 11:22:02,794 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 11:22:02,795 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 11:22:02,795 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 11:22:02,796 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 11:22:02,796 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 11:22:02,798 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 11:22:02,798 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 11:22:02,799 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 11:22:02,801 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 11:22:02,803 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 11:22:02,804 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 11:22:02,805 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 11:22:02,806 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 11:22:02,807 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 11:22:02,809 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 11:22:02,809 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 11:22:02,809 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 11:22:02,810 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 11:22:02,811 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 11:22:02,812 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 11:22:02,812 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 11:22:02,812 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 11:22:02,813 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 11:22:02,814 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 11:22:02,815 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 11:22:02,815 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 11:22:02,816 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 11:22:02,816 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 11:22:02,817 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 11:22:02,818 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 11:22:02,818 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 11:22:02,819 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_591c9764-1c60-4d33-9be1-a66b6e830003/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2019-10-22 11:22:02,832 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 11:22:02,832 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 11:22:02,833 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-22 11:22:02,833 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-22 11:22:02,833 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-22 11:22:02,834 INFO L138 SettingsManager]: * Explicit value domain=true [2019-10-22 11:22:02,834 INFO L138 SettingsManager]: * Octagon Domain=false [2019-10-22 11:22:02,834 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-10-22 11:22:02,834 INFO L138 SettingsManager]: * Interval Domain=false [2019-10-22 11:22:02,835 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 11:22:02,835 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 11:22:02,835 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 11:22:02,835 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 11:22:02,835 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 11:22:02,836 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 11:22:02,836 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 11:22:02,836 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-10-22 11:22:02,836 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-10-22 11:22:02,836 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 11:22:02,836 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 11:22:02,837 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 11:22:02,837 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 11:22:02,837 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 11:22:02,838 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 11:22:02,838 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 11:22:02,838 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 11:22:02,838 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:22:02,838 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 11:22:02,838 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 11:22:02,839 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 11:22:02,839 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2019-10-22 11:22:02,839 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-10-22 11:22:02,839 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 11:22:02,839 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-22 11:22:02,839 INFO L138 SettingsManager]: * Logic for external solver=AUFBV Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_591c9764-1c60-4d33-9be1-a66b6e830003/bin/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ec7b34841527490886cd362d78588ff0f0e72200 [2019-10-22 11:22:02,871 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 11:22:02,883 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 11:22:02,886 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 11:22:02,887 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 11:22:02,888 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 11:22:02,888 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_591c9764-1c60-4d33-9be1-a66b6e830003/bin/utaipan/../../sv-benchmarks/c/forester-heap/sll-buckets-2.i [2019-10-22 11:22:02,940 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_591c9764-1c60-4d33-9be1-a66b6e830003/bin/utaipan/data/7b7907d56/aabc555834004f0e831ea396c40246ad/FLAG2cfbc219c [2019-10-22 11:22:03,355 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 11:22:03,359 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_591c9764-1c60-4d33-9be1-a66b6e830003/sv-benchmarks/c/forester-heap/sll-buckets-2.i [2019-10-22 11:22:03,369 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_591c9764-1c60-4d33-9be1-a66b6e830003/bin/utaipan/data/7b7907d56/aabc555834004f0e831ea396c40246ad/FLAG2cfbc219c [2019-10-22 11:22:03,706 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_591c9764-1c60-4d33-9be1-a66b6e830003/bin/utaipan/data/7b7907d56/aabc555834004f0e831ea396c40246ad [2019-10-22 11:22:03,708 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 11:22:03,709 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 11:22:03,711 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 11:22:03,714 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 11:22:03,718 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 11:22:03,718 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:22:03" (1/1) ... [2019-10-22 11:22:03,721 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d2f1957 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:03, skipping insertion in model container [2019-10-22 11:22:03,721 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:22:03" (1/1) ... [2019-10-22 11:22:03,728 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 11:22:03,776 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 11:22:04,052 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:22:04,133 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 11:22:04,174 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:22:04,219 INFO L192 MainTranslator]: Completed translation [2019-10-22 11:22:04,220 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:04 WrapperNode [2019-10-22 11:22:04,220 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 11:22:04,221 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 11:22:04,221 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 11:22:04,221 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 11:22:04,229 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:04" (1/1) ... [2019-10-22 11:22:04,248 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:04" (1/1) ... [2019-10-22 11:22:04,281 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 11:22:04,282 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 11:22:04,282 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 11:22:04,282 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 11:22:04,292 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:04" (1/1) ... [2019-10-22 11:22:04,292 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:04" (1/1) ... [2019-10-22 11:22:04,296 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:04" (1/1) ... [2019-10-22 11:22:04,302 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:04" (1/1) ... [2019-10-22 11:22:04,316 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:04" (1/1) ... [2019-10-22 11:22:04,328 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:04" (1/1) ... [2019-10-22 11:22:04,331 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:04" (1/1) ... [2019-10-22 11:22:04,337 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 11:22:04,344 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 11:22:04,344 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 11:22:04,344 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 11:22:04,345 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:04" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_591c9764-1c60-4d33-9be1-a66b6e830003/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:22:04,414 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-10-22 11:22:04,414 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-22 11:22:04,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-22 11:22:04,414 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-22 11:22:04,416 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 11:22:04,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-10-22 11:22:04,416 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 11:22:04,417 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 11:22:07,027 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 11:22:07,027 INFO L284 CfgBuilder]: Removed 19 assume(true) statements. [2019-10-22 11:22:07,028 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:22:07 BoogieIcfgContainer [2019-10-22 11:22:07,028 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 11:22:07,029 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 11:22:07,029 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 11:22:07,031 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 11:22:07,031 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 11:22:03" (1/3) ... [2019-10-22 11:22:07,032 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49b0feae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:22:07, skipping insertion in model container [2019-10-22 11:22:07,032 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:04" (2/3) ... [2019-10-22 11:22:07,032 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49b0feae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:22:07, skipping insertion in model container [2019-10-22 11:22:07,033 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:22:07" (3/3) ... [2019-10-22 11:22:07,034 INFO L109 eAbstractionObserver]: Analyzing ICFG sll-buckets-2.i [2019-10-22 11:22:07,043 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 11:22:07,050 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-10-22 11:22:07,065 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-10-22 11:22:07,086 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 11:22:07,086 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 11:22:07,086 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 11:22:07,086 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 11:22:07,087 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 11:22:07,087 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 11:22:07,087 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 11:22:07,087 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 11:22:07,097 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states. [2019-10-22 11:22:07,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-10-22 11:22:07,102 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:07,103 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:22:07,105 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:07,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:07,112 INFO L82 PathProgramCache]: Analyzing trace with hash 1810667474, now seen corresponding path program 1 times [2019-10-22 11:22:07,123 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:22:07,123 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [930488953] [2019-10-22 11:22:07,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_591c9764-1c60-4d33-9be1-a66b6e830003/bin/utaipan/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:22:07,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:07,240 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 11:22:07,245 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:22:07,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:07,277 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:22:07,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:07,290 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [930488953] [2019-10-22 11:22:07,291 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:07,291 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-10-22 11:22:07,291 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971383458] [2019-10-22 11:22:07,295 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:22:07,296 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-10-22 11:22:07,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:22:07,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:22:07,314 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 4 states. [2019-10-22 11:22:07,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:07,485 INFO L93 Difference]: Finished difference Result 109 states and 185 transitions. [2019-10-22 11:22:07,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:22:07,488 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-10-22 11:22:07,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:07,498 INFO L225 Difference]: With dead ends: 109 [2019-10-22 11:22:07,499 INFO L226 Difference]: Without dead ends: 64 [2019-10-22 11:22:07,502 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:22:07,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-10-22 11:22:07,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 40. [2019-10-22 11:22:07,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-10-22 11:22:07,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2019-10-22 11:22:07,544 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 7 [2019-10-22 11:22:07,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:07,545 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2019-10-22 11:22:07,545 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:22:07,545 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2019-10-22 11:22:07,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-10-22 11:22:07,546 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:07,546 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:22:07,747 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:22:07,747 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:07,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:07,748 INFO L82 PathProgramCache]: Analyzing trace with hash 332382386, now seen corresponding path program 1 times [2019-10-22 11:22:07,749 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:22:07,749 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [438220882] [2019-10-22 11:22:07,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_591c9764-1c60-4d33-9be1-a66b6e830003/bin/utaipan/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:22:07,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:07,874 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-22 11:22:07,875 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:22:07,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:07,894 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:22:07,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:07,895 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [438220882] [2019-10-22 11:22:07,896 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:07,896 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-10-22 11:22:07,896 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882297042] [2019-10-22 11:22:07,899 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:22:07,900 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-10-22 11:22:07,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:22:07,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:22:07,901 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. Second operand 3 states. [2019-10-22 11:22:07,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:07,983 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2019-10-22 11:22:07,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:22:07,984 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-10-22 11:22:07,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:07,985 INFO L225 Difference]: With dead ends: 43 [2019-10-22 11:22:07,986 INFO L226 Difference]: Without dead ends: 41 [2019-10-22 11:22:07,987 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:22:07,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-10-22 11:22:07,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 38. [2019-10-22 11:22:07,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-10-22 11:22:07,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2019-10-22 11:22:07,994 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 8 [2019-10-22 11:22:07,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:07,994 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2019-10-22 11:22:07,994 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:22:07,994 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2019-10-22 11:22:07,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-10-22 11:22:07,995 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:07,995 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:22:08,196 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:22:08,196 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:08,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:08,197 INFO L82 PathProgramCache]: Analyzing trace with hash 1713955348, now seen corresponding path program 1 times [2019-10-22 11:22:08,197 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:22:08,197 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [894969295] [2019-10-22 11:22:08,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_591c9764-1c60-4d33-9be1-a66b6e830003/bin/utaipan/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:22:08,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:08,343 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 19 conjunts are in the unsatisfiable core [2019-10-22 11:22:08,349 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:22:08,950 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-10-22 11:22:08,950 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:22:16,883 WARN L191 SmtUtils]: Spent 7.93 s on a formula simplification that was a NOOP. DAG size: 69 [2019-10-22 11:22:16,884 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:22:16,896 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_40|, |v_#memory_$Pointer$.base_39|, |v_#memory_$Pointer$.base_38|, |v_#memory_$Pointer$.offset_39|], 6=[|v_#memory_$Pointer$.base_40|, |v_#memory_$Pointer$.offset_38|]} [2019-10-22 11:22:17,569 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:22:17,982 INFO L235 Elim1Store]: Index analysis took 860 ms [2019-10-22 11:22:19,158 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 17 [2019-10-22 11:22:19,158 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 11:22:21,889 WARN L191 SmtUtils]: Spent 2.73 s on a formula simplification that was a NOOP. DAG size: 64 [2019-10-22 11:22:21,889 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:22:21,918 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 11:22:24,272 WARN L191 SmtUtils]: Spent 2.35 s on a formula simplification that was a NOOP. DAG size: 60 [2019-10-22 11:22:24,272 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:22:24,519 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:22:24,764 INFO L235 Elim1Store]: Index analysis took 323 ms [2019-10-22 11:22:25,757 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 17 [2019-10-22 11:22:25,758 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-22 11:22:27,087 WARN L191 SmtUtils]: Spent 1.33 s on a formula simplification that was a NOOP. DAG size: 54 [2019-10-22 11:22:27,088 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:22:27,100 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 11:22:27,962 WARN L191 SmtUtils]: Spent 861.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-10-22 11:22:27,963 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:22:27,984 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:22:27,995 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:22:28,020 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:22:28,021 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-22 11:22:28,672 WARN L191 SmtUtils]: Spent 570.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-10-22 11:22:28,673 INFO L341 Elim1Store]: treesize reduction 106, result has 61.2 percent of original size [2019-10-22 11:22:28,673 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 60 treesize of output 194 [2019-10-22 11:22:28,675 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-10-22 11:22:29,253 WARN L191 SmtUtils]: Spent 577.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 64 [2019-10-22 11:22:29,254 INFO L567 ElimStorePlain]: treesize reduction 98, result has 61.4 percent of original size [2019-10-22 11:22:29,262 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:22:29,265 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:22:29,269 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:22:29,270 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-22 11:22:29,575 WARN L191 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 47 [2019-10-22 11:22:29,576 INFO L341 Elim1Store]: treesize reduction 152, result has 44.3 percent of original size [2019-10-22 11:22:29,576 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 60 treesize of output 148 [2019-10-22 11:22:29,577 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-10-22 11:22:29,802 WARN L191 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 68 [2019-10-22 11:22:29,803 INFO L567 ElimStorePlain]: treesize reduction 66, result has 72.3 percent of original size [2019-10-22 11:22:29,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:29,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:29,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:29,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:29,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:29,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-22 11:22:29,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-22 11:22:29,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-22 11:22:29,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-22 11:22:29,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-22 11:22:29,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-22 11:22:29,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:29,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:29,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:29,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-22 11:22:29,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:29,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:29,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:29,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-22 11:22:29,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-22 11:22:29,865 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 6 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-10-22 11:22:29,865 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 10 variables, input treesize:212, output treesize:756 [2019-10-22 11:22:29,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-22 11:22:29,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:29,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:29,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:29,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-22 11:22:30,394 WARN L191 SmtUtils]: Spent 498.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 101 [2019-10-22 11:22:30,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:30,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:30,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:30,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-22 11:22:30,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:30,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-22 11:22:30,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:30,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:30,957 WARN L191 SmtUtils]: Spent 486.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 85 [2019-10-22 11:22:30,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-10-22 11:22:30,985 INFO L392 ElimStorePlain]: Different costs {2=[v_prenex_2, v_prenex_3, v_prenex_8, v_prenex_9], 7=[v_prenex_5], 10=[v_prenex_6, v_prenex_12, v_prenex_11], 20=[|v_#memory_$Pointer$.base_41|, |v_#memory_$Pointer$.offset_41|]} [2019-10-22 11:22:31,032 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:22:31,033 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 104 treesize of output 79 [2019-10-22 11:22:31,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:31,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:31,036 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 11:22:31,655 WARN L191 SmtUtils]: Spent 618.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 146 [2019-10-22 11:22:31,656 INFO L567 ElimStorePlain]: treesize reduction 8, result has 98.4 percent of original size [2019-10-22 11:22:31,694 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:22:31,694 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 48 treesize of output 40 [2019-10-22 11:22:31,695 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 11:22:32,214 WARN L191 SmtUtils]: Spent 517.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 132 [2019-10-22 11:22:32,214 INFO L567 ElimStorePlain]: treesize reduction 8, result has 98.3 percent of original size [2019-10-22 11:22:32,254 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:22:32,254 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 82 treesize of output 69 [2019-10-22 11:22:32,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:32,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:32,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:32,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:32,259 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 11:22:32,751 WARN L191 SmtUtils]: Spent 491.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 122 [2019-10-22 11:22:32,751 INFO L567 ElimStorePlain]: treesize reduction 16, result has 96.3 percent of original size [2019-10-22 11:22:32,806 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:22:32,807 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 41 treesize of output 37 [2019-10-22 11:22:32,808 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-22 11:22:33,029 WARN L191 SmtUtils]: Spent 220.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2019-10-22 11:22:33,029 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:22:33,045 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-22 11:22:33,058 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:22:33,058 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 104 treesize of output 81 [2019-10-22 11:22:33,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:33,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:33,062 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 11:22:33,446 WARN L191 SmtUtils]: Spent 383.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 100 [2019-10-22 11:22:33,446 INFO L567 ElimStorePlain]: treesize reduction 8, result has 97.7 percent of original size [2019-10-22 11:22:33,465 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:22:33,465 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 39 [2019-10-22 11:22:33,466 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-10-22 11:22:33,606 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-10-22 11:22:33,606 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:22:33,614 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:22:33,658 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:22:33,658 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 100 treesize of output 109 [2019-10-22 11:22:33,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:33,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:33,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:33,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:33,664 INFO L496 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 11:22:33,975 WARN L191 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 77 [2019-10-22 11:22:33,975 INFO L567 ElimStorePlain]: treesize reduction 24, result has 90.9 percent of original size [2019-10-22 11:22:33,987 INFO L341 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2019-10-22 11:22:33,987 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 23 [2019-10-22 11:22:33,988 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-10-22 11:22:34,084 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:22:34,093 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:22:34,209 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2019-10-22 11:22:34,209 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:22:34,209 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 14 case distinctions, treesize of input 162 treesize of output 230 [2019-10-22 11:22:34,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:34,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:34,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:34,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:34,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:34,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:34,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:34,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:34,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:34,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:34,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:34,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:34,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:34,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:34,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:34,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:34,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:34,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:34,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:34,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:34,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:34,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:34,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:34,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:34,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:34,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:34,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:34,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:34,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:34,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:34,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:34,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:34,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:34,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:34,260 INFO L496 ElimStorePlain]: Start of recursive call 10: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-22 11:22:34,512 WARN L191 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 64 [2019-10-22 11:22:34,512 INFO L567 ElimStorePlain]: treesize reduction 50, result has 74.4 percent of original size [2019-10-22 11:22:34,713 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:22:34,713 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: expected NNF at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:236) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive$TermWalker.walk(NonRecursive.java:139) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:195) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder.(ArrayOccurrenceAnalysis.java:181) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis.(ArrayOccurrenceAnalysis.java:74) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:275) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:253) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.checkFeasibility(TraceAbstractionRefinementEngine.java:244) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-10-22 11:22:34,717 INFO L168 Benchmark]: Toolchain (without parser) took 31008.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 219.7 MB). Free memory was 941.6 MB in the beginning and 826.7 MB in the end (delta: 114.9 MB). Peak memory consumption was 334.6 MB. Max. memory is 11.5 GB. [2019-10-22 11:22:34,717 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 972.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:22:34,718 INFO L168 Benchmark]: CACSL2BoogieTranslator took 509.38 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.9 MB). Free memory was 941.6 MB in the beginning and 1.1 GB in the end (delta: -198.8 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. [2019-10-22 11:22:34,718 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.24 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-10-22 11:22:34,719 INFO L168 Benchmark]: Boogie Preprocessor took 61.83 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:22:34,719 INFO L168 Benchmark]: RCFGBuilder took 2684.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 39.3 MB). Peak memory consumption was 39.3 MB. Max. memory is 11.5 GB. [2019-10-22 11:22:34,719 INFO L168 Benchmark]: TraceAbstraction took 27686.81 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 60.8 MB). Free memory was 1.1 GB in the beginning and 826.7 MB in the end (delta: 267.7 MB). Peak memory consumption was 328.5 MB. Max. memory is 11.5 GB. [2019-10-22 11:22:34,723 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 972.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 509.38 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.9 MB). Free memory was 941.6 MB in the beginning and 1.1 GB in the end (delta: -198.8 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 61.24 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 61.83 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 2684.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 39.3 MB). Peak memory consumption was 39.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 27686.81 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 60.8 MB). Free memory was 1.1 GB in the beginning and 826.7 MB in the end (delta: 267.7 MB). Peak memory consumption was 328.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: UnsupportedOperationException: expected NNF de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: expected NNF: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:236) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...