./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/floats-cbmc-regression/float22_true-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_6a2ef302-4608-4ca4-a4dc-4a13342c03d1/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_6a2ef302-4608-4ca4-a4dc-4a13342c03d1/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_6a2ef302-4608-4ca4-a4dc-4a13342c03d1/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_6a2ef302-4608-4ca4-a4dc-4a13342c03d1/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/floats-cbmc-regression/float22_true-unreach-call_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_6a2ef302-4608-4ca4-a4dc-4a13342c03d1/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_6a2ef302-4608-4ca4-a4dc-4a13342c03d1/bin-2019/uautomizer --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 08947af3b6f9b8a272faa540a059213a9b1de888 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_6a2ef302-4608-4ca4-a4dc-4a13342c03d1/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_6a2ef302-4608-4ca4-a4dc-4a13342c03d1/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_6a2ef302-4608-4ca4-a4dc-4a13342c03d1/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_6a2ef302-4608-4ca4-a4dc-4a13342c03d1/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/floats-cbmc-regression/float22_true-unreach-call_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_6a2ef302-4608-4ca4-a4dc-4a13342c03d1/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_6a2ef302-4608-4ca4-a4dc-4a13342c03d1/bin-2019/uautomizer --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 08947af3b6f9b8a272faa540a059213a9b1de888 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 00:05:10,388 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 00:05:10,389 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 00:05:10,396 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 00:05:10,396 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 00:05:10,397 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 00:05:10,397 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 00:05:10,399 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 00:05:10,400 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 00:05:10,400 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 00:05:10,401 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 00:05:10,401 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 00:05:10,402 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 00:05:10,403 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 00:05:10,403 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 00:05:10,404 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 00:05:10,405 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 00:05:10,406 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 00:05:10,408 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 00:05:10,409 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 00:05:10,409 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 00:05:10,411 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 00:05:10,412 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 00:05:10,412 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 00:05:10,412 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 00:05:10,413 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 00:05:10,414 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 00:05:10,415 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 00:05:10,415 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 00:05:10,416 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 00:05:10,416 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 00:05:10,416 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 00:05:10,416 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 00:05:10,417 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 00:05:10,417 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 00:05:10,418 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 00:05:10,419 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_6a2ef302-4608-4ca4-a4dc-4a13342c03d1/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 00:05:10,427 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 00:05:10,427 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 00:05:10,428 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 00:05:10,428 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 00:05:10,429 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 00:05:10,429 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 00:05:10,429 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 00:05:10,429 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 00:05:10,429 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 00:05:10,429 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 00:05:10,429 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 00:05:10,429 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 00:05:10,430 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 00:05:10,430 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 00:05:10,430 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 00:05:10,430 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 00:05:10,430 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 00:05:10,430 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 00:05:10,430 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 00:05:10,430 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 00:05:10,430 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 00:05:10,431 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 00:05:10,431 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 00:05:10,431 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 00:05:10,431 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 00:05:10,431 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 00:05:10,431 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 00:05:10,431 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 00:05:10,431 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 00:05:10,432 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 00:05:10,432 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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_6a2ef302-4608-4ca4-a4dc-4a13342c03d1/bin-2019/uautomizer 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 -> Automizer 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 -> 08947af3b6f9b8a272faa540a059213a9b1de888 [2018-11-23 00:05:10,457 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 00:05:10,465 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 00:05:10,467 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 00:05:10,467 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 00:05:10,468 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 00:05:10,468 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_6a2ef302-4608-4ca4-a4dc-4a13342c03d1/bin-2019/uautomizer/../../sv-benchmarks/c/floats-cbmc-regression/float22_true-unreach-call_true-termination.i [2018-11-23 00:05:10,504 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6a2ef302-4608-4ca4-a4dc-4a13342c03d1/bin-2019/uautomizer/data/665f6e862/f677784da2da48cbb4d754d8472653d2/FLAGa5436b838 [2018-11-23 00:05:10,868 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 00:05:10,869 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_6a2ef302-4608-4ca4-a4dc-4a13342c03d1/sv-benchmarks/c/floats-cbmc-regression/float22_true-unreach-call_true-termination.i [2018-11-23 00:05:10,875 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6a2ef302-4608-4ca4-a4dc-4a13342c03d1/bin-2019/uautomizer/data/665f6e862/f677784da2da48cbb4d754d8472653d2/FLAGa5436b838 [2018-11-23 00:05:11,272 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_6a2ef302-4608-4ca4-a4dc-4a13342c03d1/bin-2019/uautomizer/data/665f6e862/f677784da2da48cbb4d754d8472653d2 [2018-11-23 00:05:11,275 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 00:05:11,276 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 00:05:11,276 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 00:05:11,276 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 00:05:11,278 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 00:05:11,279 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:05:11" (1/1) ... [2018-11-23 00:05:11,280 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c4c972c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:05:11, skipping insertion in model container [2018-11-23 00:05:11,281 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:05:11" (1/1) ... [2018-11-23 00:05:11,288 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 00:05:11,306 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 00:05:11,422 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 00:05:11,424 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 00:05:11,447 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 00:05:11,462 INFO L195 MainTranslator]: Completed translation [2018-11-23 00:05:11,462 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:05:11 WrapperNode [2018-11-23 00:05:11,463 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 00:05:11,463 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 00:05:11,463 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 00:05:11,463 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 00:05:11,469 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:05:11" (1/1) ... [2018-11-23 00:05:11,477 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:05:11" (1/1) ... [2018-11-23 00:05:11,483 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 00:05:11,483 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 00:05:11,483 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 00:05:11,483 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 00:05:11,535 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:05:11" (1/1) ... [2018-11-23 00:05:11,535 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:05:11" (1/1) ... [2018-11-23 00:05:11,539 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:05:11" (1/1) ... [2018-11-23 00:05:11,539 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:05:11" (1/1) ... [2018-11-23 00:05:11,554 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:05:11" (1/1) ... [2018-11-23 00:05:11,556 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:05:11" (1/1) ... [2018-11-23 00:05:11,559 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:05:11" (1/1) ... [2018-11-23 00:05:11,561 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 00:05:11,562 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 00:05:11,562 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 00:05:11,562 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 00:05:11,563 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:05:11" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6a2ef302-4608-4ca4-a4dc-4a13342c03d1/bin-2019/uautomizer/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 [2018-11-23 00:05:11,605 INFO L130 BoogieDeclarations]: Found specification of procedure testOne [2018-11-23 00:05:11,606 INFO L138 BoogieDeclarations]: Found implementation of procedure testOne [2018-11-23 00:05:11,606 INFO L130 BoogieDeclarations]: Found specification of procedure testThree [2018-11-23 00:05:11,606 INFO L138 BoogieDeclarations]: Found implementation of procedure testThree [2018-11-23 00:05:11,606 INFO L130 BoogieDeclarations]: Found specification of procedure returnsStructure [2018-11-23 00:05:11,606 INFO L138 BoogieDeclarations]: Found implementation of procedure returnsStructure [2018-11-23 00:05:11,606 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 00:05:11,606 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 00:05:11,606 INFO L130 BoogieDeclarations]: Found specification of procedure testTwo [2018-11-23 00:05:11,606 INFO L138 BoogieDeclarations]: Found implementation of procedure testTwo [2018-11-23 00:05:11,606 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2018-11-23 00:05:11,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 00:05:11,607 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 00:05:11,607 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 00:05:11,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2018-11-23 00:05:11,607 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 00:05:11,607 INFO L130 BoogieDeclarations]: Found specification of procedure returnsField [2018-11-23 00:05:11,607 INFO L138 BoogieDeclarations]: Found implementation of procedure returnsField [2018-11-23 00:05:11,607 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 00:05:11,607 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 00:05:11,607 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 00:05:11,607 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 00:05:11,928 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 00:05:11,928 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-23 00:05:11,928 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:05:11 BoogieIcfgContainer [2018-11-23 00:05:11,928 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 00:05:11,929 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 00:05:11,929 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 00:05:11,931 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 00:05:11,931 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:05:11" (1/3) ... [2018-11-23 00:05:11,932 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f78cb5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:05:11, skipping insertion in model container [2018-11-23 00:05:11,932 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:05:11" (2/3) ... [2018-11-23 00:05:11,932 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f78cb5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:05:11, skipping insertion in model container [2018-11-23 00:05:11,932 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:05:11" (3/3) ... [2018-11-23 00:05:11,933 INFO L112 eAbstractionObserver]: Analyzing ICFG float22_true-unreach-call_true-termination.i [2018-11-23 00:05:11,940 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 00:05:11,945 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-11-23 00:05:11,955 INFO L257 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2018-11-23 00:05:11,981 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 00:05:11,982 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 00:05:11,982 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 00:05:11,982 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 00:05:11,982 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 00:05:11,982 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 00:05:11,982 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 00:05:11,982 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 00:05:11,982 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 00:05:11,996 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states. [2018-11-23 00:05:11,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 00:05:11,999 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:05:12,000 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:05:12,002 INFO L423 AbstractCegarLoop]: === Iteration 1 === [testOneErr0ASSERT_VIOLATIONERROR_FUNCTION, testThreeErr0ASSERT_VIOLATIONERROR_FUNCTION, testTwoErr1ASSERT_VIOLATIONERROR_FUNCTION, testTwoErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:05:12,005 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:05:12,006 INFO L82 PathProgramCache]: Analyzing trace with hash 355812978, now seen corresponding path program 1 times [2018-11-23 00:05:12,007 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:05:12,007 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:05:12,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:05:12,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:05:12,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:05:12,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:05:12,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:05:12,169 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=20, |#NULL.offset|=13, |old(#NULL.base)|=20, |old(#NULL.offset)|=13] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=20, |old(#NULL.offset)|=13] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=20, |old(#NULL.offset)|=13] [?] RET #94#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret22 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call testOne(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] call ~#f1~0.base, ~#f1~0.offset := #Ultimate.alloc(12);call ~#f2~0.base, ~#f2~0.offset := #Ultimate.alloc(12); VAL [|#NULL.base|=0, |#NULL.offset|=0, |testOne_~#f1~0.base|=21, |testOne_~#f1~0.offset|=0, |testOne_~#f2~0.base|=27, |testOne_~#f2~0.offset|=0] [?] CALL call #t~ret5.ieee.negative, #t~ret5.ieee.exponent, #t~ret5.ieee.mantissa, #t~ret5.f := returnsStructure(0); VAL [|#NULL.base|=0, |#NULL.offset|=0, |returnsStructure_#in~index|=0] [?] ~index := #in~index;call ~#c~1.base, ~#c~1.offset := #Ultimate.alloc(12);call write~int(~bitwiseAnd(~index, 1) % 2, ~#c~1.base, ~#c~1.offset, 4);call write~int(0, ~#c~1.base, 4 + ~#c~1.offset, 4);call write~int(0, ~#c~1.base, 8 + ~#c~1.offset, 4);call #t~mem1 := read~int(~#c~1.base, ~#c~1.offset, 4);call #t~mem2 := read~int(~#c~1.base, 4 + ~#c~1.offset, 4);call #t~mem3 := read~int(~#c~1.base, 8 + ~#c~1.offset, 4);call #t~mem4 := read~real(~#c~1.base, ~#c~1.offset, 4);#res.ieee.negative, #res.ieee.exponent, #res.ieee.mantissa, #res.f := #t~mem1, #t~mem2, #t~mem3, #t~mem4;havoc #t~mem2;havoc #t~mem4;havoc #t~mem1;havoc #t~mem3;call ULTIMATE.dealloc(~#c~1.base, ~#c~1.offset);havoc ~#c~1.base, ~#c~1.offset; VAL [returnsStructure_~index=0, |#NULL.base|=0, |#NULL.offset|=0, |returnsStructure_#in~index|=0, |returnsStructure_#res.f|=25.0, |returnsStructure_#res.ieee.exponent|=0, |returnsStructure_#res.ieee.mantissa|=0, |returnsStructure_#res.ieee.negative|=0] [?] assume true; VAL [returnsStructure_~index=0, |#NULL.base|=0, |#NULL.offset|=0, |returnsStructure_#in~index|=0, |returnsStructure_#res.f|=25.0, |returnsStructure_#res.ieee.exponent|=0, |returnsStructure_#res.ieee.mantissa|=0, |returnsStructure_#res.ieee.negative|=0] [?] RET #72#return; VAL [|#NULL.base|=0, |#NULL.offset|=0, |testOne_#t~ret5.f|=25.0, |testOne_#t~ret5.ieee.exponent|=0, |testOne_#t~ret5.ieee.mantissa|=0, |testOne_#t~ret5.ieee.negative|=0, |testOne_~#f1~0.base|=21, |testOne_~#f1~0.offset|=0, |testOne_~#f2~0.base|=27, |testOne_~#f2~0.offset|=0] [?] call write~int(#t~ret5.ieee.negative, ~#f1~0.base, ~#f1~0.offset, 4);call write~int(#t~ret5.ieee.exponent, ~#f1~0.base, 4 + ~#f1~0.offset, 4);call write~int(#t~ret5.ieee.mantissa, ~#f1~0.base, 8 + ~#f1~0.offset, 4);call write~real(#t~ret5.f, ~#f1~0.base, ~#f1~0.offset, 4);havoc #t~ret5.ieee.negative, #t~ret5.ieee.exponent, #t~ret5.ieee.mantissa, #t~ret5.f; VAL [|#NULL.base|=0, |#NULL.offset|=0, |testOne_~#f1~0.base|=21, |testOne_~#f1~0.offset|=0, |testOne_~#f2~0.base|=27, |testOne_~#f2~0.offset|=0] [?] CALL call #t~ret6.ieee.negative, #t~ret6.ieee.exponent, #t~ret6.ieee.mantissa, #t~ret6.f := returnsStructure(1); VAL [|#NULL.base|=0, |#NULL.offset|=0, |returnsStructure_#in~index|=1] [?] ~index := #in~index;call ~#c~1.base, ~#c~1.offset := #Ultimate.alloc(12);call write~int(~bitwiseAnd(~index, 1) % 2, ~#c~1.base, ~#c~1.offset, 4);call write~int(0, ~#c~1.base, 4 + ~#c~1.offset, 4);call write~int(0, ~#c~1.base, 8 + ~#c~1.offset, 4);call #t~mem1 := read~int(~#c~1.base, ~#c~1.offset, 4);call #t~mem2 := read~int(~#c~1.base, 4 + ~#c~1.offset, 4);call #t~mem3 := read~int(~#c~1.base, 8 + ~#c~1.offset, 4);call #t~mem4 := read~real(~#c~1.base, ~#c~1.offset, 4);#res.ieee.negative, #res.ieee.exponent, #res.ieee.mantissa, #res.f := #t~mem1, #t~mem2, #t~mem3, #t~mem4;havoc #t~mem2;havoc #t~mem4;havoc #t~mem1;havoc #t~mem3;call ULTIMATE.dealloc(~#c~1.base, ~#c~1.offset);havoc ~#c~1.base, ~#c~1.offset; VAL [returnsStructure_~index=1, |#NULL.base|=0, |#NULL.offset|=0, |returnsStructure_#in~index|=1, |returnsStructure_#res.f|=19.0, |returnsStructure_#res.ieee.exponent|=0, |returnsStructure_#res.ieee.mantissa|=0, |returnsStructure_#res.ieee.negative|=0] [?] assume true; VAL [returnsStructure_~index=1, |#NULL.base|=0, |#NULL.offset|=0, |returnsStructure_#in~index|=1, |returnsStructure_#res.f|=19.0, |returnsStructure_#res.ieee.exponent|=0, |returnsStructure_#res.ieee.mantissa|=0, |returnsStructure_#res.ieee.negative|=0] [?] RET #74#return; VAL [|#NULL.base|=0, |#NULL.offset|=0, |testOne_#t~ret6.f|=19.0, |testOne_#t~ret6.ieee.exponent|=0, |testOne_#t~ret6.ieee.mantissa|=0, |testOne_#t~ret6.ieee.negative|=0, |testOne_~#f1~0.base|=21, |testOne_~#f1~0.offset|=0, |testOne_~#f2~0.base|=27, |testOne_~#f2~0.offset|=0] [?] call write~int(#t~ret6.ieee.negative, ~#f2~0.base, ~#f2~0.offset, 4);call write~int(#t~ret6.ieee.exponent, ~#f2~0.base, 4 + ~#f2~0.offset, 4);call write~int(#t~ret6.ieee.mantissa, ~#f2~0.base, 8 + ~#f2~0.offset, 4);call write~real(#t~ret6.f, ~#f2~0.base, ~#f2~0.offset, 4);havoc #t~ret6.ieee.negative, #t~ret6.ieee.exponent, #t~ret6.ieee.mantissa, #t~ret6.f;call #t~mem7 := read~int(~#f1~0.base, ~#f1~0.offset, 4);call #t~mem8 := read~int(~#f2~0.base, ~#f2~0.offset, 4); VAL [|#NULL.base|=0, |#NULL.offset|=0, |testOne_#t~mem7|=0, |testOne_#t~mem8|=0, |testOne_~#f1~0.base|=21, |testOne_~#f1~0.offset|=0, |testOne_~#f2~0.base|=27, |testOne_~#f2~0.offset|=0] [?] assume !(#t~mem7 % 4294967296 != #t~mem8 % 4294967296);havoc #t~mem8;havoc #t~mem7; VAL [|#NULL.base|=0, |#NULL.offset|=0, |testOne_~#f1~0.base|=21, |testOne_~#f1~0.offset|=0, |testOne_~#f2~0.base|=27, |testOne_~#f2~0.offset|=0] [?] assume !false; VAL [|#NULL.base|=0, |#NULL.offset|=0, |testOne_~#f1~0.base|=21, |testOne_~#f1~0.offset|=0, |testOne_~#f2~0.base|=27, |testOne_~#f2~0.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=20, #NULL.offset=13, old(#NULL.base)=20, old(#NULL.offset)=13] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=20, old(#NULL.offset)=13] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=20, old(#NULL.offset)=13] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret22 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L168] CALL call testOne(); VAL [#NULL.base=0, #NULL.offset=0] [L128] call ~#f1~0.base, ~#f1~0.offset := #Ultimate.alloc(12); [L128] call ~#f2~0.base, ~#f2~0.offset := #Ultimate.alloc(12); VAL [#NULL.base=0, #NULL.offset=0, ~#f1~0.base=21, ~#f1~0.offset=0, ~#f2~0.base=27, ~#f2~0.offset=0] [L130] CALL call #t~ret5.ieee.negative, #t~ret5.ieee.exponent, #t~ret5.ieee.mantissa, #t~ret5.f := returnsStructure(0); VAL [#in~index=0, #NULL.base=0, #NULL.offset=0] [L116-L124] ~index := #in~index; [L117] call ~#c~1.base, ~#c~1.offset := #Ultimate.alloc(12); [L119] call write~int(~bitwiseAnd(~index, 1) % 2, ~#c~1.base, ~#c~1.offset, 4); [L120] call write~int(0, ~#c~1.base, 4 + ~#c~1.offset, 4); [L121] call write~int(0, ~#c~1.base, 8 + ~#c~1.offset, 4); [L123] call #t~mem1 := read~int(~#c~1.base, ~#c~1.offset, 4); [L123] call #t~mem2 := read~int(~#c~1.base, 4 + ~#c~1.offset, 4); [L123] call #t~mem3 := read~int(~#c~1.base, 8 + ~#c~1.offset, 4); [L123] call #t~mem4 := read~real(~#c~1.base, ~#c~1.offset, 4); [L123] #res.ieee.negative, #res.ieee.exponent, #res.ieee.mantissa, #res.f := #t~mem1, #t~mem2, #t~mem3, #t~mem4; [L123] havoc #t~mem2; [L123] havoc #t~mem4; [L123] havoc #t~mem1; [L123] havoc #t~mem3; [L117] call ULTIMATE.dealloc(~#c~1.base, ~#c~1.offset); [L123] havoc ~#c~1.base, ~#c~1.offset; VAL [#in~index=0, #NULL.base=0, #NULL.offset=0, #res.f=25.0, #res.ieee.exponent=0, #res.ieee.mantissa=0, #res.ieee.negative=0, ~index=0] [L116-L124] ensures true; VAL [#in~index=0, #NULL.base=0, #NULL.offset=0, #res.f=25.0, #res.ieee.exponent=0, #res.ieee.mantissa=0, #res.ieee.negative=0, ~index=0] [L130] RET call #t~ret5.ieee.negative, #t~ret5.ieee.exponent, #t~ret5.ieee.mantissa, #t~ret5.f := returnsStructure(0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret5.f=25.0, #t~ret5.ieee.exponent=0, #t~ret5.ieee.mantissa=0, #t~ret5.ieee.negative=0, ~#f1~0.base=21, ~#f1~0.offset=0, ~#f2~0.base=27, ~#f2~0.offset=0] [L130] call write~int(#t~ret5.ieee.negative, ~#f1~0.base, ~#f1~0.offset, 4); [L130] call write~int(#t~ret5.ieee.exponent, ~#f1~0.base, 4 + ~#f1~0.offset, 4); [L130] call write~int(#t~ret5.ieee.mantissa, ~#f1~0.base, 8 + ~#f1~0.offset, 4); [L130] call write~real(#t~ret5.f, ~#f1~0.base, ~#f1~0.offset, 4); [L130] havoc #t~ret5.ieee.negative, #t~ret5.ieee.exponent, #t~ret5.ieee.mantissa, #t~ret5.f; VAL [#NULL.base=0, #NULL.offset=0, ~#f1~0.base=21, ~#f1~0.offset=0, ~#f2~0.base=27, ~#f2~0.offset=0] [L131] CALL call #t~ret6.ieee.negative, #t~ret6.ieee.exponent, #t~ret6.ieee.mantissa, #t~ret6.f := returnsStructure(1); VAL [#in~index=1, #NULL.base=0, #NULL.offset=0] [L116-L124] ~index := #in~index; [L117] call ~#c~1.base, ~#c~1.offset := #Ultimate.alloc(12); [L119] call write~int(~bitwiseAnd(~index, 1) % 2, ~#c~1.base, ~#c~1.offset, 4); [L120] call write~int(0, ~#c~1.base, 4 + ~#c~1.offset, 4); [L121] call write~int(0, ~#c~1.base, 8 + ~#c~1.offset, 4); [L123] call #t~mem1 := read~int(~#c~1.base, ~#c~1.offset, 4); [L123] call #t~mem2 := read~int(~#c~1.base, 4 + ~#c~1.offset, 4); [L123] call #t~mem3 := read~int(~#c~1.base, 8 + ~#c~1.offset, 4); [L123] call #t~mem4 := read~real(~#c~1.base, ~#c~1.offset, 4); [L123] #res.ieee.negative, #res.ieee.exponent, #res.ieee.mantissa, #res.f := #t~mem1, #t~mem2, #t~mem3, #t~mem4; [L123] havoc #t~mem2; [L123] havoc #t~mem4; [L123] havoc #t~mem1; [L123] havoc #t~mem3; [L117] call ULTIMATE.dealloc(~#c~1.base, ~#c~1.offset); [L123] havoc ~#c~1.base, ~#c~1.offset; VAL [#in~index=1, #NULL.base=0, #NULL.offset=0, #res.f=19.0, #res.ieee.exponent=0, #res.ieee.mantissa=0, #res.ieee.negative=0, ~index=1] [L116-L124] ensures true; VAL [#in~index=1, #NULL.base=0, #NULL.offset=0, #res.f=19.0, #res.ieee.exponent=0, #res.ieee.mantissa=0, #res.ieee.negative=0, ~index=1] [L131] RET call #t~ret6.ieee.negative, #t~ret6.ieee.exponent, #t~ret6.ieee.mantissa, #t~ret6.f := returnsStructure(1); VAL [#NULL.base=0, #NULL.offset=0, #t~ret6.f=19.0, #t~ret6.ieee.exponent=0, #t~ret6.ieee.mantissa=0, #t~ret6.ieee.negative=0, ~#f1~0.base=21, ~#f1~0.offset=0, ~#f2~0.base=27, ~#f2~0.offset=0] [L131] call write~int(#t~ret6.ieee.negative, ~#f2~0.base, ~#f2~0.offset, 4); [L131] call write~int(#t~ret6.ieee.exponent, ~#f2~0.base, 4 + ~#f2~0.offset, 4); [L131] call write~int(#t~ret6.ieee.mantissa, ~#f2~0.base, 8 + ~#f2~0.offset, 4); [L131] call write~real(#t~ret6.f, ~#f2~0.base, ~#f2~0.offset, 4); [L131] havoc #t~ret6.ieee.negative, #t~ret6.ieee.exponent, #t~ret6.ieee.mantissa, #t~ret6.f; [L133] call #t~mem7 := read~int(~#f1~0.base, ~#f1~0.offset, 4); [L133] call #t~mem8 := read~int(~#f2~0.base, ~#f2~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem7=0, #t~mem8=0, ~#f1~0.base=21, ~#f1~0.offset=0, ~#f2~0.base=27, ~#f2~0.offset=0] [L133] assume !(#t~mem7 % 4294967296 != #t~mem8 % 4294967296); [L133] havoc #t~mem8; [L133] havoc #t~mem7; VAL [#NULL.base=0, #NULL.offset=0, ~#f1~0.base=21, ~#f1~0.offset=0, ~#f2~0.base=27, ~#f2~0.offset=0] [L133] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~#f1~0.base=21, ~#f1~0.offset=0, ~#f2~0.base=27, ~#f2~0.offset=0] ----- [2018-11-23 00:05:12,182 WARN L416 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #res : ~ieee754_float~0 not handled [2018-11-23 00:05:12,183 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for Procedure implementation returnsStructure(#in~index : int) returns (#res : ~ieee754_float~0); and expression #res.ieee.negative [2018-11-23 00:05:12,183 WARN L416 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #res : ~ieee754_float~0 not handled [2018-11-23 00:05:12,183 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for Procedure implementation returnsStructure(#in~index : int) returns (#res : ~ieee754_float~0); and expression #res.ieee.mantissa [2018-11-23 00:05:12,183 WARN L416 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #res : ~ieee754_float~0 not handled [2018-11-23 00:05:12,183 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for Procedure implementation returnsStructure(#in~index : int) returns (#res : ~ieee754_float~0); and expression #res.ieee.exponent [2018-11-23 00:05:12,183 WARN L416 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #res : ~ieee754_float~0 not handled [2018-11-23 00:05:12,183 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for Procedure implementation returnsStructure(#in~index : int) returns (#res : ~ieee754_float~0); and expression #res.ieee.negative [2018-11-23 00:05:12,183 WARN L416 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #res : ~ieee754_float~0 not handled [2018-11-23 00:05:12,184 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for Procedure implementation returnsStructure(#in~index : int) returns (#res : ~ieee754_float~0); and expression #res.ieee.mantissa [2018-11-23 00:05:12,184 WARN L416 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #res : ~ieee754_float~0 not handled [2018-11-23 00:05:12,184 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for Procedure implementation returnsStructure(#in~index : int) returns (#res : ~ieee754_float~0); and expression #res.ieee.exponent [2018-11-23 00:05:12,184 WARN L416 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #t~ret5 : ~ieee754_float~0 not handled [2018-11-23 00:05:12,184 WARN L416 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #t~ret5 : ~ieee754_float~0 not handled [2018-11-23 00:05:12,184 WARN L416 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #t~ret5 : ~ieee754_float~0 not handled [2018-11-23 00:05:12,184 WARN L416 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #res : ~ieee754_float~0 not handled [2018-11-23 00:05:12,185 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for Procedure implementation returnsStructure(#in~index : int) returns (#res : ~ieee754_float~0); and expression #res.ieee.negative [2018-11-23 00:05:12,185 WARN L416 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #res : ~ieee754_float~0 not handled [2018-11-23 00:05:12,185 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for Procedure implementation returnsStructure(#in~index : int) returns (#res : ~ieee754_float~0); and expression #res.ieee.mantissa [2018-11-23 00:05:12,185 WARN L416 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #res : ~ieee754_float~0 not handled [2018-11-23 00:05:12,185 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for Procedure implementation returnsStructure(#in~index : int) returns (#res : ~ieee754_float~0); and expression #res.ieee.exponent [2018-11-23 00:05:12,185 WARN L416 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #res : ~ieee754_float~0 not handled [2018-11-23 00:05:12,185 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for Procedure implementation returnsStructure(#in~index : int) returns (#res : ~ieee754_float~0); and expression #res.ieee.negative [2018-11-23 00:05:12,185 WARN L416 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #res : ~ieee754_float~0 not handled [2018-11-23 00:05:12,185 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for Procedure implementation returnsStructure(#in~index : int) returns (#res : ~ieee754_float~0); and expression #res.ieee.mantissa [2018-11-23 00:05:12,186 WARN L416 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #res : ~ieee754_float~0 not handled [2018-11-23 00:05:12,186 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for Procedure implementation returnsStructure(#in~index : int) returns (#res : ~ieee754_float~0); and expression #res.ieee.exponent [2018-11-23 00:05:12,186 WARN L416 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #t~ret6 : ~ieee754_float~0 not handled [2018-11-23 00:05:12,186 WARN L416 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #t~ret6 : ~ieee754_float~0 not handled [2018-11-23 00:05:12,186 WARN L416 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #t~ret6 : ~ieee754_float~0 not handled ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=20, #NULL.offset=13, old(#NULL.base)=20, old(#NULL.offset)=13] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=20, old(#NULL.offset)=13] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=20, old(#NULL.offset)=13] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret22 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L168] CALL call testOne(); VAL [#NULL.base=0, #NULL.offset=0] [L128] call ~#f1~0.base, ~#f1~0.offset := #Ultimate.alloc(12); [L128] call ~#f2~0.base, ~#f2~0.offset := #Ultimate.alloc(12); VAL [#NULL.base=0, #NULL.offset=0, ~#f1~0.base=21, ~#f1~0.offset=0, ~#f2~0.base=27, ~#f2~0.offset=0] [L130] CALL call #t~ret5.ieee.negative, #t~ret5.ieee.exponent, #t~ret5.ieee.mantissa, #t~ret5.f := returnsStructure(0); VAL [#in~index=0, #NULL.base=0, #NULL.offset=0] [L116-L124] ~index := #in~index; [L117] call ~#c~1.base, ~#c~1.offset := #Ultimate.alloc(12); [L119] call write~int(~bitwiseAnd(~index, 1) % 2, ~#c~1.base, ~#c~1.offset, 4); [L120] call write~int(0, ~#c~1.base, 4 + ~#c~1.offset, 4); [L121] call write~int(0, ~#c~1.base, 8 + ~#c~1.offset, 4); [L123] call #t~mem1 := read~int(~#c~1.base, ~#c~1.offset, 4); [L123] call #t~mem2 := read~int(~#c~1.base, 4 + ~#c~1.offset, 4); [L123] call #t~mem3 := read~int(~#c~1.base, 8 + ~#c~1.offset, 4); [L123] call #t~mem4 := read~real(~#c~1.base, ~#c~1.offset, 4); [L123] #res.ieee.negative, #res.ieee.exponent, #res.ieee.mantissa, #res.f := #t~mem1, #t~mem2, #t~mem3, #t~mem4; [L123] havoc #t~mem2; [L123] havoc #t~mem4; [L123] havoc #t~mem1; [L123] havoc #t~mem3; [L117] call ULTIMATE.dealloc(~#c~1.base, ~#c~1.offset); [L123] havoc ~#c~1.base, ~#c~1.offset; VAL [#in~index=0, #NULL.base=0, #NULL.offset=0, #res.f=25.0, #res.ieee.exponent=0, #res.ieee.mantissa=0, #res.ieee.negative=0, ~index=0] [L116-L124] ensures true; VAL [#in~index=0, #NULL.base=0, #NULL.offset=0, #res.f=25.0, #res.ieee.exponent=0, #res.ieee.mantissa=0, #res.ieee.negative=0, ~index=0] [L130] RET call #t~ret5.ieee.negative, #t~ret5.ieee.exponent, #t~ret5.ieee.mantissa, #t~ret5.f := returnsStructure(0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret5.f=25.0, #t~ret5.ieee.exponent=0, #t~ret5.ieee.mantissa=0, #t~ret5.ieee.negative=0, ~#f1~0.base=21, ~#f1~0.offset=0, ~#f2~0.base=27, ~#f2~0.offset=0] [L130] call write~int(#t~ret5.ieee.negative, ~#f1~0.base, ~#f1~0.offset, 4); [L130] call write~int(#t~ret5.ieee.exponent, ~#f1~0.base, 4 + ~#f1~0.offset, 4); [L130] call write~int(#t~ret5.ieee.mantissa, ~#f1~0.base, 8 + ~#f1~0.offset, 4); [L130] call write~real(#t~ret5.f, ~#f1~0.base, ~#f1~0.offset, 4); [L130] havoc #t~ret5.ieee.negative, #t~ret5.ieee.exponent, #t~ret5.ieee.mantissa, #t~ret5.f; VAL [#NULL.base=0, #NULL.offset=0, ~#f1~0.base=21, ~#f1~0.offset=0, ~#f2~0.base=27, ~#f2~0.offset=0] [L131] CALL call #t~ret6.ieee.negative, #t~ret6.ieee.exponent, #t~ret6.ieee.mantissa, #t~ret6.f := returnsStructure(1); VAL [#in~index=1, #NULL.base=0, #NULL.offset=0] [L116-L124] ~index := #in~index; [L117] call ~#c~1.base, ~#c~1.offset := #Ultimate.alloc(12); [L119] call write~int(~bitwiseAnd(~index, 1) % 2, ~#c~1.base, ~#c~1.offset, 4); [L120] call write~int(0, ~#c~1.base, 4 + ~#c~1.offset, 4); [L121] call write~int(0, ~#c~1.base, 8 + ~#c~1.offset, 4); [L123] call #t~mem1 := read~int(~#c~1.base, ~#c~1.offset, 4); [L123] call #t~mem2 := read~int(~#c~1.base, 4 + ~#c~1.offset, 4); [L123] call #t~mem3 := read~int(~#c~1.base, 8 + ~#c~1.offset, 4); [L123] call #t~mem4 := read~real(~#c~1.base, ~#c~1.offset, 4); [L123] #res.ieee.negative, #res.ieee.exponent, #res.ieee.mantissa, #res.f := #t~mem1, #t~mem2, #t~mem3, #t~mem4; [L123] havoc #t~mem2; [L123] havoc #t~mem4; [L123] havoc #t~mem1; [L123] havoc #t~mem3; [L117] call ULTIMATE.dealloc(~#c~1.base, ~#c~1.offset); [L123] havoc ~#c~1.base, ~#c~1.offset; VAL [#in~index=1, #NULL.base=0, #NULL.offset=0, #res.f=19.0, #res.ieee.exponent=0, #res.ieee.mantissa=0, #res.ieee.negative=0, ~index=1] [L116-L124] ensures true; VAL [#in~index=1, #NULL.base=0, #NULL.offset=0, #res.f=19.0, #res.ieee.exponent=0, #res.ieee.mantissa=0, #res.ieee.negative=0, ~index=1] [L131] RET call #t~ret6.ieee.negative, #t~ret6.ieee.exponent, #t~ret6.ieee.mantissa, #t~ret6.f := returnsStructure(1); VAL [#NULL.base=0, #NULL.offset=0, #t~ret6.f=19.0, #t~ret6.ieee.exponent=0, #t~ret6.ieee.mantissa=0, #t~ret6.ieee.negative=0, ~#f1~0.base=21, ~#f1~0.offset=0, ~#f2~0.base=27, ~#f2~0.offset=0] [L131] call write~int(#t~ret6.ieee.negative, ~#f2~0.base, ~#f2~0.offset, 4); [L131] call write~int(#t~ret6.ieee.exponent, ~#f2~0.base, 4 + ~#f2~0.offset, 4); [L131] call write~int(#t~ret6.ieee.mantissa, ~#f2~0.base, 8 + ~#f2~0.offset, 4); [L131] call write~real(#t~ret6.f, ~#f2~0.base, ~#f2~0.offset, 4); [L131] havoc #t~ret6.ieee.negative, #t~ret6.ieee.exponent, #t~ret6.ieee.mantissa, #t~ret6.f; [L133] call #t~mem7 := read~int(~#f1~0.base, ~#f1~0.offset, 4); [L133] call #t~mem8 := read~int(~#f2~0.base, ~#f2~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem7=0, #t~mem8=0, ~#f1~0.base=21, ~#f1~0.offset=0, ~#f2~0.base=27, ~#f2~0.offset=0] [L133] assume !(#t~mem7 % 4294967296 != #t~mem8 % 4294967296); [L133] havoc #t~mem8; [L133] havoc #t~mem7; VAL [#NULL.base=0, #NULL.offset=0, ~#f1~0.base=21, ~#f1~0.offset=0, ~#f2~0.base=27, ~#f2~0.offset=0] [L133] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~#f1~0.base=21, ~#f1~0.offset=0, ~#f2~0.base=27, ~#f2~0.offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=20, #NULL!offset=13, old(#NULL!base)=20, old(#NULL!offset)=13] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=20, old(#NULL!offset)=13] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret22 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L168] CALL call testOne(); VAL [#NULL!base=0, #NULL!offset=0] [L128] FCALL call ~#f1~0 := #Ultimate.alloc(12); [L128] FCALL call ~#f2~0 := #Ultimate.alloc(12); VAL [#NULL!base=0, #NULL!offset=0, ~#f1~0!base=21, ~#f1~0!offset=0, ~#f2~0!base=27, ~#f2~0!offset=0] [L130] CALL call #t~ret5 := returnsStructure(0); VAL [#in~index=0, #NULL!base=0, #NULL!offset=0] [L116-L124] ~index := #in~index; [L117] FCALL call ~#c~1 := #Ultimate.alloc(12); [L119] FCALL call write~int(~bitwiseAnd(~index, 1) % 2, { base: ~#c~1!base, offset: ~#c~1!offset }, 4); [L120] FCALL call write~int(0, { base: ~#c~1!base, offset: 4 + ~#c~1!offset }, 4); [L121] FCALL call write~int(0, { base: ~#c~1!base, offset: 8 + ~#c~1!offset }, 4); [L123] FCALL call #t~mem1 := read~int({ base: { base: ~#c~1!base, offset: ~#c~1!offset }!base, offset: { base: ~#c~1!base, offset: ~#c~1!offset }!offset }, 4); [L123] FCALL call #t~mem2 := read~int({ base: { base: ~#c~1!base, offset: ~#c~1!offset }!base, offset: 4 + { base: ~#c~1!base, offset: ~#c~1!offset }!offset }, 4); [L123] FCALL call #t~mem3 := read~int({ base: { base: ~#c~1!base, offset: ~#c~1!offset }!base, offset: 8 + { base: ~#c~1!base, offset: ~#c~1!offset }!offset }, 4); [L123] FCALL call #t~mem4 := read~real({ base: ~#c~1!base, offset: ~#c~1!offset }, 4); [L123] #res := { ieee: { negative: #t~mem1, exponent: #t~mem2, mantissa: #t~mem3 }, f: #t~mem4 }; [L123] havoc #t~mem2; [L123] havoc #t~mem4; [L123] havoc #t~mem1; [L123] havoc #t~mem3; [L117] FCALL call ULTIMATE.dealloc(~#c~1); [L123] havoc ~#c~1; VAL [#in~index=0, #NULL!base=0, #NULL!offset=0, #res!f=25.0, #res.ieee.exponent=0, #res.ieee.mantissa=0, #res.ieee.negative=0, ~index=0] [L130] RET call #t~ret5 := returnsStructure(0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret5!f=25.0, #t~ret5.ieee.exponent=0, #t~ret5.ieee.mantissa=0, #t~ret5.ieee.negative=0, ~#f1~0!base=21, ~#f1~0!offset=0, ~#f2~0!base=27, ~#f2~0!offset=0] [L130] FCALL call write~int(#t~ret5!ieee!negative, { base: ~#f1~0!base, offset: ~#f1~0!offset }, 4); [L130] FCALL call write~int(#t~ret5!ieee!exponent, { base: ~#f1~0!base, offset: 4 + ~#f1~0!offset }, 4); [L130] FCALL call write~int(#t~ret5!ieee!mantissa, { base: ~#f1~0!base, offset: 8 + ~#f1~0!offset }, 4); [L130] FCALL call write~real(#t~ret5!f, { base: ~#f1~0!base, offset: ~#f1~0!offset }, 4); [L130] havoc #t~ret5; VAL [#NULL!base=0, #NULL!offset=0, ~#f1~0!base=21, ~#f1~0!offset=0, ~#f2~0!base=27, ~#f2~0!offset=0] [L131] CALL call #t~ret6 := returnsStructure(1); VAL [#in~index=1, #NULL!base=0, #NULL!offset=0] [L116-L124] ~index := #in~index; [L117] FCALL call ~#c~1 := #Ultimate.alloc(12); [L119] FCALL call write~int(~bitwiseAnd(~index, 1) % 2, { base: ~#c~1!base, offset: ~#c~1!offset }, 4); [L120] FCALL call write~int(0, { base: ~#c~1!base, offset: 4 + ~#c~1!offset }, 4); [L121] FCALL call write~int(0, { base: ~#c~1!base, offset: 8 + ~#c~1!offset }, 4); [L123] FCALL call #t~mem1 := read~int({ base: { base: ~#c~1!base, offset: ~#c~1!offset }!base, offset: { base: ~#c~1!base, offset: ~#c~1!offset }!offset }, 4); [L123] FCALL call #t~mem2 := read~int({ base: { base: ~#c~1!base, offset: ~#c~1!offset }!base, offset: 4 + { base: ~#c~1!base, offset: ~#c~1!offset }!offset }, 4); [L123] FCALL call #t~mem3 := read~int({ base: { base: ~#c~1!base, offset: ~#c~1!offset }!base, offset: 8 + { base: ~#c~1!base, offset: ~#c~1!offset }!offset }, 4); [L123] FCALL call #t~mem4 := read~real({ base: ~#c~1!base, offset: ~#c~1!offset }, 4); [L123] #res := { ieee: { negative: #t~mem1, exponent: #t~mem2, mantissa: #t~mem3 }, f: #t~mem4 }; [L123] havoc #t~mem2; [L123] havoc #t~mem4; [L123] havoc #t~mem1; [L123] havoc #t~mem3; [L117] FCALL call ULTIMATE.dealloc(~#c~1); [L123] havoc ~#c~1; VAL [#in~index=1, #NULL!base=0, #NULL!offset=0, #res!f=19.0, #res.ieee.exponent=0, #res.ieee.mantissa=0, #res.ieee.negative=0, ~index=1] [L131] RET call #t~ret6 := returnsStructure(1); VAL [#NULL!base=0, #NULL!offset=0, #t~ret6!f=19.0, #t~ret6.ieee.exponent=0, #t~ret6.ieee.mantissa=0, #t~ret6.ieee.negative=0, ~#f1~0!base=21, ~#f1~0!offset=0, ~#f2~0!base=27, ~#f2~0!offset=0] [L131] FCALL call write~int(#t~ret6!ieee!negative, { base: ~#f2~0!base, offset: ~#f2~0!offset }, 4); [L131] FCALL call write~int(#t~ret6!ieee!exponent, { base: ~#f2~0!base, offset: 4 + ~#f2~0!offset }, 4); [L131] FCALL call write~int(#t~ret6!ieee!mantissa, { base: ~#f2~0!base, offset: 8 + ~#f2~0!offset }, 4); [L131] FCALL call write~real(#t~ret6!f, { base: ~#f2~0!base, offset: ~#f2~0!offset }, 4); [L131] havoc #t~ret6; [L133] FCALL call #t~mem7 := read~int({ base: ~#f1~0!base, offset: ~#f1~0!offset }, 4); [L133] FCALL call #t~mem8 := read~int({ base: ~#f2~0!base, offset: ~#f2~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem7=0, #t~mem8=0, ~#f1~0!base=21, ~#f1~0!offset=0, ~#f2~0!base=27, ~#f2~0!offset=0] [L133] COND TRUE !(#t~mem7 % 4294967296 != #t~mem8 % 4294967296) [L133] havoc #t~mem8; [L133] havoc #t~mem7; VAL [#NULL!base=0, #NULL!offset=0, ~#f1~0!base=21, ~#f1~0!offset=0, ~#f2~0!base=27, ~#f2~0!offset=0] [L133] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~#f1~0!base=21, ~#f1~0!offset=0, ~#f2~0!base=27, ~#f2~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=20, #NULL!offset=13, old(#NULL!base)=20, old(#NULL!offset)=13] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=20, old(#NULL!offset)=13] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret22 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L168] CALL call testOne(); VAL [#NULL!base=0, #NULL!offset=0] [L128] FCALL call ~#f1~0 := #Ultimate.alloc(12); [L128] FCALL call ~#f2~0 := #Ultimate.alloc(12); VAL [#NULL!base=0, #NULL!offset=0, ~#f1~0!base=21, ~#f1~0!offset=0, ~#f2~0!base=27, ~#f2~0!offset=0] [L130] CALL call #t~ret5 := returnsStructure(0); VAL [#in~index=0, #NULL!base=0, #NULL!offset=0] [L116-L124] ~index := #in~index; [L117] FCALL call ~#c~1 := #Ultimate.alloc(12); [L119] FCALL call write~int(~bitwiseAnd(~index, 1) % 2, { base: ~#c~1!base, offset: ~#c~1!offset }, 4); [L120] FCALL call write~int(0, { base: ~#c~1!base, offset: 4 + ~#c~1!offset }, 4); [L121] FCALL call write~int(0, { base: ~#c~1!base, offset: 8 + ~#c~1!offset }, 4); [L123] FCALL call #t~mem1 := read~int({ base: { base: ~#c~1!base, offset: ~#c~1!offset }!base, offset: { base: ~#c~1!base, offset: ~#c~1!offset }!offset }, 4); [L123] FCALL call #t~mem2 := read~int({ base: { base: ~#c~1!base, offset: ~#c~1!offset }!base, offset: 4 + { base: ~#c~1!base, offset: ~#c~1!offset }!offset }, 4); [L123] FCALL call #t~mem3 := read~int({ base: { base: ~#c~1!base, offset: ~#c~1!offset }!base, offset: 8 + { base: ~#c~1!base, offset: ~#c~1!offset }!offset }, 4); [L123] FCALL call #t~mem4 := read~real({ base: ~#c~1!base, offset: ~#c~1!offset }, 4); [L123] #res := { ieee: { negative: #t~mem1, exponent: #t~mem2, mantissa: #t~mem3 }, f: #t~mem4 }; [L123] havoc #t~mem2; [L123] havoc #t~mem4; [L123] havoc #t~mem1; [L123] havoc #t~mem3; [L117] FCALL call ULTIMATE.dealloc(~#c~1); [L123] havoc ~#c~1; VAL [#in~index=0, #NULL!base=0, #NULL!offset=0, #res!f=25.0, #res.ieee.exponent=0, #res.ieee.mantissa=0, #res.ieee.negative=0, ~index=0] [L130] RET call #t~ret5 := returnsStructure(0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret5!f=25.0, #t~ret5.ieee.exponent=0, #t~ret5.ieee.mantissa=0, #t~ret5.ieee.negative=0, ~#f1~0!base=21, ~#f1~0!offset=0, ~#f2~0!base=27, ~#f2~0!offset=0] [L130] FCALL call write~int(#t~ret5!ieee!negative, { base: ~#f1~0!base, offset: ~#f1~0!offset }, 4); [L130] FCALL call write~int(#t~ret5!ieee!exponent, { base: ~#f1~0!base, offset: 4 + ~#f1~0!offset }, 4); [L130] FCALL call write~int(#t~ret5!ieee!mantissa, { base: ~#f1~0!base, offset: 8 + ~#f1~0!offset }, 4); [L130] FCALL call write~real(#t~ret5!f, { base: ~#f1~0!base, offset: ~#f1~0!offset }, 4); [L130] havoc #t~ret5; VAL [#NULL!base=0, #NULL!offset=0, ~#f1~0!base=21, ~#f1~0!offset=0, ~#f2~0!base=27, ~#f2~0!offset=0] [L131] CALL call #t~ret6 := returnsStructure(1); VAL [#in~index=1, #NULL!base=0, #NULL!offset=0] [L116-L124] ~index := #in~index; [L117] FCALL call ~#c~1 := #Ultimate.alloc(12); [L119] FCALL call write~int(~bitwiseAnd(~index, 1) % 2, { base: ~#c~1!base, offset: ~#c~1!offset }, 4); [L120] FCALL call write~int(0, { base: ~#c~1!base, offset: 4 + ~#c~1!offset }, 4); [L121] FCALL call write~int(0, { base: ~#c~1!base, offset: 8 + ~#c~1!offset }, 4); [L123] FCALL call #t~mem1 := read~int({ base: { base: ~#c~1!base, offset: ~#c~1!offset }!base, offset: { base: ~#c~1!base, offset: ~#c~1!offset }!offset }, 4); [L123] FCALL call #t~mem2 := read~int({ base: { base: ~#c~1!base, offset: ~#c~1!offset }!base, offset: 4 + { base: ~#c~1!base, offset: ~#c~1!offset }!offset }, 4); [L123] FCALL call #t~mem3 := read~int({ base: { base: ~#c~1!base, offset: ~#c~1!offset }!base, offset: 8 + { base: ~#c~1!base, offset: ~#c~1!offset }!offset }, 4); [L123] FCALL call #t~mem4 := read~real({ base: ~#c~1!base, offset: ~#c~1!offset }, 4); [L123] #res := { ieee: { negative: #t~mem1, exponent: #t~mem2, mantissa: #t~mem3 }, f: #t~mem4 }; [L123] havoc #t~mem2; [L123] havoc #t~mem4; [L123] havoc #t~mem1; [L123] havoc #t~mem3; [L117] FCALL call ULTIMATE.dealloc(~#c~1); [L123] havoc ~#c~1; VAL [#in~index=1, #NULL!base=0, #NULL!offset=0, #res!f=19.0, #res.ieee.exponent=0, #res.ieee.mantissa=0, #res.ieee.negative=0, ~index=1] [L131] RET call #t~ret6 := returnsStructure(1); VAL [#NULL!base=0, #NULL!offset=0, #t~ret6!f=19.0, #t~ret6.ieee.exponent=0, #t~ret6.ieee.mantissa=0, #t~ret6.ieee.negative=0, ~#f1~0!base=21, ~#f1~0!offset=0, ~#f2~0!base=27, ~#f2~0!offset=0] [L131] FCALL call write~int(#t~ret6!ieee!negative, { base: ~#f2~0!base, offset: ~#f2~0!offset }, 4); [L131] FCALL call write~int(#t~ret6!ieee!exponent, { base: ~#f2~0!base, offset: 4 + ~#f2~0!offset }, 4); [L131] FCALL call write~int(#t~ret6!ieee!mantissa, { base: ~#f2~0!base, offset: 8 + ~#f2~0!offset }, 4); [L131] FCALL call write~real(#t~ret6!f, { base: ~#f2~0!base, offset: ~#f2~0!offset }, 4); [L131] havoc #t~ret6; [L133] FCALL call #t~mem7 := read~int({ base: ~#f1~0!base, offset: ~#f1~0!offset }, 4); [L133] FCALL call #t~mem8 := read~int({ base: ~#f2~0!base, offset: ~#f2~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem7=0, #t~mem8=0, ~#f1~0!base=21, ~#f1~0!offset=0, ~#f2~0!base=27, ~#f2~0!offset=0] [L133] COND TRUE !(#t~mem7 % 4294967296 != #t~mem8 % 4294967296) [L133] havoc #t~mem8; [L133] havoc #t~mem7; VAL [#NULL!base=0, #NULL!offset=0, ~#f1~0!base=21, ~#f1~0!offset=0, ~#f2~0!base=27, ~#f2~0!offset=0] [L133] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~#f1~0!base=21, ~#f1~0!offset=0, ~#f2~0!base=27, ~#f2~0!offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=20, #NULL!offset=13, old(#NULL!base)=20, old(#NULL!offset)=13] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=20, old(#NULL!offset)=13] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret22 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L168] CALL call testOne(); VAL [#NULL!base=0, #NULL!offset=0] [L128] FCALL call ~#f1~0 := #Ultimate.alloc(12); [L128] FCALL call ~#f2~0 := #Ultimate.alloc(12); VAL [#NULL!base=0, #NULL!offset=0, ~#f1~0!base=21, ~#f1~0!offset=0, ~#f2~0!base=27, ~#f2~0!offset=0] [L130] CALL call #t~ret5 := returnsStructure(0); VAL [#in~index=0, #NULL!base=0, #NULL!offset=0] [L116-L124] ~index := #in~index; [L117] FCALL call ~#c~1 := #Ultimate.alloc(12); [L119] FCALL call write~int(~bitwiseAnd(~index, 1) % 2, { base: ~#c~1!base, offset: ~#c~1!offset }, 4); [L120] FCALL call write~int(0, { base: ~#c~1!base, offset: 4 + ~#c~1!offset }, 4); [L121] FCALL call write~int(0, { base: ~#c~1!base, offset: 8 + ~#c~1!offset }, 4); [L123] FCALL call #t~mem1 := read~int({ base: { base: ~#c~1!base, offset: ~#c~1!offset }!base, offset: { base: ~#c~1!base, offset: ~#c~1!offset }!offset }, 4); [L123] FCALL call #t~mem2 := read~int({ base: { base: ~#c~1!base, offset: ~#c~1!offset }!base, offset: 4 + { base: ~#c~1!base, offset: ~#c~1!offset }!offset }, 4); [L123] FCALL call #t~mem3 := read~int({ base: { base: ~#c~1!base, offset: ~#c~1!offset }!base, offset: 8 + { base: ~#c~1!base, offset: ~#c~1!offset }!offset }, 4); [L123] FCALL call #t~mem4 := read~real({ base: ~#c~1!base, offset: ~#c~1!offset }, 4); [L123] #res := { ieee: { negative: #t~mem1, exponent: #t~mem2, mantissa: #t~mem3 }, f: #t~mem4 }; [L123] havoc #t~mem2; [L123] havoc #t~mem4; [L123] havoc #t~mem1; [L123] havoc #t~mem3; [L117] FCALL call ULTIMATE.dealloc(~#c~1); [L123] havoc ~#c~1; VAL [#in~index=0, #NULL!base=0, #NULL!offset=0, #res!f=25.0, #res.ieee.exponent=0, #res.ieee.mantissa=0, #res.ieee.negative=0, ~index=0] [L130] RET call #t~ret5 := returnsStructure(0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret5!f=25.0, #t~ret5.ieee.exponent=0, #t~ret5.ieee.mantissa=0, #t~ret5.ieee.negative=0, ~#f1~0!base=21, ~#f1~0!offset=0, ~#f2~0!base=27, ~#f2~0!offset=0] [L130] FCALL call write~int(#t~ret5!ieee!negative, { base: ~#f1~0!base, offset: ~#f1~0!offset }, 4); [L130] FCALL call write~int(#t~ret5!ieee!exponent, { base: ~#f1~0!base, offset: 4 + ~#f1~0!offset }, 4); [L130] FCALL call write~int(#t~ret5!ieee!mantissa, { base: ~#f1~0!base, offset: 8 + ~#f1~0!offset }, 4); [L130] FCALL call write~real(#t~ret5!f, { base: ~#f1~0!base, offset: ~#f1~0!offset }, 4); [L130] havoc #t~ret5; VAL [#NULL!base=0, #NULL!offset=0, ~#f1~0!base=21, ~#f1~0!offset=0, ~#f2~0!base=27, ~#f2~0!offset=0] [L131] CALL call #t~ret6 := returnsStructure(1); VAL [#in~index=1, #NULL!base=0, #NULL!offset=0] [L116-L124] ~index := #in~index; [L117] FCALL call ~#c~1 := #Ultimate.alloc(12); [L119] FCALL call write~int(~bitwiseAnd(~index, 1) % 2, { base: ~#c~1!base, offset: ~#c~1!offset }, 4); [L120] FCALL call write~int(0, { base: ~#c~1!base, offset: 4 + ~#c~1!offset }, 4); [L121] FCALL call write~int(0, { base: ~#c~1!base, offset: 8 + ~#c~1!offset }, 4); [L123] FCALL call #t~mem1 := read~int({ base: { base: ~#c~1!base, offset: ~#c~1!offset }!base, offset: { base: ~#c~1!base, offset: ~#c~1!offset }!offset }, 4); [L123] FCALL call #t~mem2 := read~int({ base: { base: ~#c~1!base, offset: ~#c~1!offset }!base, offset: 4 + { base: ~#c~1!base, offset: ~#c~1!offset }!offset }, 4); [L123] FCALL call #t~mem3 := read~int({ base: { base: ~#c~1!base, offset: ~#c~1!offset }!base, offset: 8 + { base: ~#c~1!base, offset: ~#c~1!offset }!offset }, 4); [L123] FCALL call #t~mem4 := read~real({ base: ~#c~1!base, offset: ~#c~1!offset }, 4); [L123] #res := { ieee: { negative: #t~mem1, exponent: #t~mem2, mantissa: #t~mem3 }, f: #t~mem4 }; [L123] havoc #t~mem2; [L123] havoc #t~mem4; [L123] havoc #t~mem1; [L123] havoc #t~mem3; [L117] FCALL call ULTIMATE.dealloc(~#c~1); [L123] havoc ~#c~1; VAL [#in~index=1, #NULL!base=0, #NULL!offset=0, #res!f=19.0, #res.ieee.exponent=0, #res.ieee.mantissa=0, #res.ieee.negative=0, ~index=1] [L131] RET call #t~ret6 := returnsStructure(1); VAL [#NULL!base=0, #NULL!offset=0, #t~ret6!f=19.0, #t~ret6.ieee.exponent=0, #t~ret6.ieee.mantissa=0, #t~ret6.ieee.negative=0, ~#f1~0!base=21, ~#f1~0!offset=0, ~#f2~0!base=27, ~#f2~0!offset=0] [L131] FCALL call write~int(#t~ret6!ieee!negative, { base: ~#f2~0!base, offset: ~#f2~0!offset }, 4); [L131] FCALL call write~int(#t~ret6!ieee!exponent, { base: ~#f2~0!base, offset: 4 + ~#f2~0!offset }, 4); [L131] FCALL call write~int(#t~ret6!ieee!mantissa, { base: ~#f2~0!base, offset: 8 + ~#f2~0!offset }, 4); [L131] FCALL call write~real(#t~ret6!f, { base: ~#f2~0!base, offset: ~#f2~0!offset }, 4); [L131] havoc #t~ret6; [L133] FCALL call #t~mem7 := read~int({ base: ~#f1~0!base, offset: ~#f1~0!offset }, 4); [L133] FCALL call #t~mem8 := read~int({ base: ~#f2~0!base, offset: ~#f2~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem7=0, #t~mem8=0, ~#f1~0!base=21, ~#f1~0!offset=0, ~#f2~0!base=27, ~#f2~0!offset=0] [L133] COND TRUE !(#t~mem7 % 4294967296 != #t~mem8 % 4294967296) [L133] havoc #t~mem8; [L133] havoc #t~mem7; VAL [#NULL!base=0, #NULL!offset=0, ~#f1~0!base=21, ~#f1~0!offset=0, ~#f2~0!base=27, ~#f2~0!offset=0] [L133] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~#f1~0!base=21, ~#f1~0!offset=0, ~#f2~0!base=27, ~#f2~0!offset=0] ----- [2018-11-23 00:05:12,198 WARN L1272 BoogieBacktranslator]: unknown boogie variable #res.ieee.negative [2018-11-23 00:05:12,198 WARN L1272 BoogieBacktranslator]: unknown boogie variable #res.ieee.mantissa [2018-11-23 00:05:12,198 WARN L1272 BoogieBacktranslator]: unknown boogie variable #res!f [2018-11-23 00:05:12,199 WARN L1272 BoogieBacktranslator]: unknown boogie variable #res.ieee.exponent [2018-11-23 00:05:12,199 WARN L1272 BoogieBacktranslator]: unknown boogie variable #res.ieee.negative [2018-11-23 00:05:12,199 WARN L1272 BoogieBacktranslator]: unknown boogie variable #res.ieee.mantissa [2018-11-23 00:05:12,199 WARN L1272 BoogieBacktranslator]: unknown boogie variable #res.ieee.exponent [2018-11-23 00:05:12,199 WARN L1272 BoogieBacktranslator]: unknown boogie variable #res!f ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=20, #NULL!offset=13, old(#NULL!base)=20, old(#NULL!offset)=13] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=20, old(#NULL!offset)=13] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret22 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L168] CALL call testOne(); VAL [#NULL!base=0, #NULL!offset=0] [L128] FCALL call ~#f1~0 := #Ultimate.alloc(12); [L128] FCALL call ~#f2~0 := #Ultimate.alloc(12); VAL [#NULL!base=0, #NULL!offset=0, ~#f1~0!base=21, ~#f1~0!offset=0, ~#f2~0!base=27, ~#f2~0!offset=0] [L130] CALL call #t~ret5 := returnsStructure(0); VAL [#in~index=0, #NULL!base=0, #NULL!offset=0] [L116-L124] ~index := #in~index; [L117] FCALL call ~#c~1 := #Ultimate.alloc(12); [L119] FCALL call write~int(~bitwiseAnd(~index, 1) % 2, { base: ~#c~1!base, offset: ~#c~1!offset }, 4); [L120] FCALL call write~int(0, { base: ~#c~1!base, offset: 4 + ~#c~1!offset }, 4); [L121] FCALL call write~int(0, { base: ~#c~1!base, offset: 8 + ~#c~1!offset }, 4); [L123] FCALL call #t~mem1 := read~int({ base: { base: ~#c~1!base, offset: ~#c~1!offset }!base, offset: { base: ~#c~1!base, offset: ~#c~1!offset }!offset }, 4); [L123] FCALL call #t~mem2 := read~int({ base: { base: ~#c~1!base, offset: ~#c~1!offset }!base, offset: 4 + { base: ~#c~1!base, offset: ~#c~1!offset }!offset }, 4); [L123] FCALL call #t~mem3 := read~int({ base: { base: ~#c~1!base, offset: ~#c~1!offset }!base, offset: 8 + { base: ~#c~1!base, offset: ~#c~1!offset }!offset }, 4); [L123] FCALL call #t~mem4 := read~real({ base: ~#c~1!base, offset: ~#c~1!offset }, 4); [L123] #res := { ieee: { negative: #t~mem1, exponent: #t~mem2, mantissa: #t~mem3 }, f: #t~mem4 }; [L123] havoc #t~mem2; [L123] havoc #t~mem4; [L123] havoc #t~mem1; [L123] havoc #t~mem3; [L117] FCALL call ULTIMATE.dealloc(~#c~1); [L123] havoc ~#c~1; VAL [#in~index=0, #NULL!base=0, #NULL!offset=0, #res!f=25.0, #res.ieee.exponent=0, #res.ieee.mantissa=0, #res.ieee.negative=0, ~index=0] [L130] RET call #t~ret5 := returnsStructure(0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret5!f=25.0, #t~ret5.ieee.exponent=0, #t~ret5.ieee.mantissa=0, #t~ret5.ieee.negative=0, ~#f1~0!base=21, ~#f1~0!offset=0, ~#f2~0!base=27, ~#f2~0!offset=0] [L130] FCALL call write~int(#t~ret5!ieee!negative, { base: ~#f1~0!base, offset: ~#f1~0!offset }, 4); [L130] FCALL call write~int(#t~ret5!ieee!exponent, { base: ~#f1~0!base, offset: 4 + ~#f1~0!offset }, 4); [L130] FCALL call write~int(#t~ret5!ieee!mantissa, { base: ~#f1~0!base, offset: 8 + ~#f1~0!offset }, 4); [L130] FCALL call write~real(#t~ret5!f, { base: ~#f1~0!base, offset: ~#f1~0!offset }, 4); [L130] havoc #t~ret5; VAL [#NULL!base=0, #NULL!offset=0, ~#f1~0!base=21, ~#f1~0!offset=0, ~#f2~0!base=27, ~#f2~0!offset=0] [L131] CALL call #t~ret6 := returnsStructure(1); VAL [#in~index=1, #NULL!base=0, #NULL!offset=0] [L116-L124] ~index := #in~index; [L117] FCALL call ~#c~1 := #Ultimate.alloc(12); [L119] FCALL call write~int(~bitwiseAnd(~index, 1) % 2, { base: ~#c~1!base, offset: ~#c~1!offset }, 4); [L120] FCALL call write~int(0, { base: ~#c~1!base, offset: 4 + ~#c~1!offset }, 4); [L121] FCALL call write~int(0, { base: ~#c~1!base, offset: 8 + ~#c~1!offset }, 4); [L123] FCALL call #t~mem1 := read~int({ base: { base: ~#c~1!base, offset: ~#c~1!offset }!base, offset: { base: ~#c~1!base, offset: ~#c~1!offset }!offset }, 4); [L123] FCALL call #t~mem2 := read~int({ base: { base: ~#c~1!base, offset: ~#c~1!offset }!base, offset: 4 + { base: ~#c~1!base, offset: ~#c~1!offset }!offset }, 4); [L123] FCALL call #t~mem3 := read~int({ base: { base: ~#c~1!base, offset: ~#c~1!offset }!base, offset: 8 + { base: ~#c~1!base, offset: ~#c~1!offset }!offset }, 4); [L123] FCALL call #t~mem4 := read~real({ base: ~#c~1!base, offset: ~#c~1!offset }, 4); [L123] #res := { ieee: { negative: #t~mem1, exponent: #t~mem2, mantissa: #t~mem3 }, f: #t~mem4 }; [L123] havoc #t~mem2; [L123] havoc #t~mem4; [L123] havoc #t~mem1; [L123] havoc #t~mem3; [L117] FCALL call ULTIMATE.dealloc(~#c~1); [L123] havoc ~#c~1; VAL [#in~index=1, #NULL!base=0, #NULL!offset=0, #res!f=19.0, #res.ieee.exponent=0, #res.ieee.mantissa=0, #res.ieee.negative=0, ~index=1] [L131] RET call #t~ret6 := returnsStructure(1); VAL [#NULL!base=0, #NULL!offset=0, #t~ret6!f=19.0, #t~ret6.ieee.exponent=0, #t~ret6.ieee.mantissa=0, #t~ret6.ieee.negative=0, ~#f1~0!base=21, ~#f1~0!offset=0, ~#f2~0!base=27, ~#f2~0!offset=0] [L131] FCALL call write~int(#t~ret6!ieee!negative, { base: ~#f2~0!base, offset: ~#f2~0!offset }, 4); [L131] FCALL call write~int(#t~ret6!ieee!exponent, { base: ~#f2~0!base, offset: 4 + ~#f2~0!offset }, 4); [L131] FCALL call write~int(#t~ret6!ieee!mantissa, { base: ~#f2~0!base, offset: 8 + ~#f2~0!offset }, 4); [L131] FCALL call write~real(#t~ret6!f, { base: ~#f2~0!base, offset: ~#f2~0!offset }, 4); [L131] havoc #t~ret6; [L133] FCALL call #t~mem7 := read~int({ base: ~#f1~0!base, offset: ~#f1~0!offset }, 4); [L133] FCALL call #t~mem8 := read~int({ base: ~#f2~0!base, offset: ~#f2~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem7=0, #t~mem8=0, ~#f1~0!base=21, ~#f1~0!offset=0, ~#f2~0!base=27, ~#f2~0!offset=0] [L133] COND TRUE !(#t~mem7 % 4294967296 != #t~mem8 % 4294967296) [L133] havoc #t~mem8; [L133] havoc #t~mem7; VAL [#NULL!base=0, #NULL!offset=0, ~#f1~0!base=21, ~#f1~0!offset=0, ~#f2~0!base=27, ~#f2~0!offset=0] [L133] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~#f1~0!base=21, ~#f1~0!offset=0, ~#f2~0!base=27, ~#f2~0!offset=0] [L168] CALL testOne() [L128] ieee754_float f1, f2; VAL [f1={21:0}, f2={27:0}] [L130] CALL, EXPR returnsStructure(0) VAL [\old(index)=0] [L117] ieee754_float c; [L119] c.ieee.negative = index & 0x1 [L120] c.ieee.exponent = 0 [L121] c.ieee.mantissa = 0 [L123] return c; [L123] return c; VAL [\old(index)=0, index=0, unknown-#res!f-unknown=25, unknown-#res.ieee.exponent-unknown=0, unknown-#res.ieee.mantissa-unknown=0, unknown-#res.ieee.negative-unknown=0] [L130] RET, EXPR returnsStructure(0) VAL [f1={21:0}, f2={27:0}, returnsStructure(0)=0returnsStructure(0)=0returnsStructure(0)=0returnsStructure(0)=25] [L130] f1 = returnsStructure(0) [L131] CALL, EXPR returnsStructure(1) VAL [\old(index)=1] [L117] ieee754_float c; [L119] c.ieee.negative = index & 0x1 [L120] c.ieee.exponent = 0 [L121] c.ieee.mantissa = 0 [L123] return c; [L123] return c; VAL [\old(index)=1, index=1, unknown-#res!f-unknown=19, unknown-#res.ieee.exponent-unknown=0, unknown-#res.ieee.mantissa-unknown=0, unknown-#res.ieee.negative-unknown=0] [L131] RET, EXPR returnsStructure(1) VAL [f1={21:0}, f2={27:0}, returnsStructure(1)=0returnsStructure(1)=0returnsStructure(1)=19returnsStructure(1)=0] [L131] f2 = returnsStructure(1) [L133] EXPR f1.ieee.negative [L133] EXPR f2.ieee.negative VAL [f1={21:0}, f1.ieee.negative=0, f2={27:0}, f2.ieee.negative=0] [L133] COND TRUE !(f1.ieee.negative != f2.ieee.negative) [L133] __VERIFIER_error() VAL [f1={21:0}, f2={27:0}] ----- [2018-11-23 00:05:12,205 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 12:05:12 BoogieIcfgContainer [2018-11-23 00:05:12,205 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 00:05:12,205 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 00:05:12,205 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 00:05:12,205 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 00:05:12,206 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:05:11" (3/4) ... [2018-11-23 00:05:12,210 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 00:05:12,210 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 00:05:12,211 INFO L168 Benchmark]: Toolchain (without parser) took 935.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 162.5 MB). Free memory was 959.1 MB in the beginning and 1.1 GB in the end (delta: -138.8 MB). Peak memory consumption was 23.8 MB. Max. memory is 11.5 GB. [2018-11-23 00:05:12,212 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 00:05:12,212 INFO L168 Benchmark]: CACSL2BoogieTranslator took 186.44 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 945.7 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-11-23 00:05:12,212 INFO L168 Benchmark]: Boogie Procedure Inliner took 19.81 ms. Allocated memory is still 1.0 GB. Free memory was 945.7 MB in the beginning and 943.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 00:05:12,213 INFO L168 Benchmark]: Boogie Preprocessor took 78.26 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 162.5 MB). Free memory was 943.0 MB in the beginning and 1.2 GB in the end (delta: -208.3 MB). Peak memory consumption was 14.0 MB. Max. memory is 11.5 GB. [2018-11-23 00:05:12,214 INFO L168 Benchmark]: RCFGBuilder took 366.87 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 27.3 MB). Peak memory consumption was 27.3 MB. Max. memory is 11.5 GB. [2018-11-23 00:05:12,214 INFO L168 Benchmark]: TraceAbstraction took 276.02 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: 26.1 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. [2018-11-23 00:05:12,215 INFO L168 Benchmark]: Witness Printer took 5.23 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. [2018-11-23 00:05:12,217 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 186.44 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 945.7 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 19.81 ms. Allocated memory is still 1.0 GB. Free memory was 945.7 MB in the beginning and 943.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 78.26 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 162.5 MB). Free memory was 943.0 MB in the beginning and 1.2 GB in the end (delta: -208.3 MB). Peak memory consumption was 14.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 366.87 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 27.3 MB). Peak memory consumption was 27.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 276.02 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: 26.1 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. * Witness Printer took 5.23 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. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #res : ~ieee754_float~0 not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for Procedure implementation returnsStructure(#in~index : int) returns (#res : ~ieee754_float~0); and expression #res.ieee.negative - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #res : ~ieee754_float~0 not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for Procedure implementation returnsStructure(#in~index : int) returns (#res : ~ieee754_float~0); and expression #res.ieee.mantissa - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #res : ~ieee754_float~0 not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for Procedure implementation returnsStructure(#in~index : int) returns (#res : ~ieee754_float~0); and expression #res.ieee.exponent - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #res : ~ieee754_float~0 not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for Procedure implementation returnsStructure(#in~index : int) returns (#res : ~ieee754_float~0); and expression #res.ieee.negative - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #res : ~ieee754_float~0 not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for Procedure implementation returnsStructure(#in~index : int) returns (#res : ~ieee754_float~0); and expression #res.ieee.mantissa - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #res : ~ieee754_float~0 not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for Procedure implementation returnsStructure(#in~index : int) returns (#res : ~ieee754_float~0); and expression #res.ieee.exponent - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #t~ret5 : ~ieee754_float~0 not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #t~ret5 : ~ieee754_float~0 not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #t~ret5 : ~ieee754_float~0 not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #res : ~ieee754_float~0 not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for Procedure implementation returnsStructure(#in~index : int) returns (#res : ~ieee754_float~0); and expression #res.ieee.negative - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #res : ~ieee754_float~0 not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for Procedure implementation returnsStructure(#in~index : int) returns (#res : ~ieee754_float~0); and expression #res.ieee.mantissa - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #res : ~ieee754_float~0 not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for Procedure implementation returnsStructure(#in~index : int) returns (#res : ~ieee754_float~0); and expression #res.ieee.exponent - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #res : ~ieee754_float~0 not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for Procedure implementation returnsStructure(#in~index : int) returns (#res : ~ieee754_float~0); and expression #res.ieee.negative - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #res : ~ieee754_float~0 not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for Procedure implementation returnsStructure(#in~index : int) returns (#res : ~ieee754_float~0); and expression #res.ieee.mantissa - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #res : ~ieee754_float~0 not handled - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for Procedure implementation returnsStructure(#in~index : int) returns (#res : ~ieee754_float~0); and expression #res.ieee.exponent - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #t~ret6 : ~ieee754_float~0 not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #t~ret6 : ~ieee754_float~0 not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #t~ret6 : ~ieee754_float~0 not handled * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #res.ieee.negative - GenericResult: Unfinished Backtranslation unknown boogie variable #res.ieee.mantissa - GenericResult: Unfinished Backtranslation unknown boogie variable #res!f - GenericResult: Unfinished Backtranslation unknown boogie variable #res.ieee.exponent - GenericResult: Unfinished Backtranslation unknown boogie variable #res.ieee.negative - GenericResult: Unfinished Backtranslation unknown boogie variable #res.ieee.mantissa - GenericResult: Unfinished Backtranslation unknown boogie variable #res.ieee.exponent - GenericResult: Unfinished Backtranslation unknown boogie variable #res!f * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 133]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseAnd at line 119. Possible FailurePath: [L168] CALL testOne() [L128] ieee754_float f1, f2; VAL [f1={21:0}, f2={27:0}] [L130] CALL, EXPR returnsStructure(0) VAL [\old(index)=0] [L117] ieee754_float c; [L119] c.ieee.negative = index & 0x1 [L120] c.ieee.exponent = 0 [L121] c.ieee.mantissa = 0 [L123] return c; [L123] return c; VAL [\old(index)=0, index=0, unknown-#res!f-unknown=25, unknown-#res.ieee.exponent-unknown=0, unknown-#res.ieee.mantissa-unknown=0, unknown-#res.ieee.negative-unknown=0] [L130] RET, EXPR returnsStructure(0) VAL [f1={21:0}, f2={27:0}, returnsStructure(0)=0returnsStructure(0)=0returnsStructure(0)=0returnsStructure(0)=25] [L130] f1 = returnsStructure(0) [L131] CALL, EXPR returnsStructure(1) VAL [\old(index)=1] [L117] ieee754_float c; [L119] c.ieee.negative = index & 0x1 [L120] c.ieee.exponent = 0 [L121] c.ieee.mantissa = 0 [L123] return c; [L123] return c; VAL [\old(index)=1, index=1, unknown-#res!f-unknown=19, unknown-#res.ieee.exponent-unknown=0, unknown-#res.ieee.mantissa-unknown=0, unknown-#res.ieee.negative-unknown=0] [L131] RET, EXPR returnsStructure(1) VAL [f1={21:0}, f2={27:0}, returnsStructure(1)=0returnsStructure(1)=0returnsStructure(1)=19returnsStructure(1)=0] [L131] f2 = returnsStructure(1) [L133] EXPR f1.ieee.negative [L133] EXPR f2.ieee.negative VAL [f1={21:0}, f1.ieee.negative=0, f2={27:0}, f2.ieee.negative=0] [L133] COND TRUE !(f1.ieee.negative != f2.ieee.negative) [L133] __VERIFIER_error() VAL [f1={21:0}, f2={27:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 59 locations, 4 error locations. UNSAFE Result, 0.2s OverallTime, 1 OverallIterations, 2 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=59occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 19 NumberOfCodeBlocks, 19 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-aa41828 [2018-11-23 00:05:13,775 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 00:05:13,776 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 00:05:13,785 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 00:05:13,785 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 00:05:13,786 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 00:05:13,787 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 00:05:13,788 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 00:05:13,790 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 00:05:13,791 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 00:05:13,791 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 00:05:13,792 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 00:05:13,792 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 00:05:13,793 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 00:05:13,795 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 00:05:13,795 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 00:05:13,796 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 00:05:13,797 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 00:05:13,799 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 00:05:13,800 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 00:05:13,801 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 00:05:13,802 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 00:05:13,804 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 00:05:13,804 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 00:05:13,804 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 00:05:13,805 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 00:05:13,806 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 00:05:13,807 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 00:05:13,808 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 00:05:13,809 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 00:05:13,809 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 00:05:13,810 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 00:05:13,810 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 00:05:13,810 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 00:05:13,811 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 00:05:13,812 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 00:05:13,812 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_6a2ef302-4608-4ca4-a4dc-4a13342c03d1/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-23 00:05:13,823 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 00:05:13,824 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 00:05:13,824 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 00:05:13,825 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 00:05:13,825 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 00:05:13,825 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 00:05:13,825 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 00:05:13,826 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 00:05:13,826 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 00:05:13,826 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 00:05:13,826 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 00:05:13,826 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 00:05:13,827 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 00:05:13,827 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 00:05:13,827 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 00:05:13,827 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 00:05:13,827 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 00:05:13,827 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 00:05:13,827 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 00:05:13,827 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 00:05:13,827 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 00:05:13,828 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 00:05:13,828 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 00:05:13,828 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 00:05:13,828 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 00:05:13,828 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 00:05:13,828 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 00:05:13,828 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 00:05:13,828 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 00:05:13,828 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 00:05:13,828 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 00:05:13,829 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 00:05:13,829 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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_6a2ef302-4608-4ca4-a4dc-4a13342c03d1/bin-2019/uautomizer 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 -> Automizer 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 -> 08947af3b6f9b8a272faa540a059213a9b1de888 [2018-11-23 00:05:13,859 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 00:05:13,868 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 00:05:13,870 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 00:05:13,871 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 00:05:13,871 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 00:05:13,872 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_6a2ef302-4608-4ca4-a4dc-4a13342c03d1/bin-2019/uautomizer/../../sv-benchmarks/c/floats-cbmc-regression/float22_true-unreach-call_true-termination.i [2018-11-23 00:05:13,911 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6a2ef302-4608-4ca4-a4dc-4a13342c03d1/bin-2019/uautomizer/data/a9143766f/e31900ca34044676a82b9dd78ce7183a/FLAGf5a1efaa2 [2018-11-23 00:05:14,237 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 00:05:14,237 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_6a2ef302-4608-4ca4-a4dc-4a13342c03d1/sv-benchmarks/c/floats-cbmc-regression/float22_true-unreach-call_true-termination.i [2018-11-23 00:05:14,241 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6a2ef302-4608-4ca4-a4dc-4a13342c03d1/bin-2019/uautomizer/data/a9143766f/e31900ca34044676a82b9dd78ce7183a/FLAGf5a1efaa2 [2018-11-23 00:05:14,676 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_6a2ef302-4608-4ca4-a4dc-4a13342c03d1/bin-2019/uautomizer/data/a9143766f/e31900ca34044676a82b9dd78ce7183a [2018-11-23 00:05:14,679 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 00:05:14,680 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 00:05:14,680 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 00:05:14,680 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 00:05:14,683 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 00:05:14,684 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:05:14" (1/1) ... [2018-11-23 00:05:14,686 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23319cc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:05:14, skipping insertion in model container [2018-11-23 00:05:14,686 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:05:14" (1/1) ... [2018-11-23 00:05:14,694 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 00:05:14,717 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 00:05:14,864 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 00:05:14,868 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 00:05:14,896 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 00:05:14,915 INFO L195 MainTranslator]: Completed translation [2018-11-23 00:05:14,915 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:05:14 WrapperNode [2018-11-23 00:05:14,915 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 00:05:14,916 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 00:05:14,916 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 00:05:14,916 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 00:05:14,922 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:05:14" (1/1) ... [2018-11-23 00:05:14,932 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:05:14" (1/1) ... [2018-11-23 00:05:14,940 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 00:05:14,940 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 00:05:14,941 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 00:05:14,941 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 00:05:14,949 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:05:14" (1/1) ... [2018-11-23 00:05:14,949 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:05:14" (1/1) ... [2018-11-23 00:05:14,952 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:05:14" (1/1) ... [2018-11-23 00:05:14,952 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:05:14" (1/1) ... [2018-11-23 00:05:14,965 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:05:14" (1/1) ... [2018-11-23 00:05:14,967 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:05:14" (1/1) ... [2018-11-23 00:05:14,969 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:05:14" (1/1) ... [2018-11-23 00:05:14,971 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 00:05:14,971 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 00:05:14,971 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 00:05:14,971 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 00:05:14,972 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:05:14" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6a2ef302-4608-4ca4-a4dc-4a13342c03d1/bin-2019/uautomizer/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 [2018-11-23 00:05:15,052 INFO L130 BoogieDeclarations]: Found specification of procedure testOne [2018-11-23 00:05:15,052 INFO L138 BoogieDeclarations]: Found implementation of procedure testOne [2018-11-23 00:05:15,052 INFO L130 BoogieDeclarations]: Found specification of procedure testThree [2018-11-23 00:05:15,053 INFO L138 BoogieDeclarations]: Found implementation of procedure testThree [2018-11-23 00:05:15,053 INFO L130 BoogieDeclarations]: Found specification of procedure returnsStructure [2018-11-23 00:05:15,053 INFO L138 BoogieDeclarations]: Found implementation of procedure returnsStructure [2018-11-23 00:05:15,053 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 00:05:15,053 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 00:05:15,053 INFO L130 BoogieDeclarations]: Found specification of procedure testTwo [2018-11-23 00:05:15,053 INFO L138 BoogieDeclarations]: Found implementation of procedure testTwo [2018-11-23 00:05:15,053 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2018-11-23 00:05:15,053 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 00:05:15,053 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 00:05:15,053 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 00:05:15,053 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 00:05:15,054 INFO L130 BoogieDeclarations]: Found specification of procedure returnsField [2018-11-23 00:05:15,054 INFO L138 BoogieDeclarations]: Found implementation of procedure returnsField [2018-11-23 00:05:15,054 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 00:05:15,054 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 00:05:15,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2018-11-23 00:05:15,054 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 00:05:15,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 00:05:15,183 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 00:05:15,192 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 00:05:15,207 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 00:05:15,213 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 00:05:15,253 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 00:05:15,261 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 00:05:15,267 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 00:05:15,271 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 00:05:15,297 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 00:05:15,297 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-23 00:05:15,298 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:05:15 BoogieIcfgContainer [2018-11-23 00:05:15,298 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 00:05:15,298 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 00:05:15,298 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 00:05:15,300 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 00:05:15,300 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:05:14" (1/3) ... [2018-11-23 00:05:15,300 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75a80204 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:05:15, skipping insertion in model container [2018-11-23 00:05:15,300 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:05:14" (2/3) ... [2018-11-23 00:05:15,301 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75a80204 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:05:15, skipping insertion in model container [2018-11-23 00:05:15,301 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:05:15" (3/3) ... [2018-11-23 00:05:15,302 INFO L112 eAbstractionObserver]: Analyzing ICFG float22_true-unreach-call_true-termination.i [2018-11-23 00:05:15,307 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 00:05:15,313 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-11-23 00:05:15,322 INFO L257 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2018-11-23 00:05:15,344 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 00:05:15,344 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 00:05:15,344 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 00:05:15,344 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 00:05:15,345 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 00:05:15,345 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 00:05:15,345 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 00:05:15,345 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 00:05:15,345 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 00:05:15,355 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states. [2018-11-23 00:05:15,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 00:05:15,359 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:05:15,359 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:05:15,361 INFO L423 AbstractCegarLoop]: === Iteration 1 === [testOneErr0ASSERT_VIOLATIONERROR_FUNCTION, testThreeErr0ASSERT_VIOLATIONERROR_FUNCTION, testTwoErr0ASSERT_VIOLATIONERROR_FUNCTION, testTwoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:05:15,364 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:05:15,364 INFO L82 PathProgramCache]: Analyzing trace with hash 355812978, now seen corresponding path program 1 times [2018-11-23 00:05:15,367 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 00:05:15,367 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6a2ef302-4608-4ca4-a4dc-4a13342c03d1/bin-2019/uautomizer/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2018-11-23 00:05:15,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:05:15,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:05:15,481 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:05:15,549 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:05:15,553 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 27 [2018-11-23 00:05:15,560 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-11-23 00:05:15,561 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 00:05:15,579 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:05:15,592 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:05:15,592 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:18, output treesize:15 [2018-11-23 00:05:15,627 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 19 treesize of output 16 [2018-11-23 00:05:15,631 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 16 treesize of output 19 [2018-11-23 00:05:15,638 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2018-11-23 00:05:15,646 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2018-11-23 00:05:15,647 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 00:05:15,670 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:05:15,690 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:05:15,711 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:05:15,736 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 00:05:15,737 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:52, output treesize:56 [2018-11-23 00:05:15,790 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:05:15,792 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:05:15,793 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:05:15,794 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 36 [2018-11-23 00:05:15,795 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 00:05:15,825 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 00:05:15,826 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:70, output treesize:65 [2018-11-23 00:05:15,868 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:05:15,895 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 74 [2018-11-23 00:05:15,906 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 21 treesize of output 24 [2018-11-23 00:05:15,918 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:05:15,922 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2018-11-23 00:05:15,935 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:05:15,937 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:05:15,939 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:05:15,949 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 48 [2018-11-23 00:05:15,969 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:05:15,972 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:05:15,974 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:05:15,995 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 46 [2018-11-23 00:05:15,995 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 00:05:16,028 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:05:16,050 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:05:16,072 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:05:16,109 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:05:16,151 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 00:05:16,152 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:95, output treesize:83 [2018-11-23 00:05:22,370 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:05:22,374 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:05:22,380 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 00:05:22,381 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 21 [2018-11-23 00:05:22,382 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 00:05:22,522 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:05:22,601 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 78 treesize of output 101 [2018-11-23 00:05:22,628 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 102 treesize of output 101 [2018-11-23 00:05:22,645 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:05:22,647 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 34 [2018-11-23 00:05:22,660 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 38 [2018-11-23 00:05:22,661 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 00:05:22,681 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:05:22,714 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:05:22,844 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:05:22,845 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 60 [2018-11-23 00:05:22,853 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24 [2018-11-23 00:05:22,864 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:05:22,865 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 34 [2018-11-23 00:05:22,866 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 00:05:22,881 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:05:22,900 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:05:22,946 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 00:05:23,032 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-11-23 00:05:23,033 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:126, output treesize:203 [2018-11-23 00:05:24,108 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 66 [2018-11-23 00:05:24,116 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:05:24,118 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 12 [2018-11-23 00:05:24,119 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 00:05:24,136 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2018-11-23 00:05:24,136 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 00:05:24,144 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:05:24,156 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:05:24,157 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 9 variables, input treesize:113, output treesize:25 [2018-11-23 00:05:24,198 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:05:24,198 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 00:05:27,239 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 00:05:27,239 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6a2ef302-4608-4ca4-a4dc-4a13342c03d1/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 00:05:27,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:05:27,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:05:27,276 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:05:27,303 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:05:27,303 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 27 [2018-11-23 00:05:27,307 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-11-23 00:05:27,307 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 00:05:27,313 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:05:27,320 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:05:27,321 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:18 [2018-11-23 00:05:27,378 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 19 treesize of output 16 [2018-11-23 00:05:27,383 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 16 treesize of output 19 [2018-11-23 00:05:27,389 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2018-11-23 00:05:27,396 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2018-11-23 00:05:27,397 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 00:05:27,407 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:05:27,416 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:05:27,425 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:05:27,443 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 00:05:27,443 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:52, output treesize:56 [2018-11-23 00:05:27,482 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:05:27,484 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:05:27,485 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:05:27,487 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 34 [2018-11-23 00:05:27,487 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 00:05:27,516 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 00:05:27,516 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:71, output treesize:66 [2018-11-23 00:05:27,625 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:05:27,644 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 74 [2018-11-23 00:05:27,656 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 21 treesize of output 24 [2018-11-23 00:05:27,670 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:05:27,675 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2018-11-23 00:05:27,690 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:05:27,692 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:05:27,695 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:05:27,708 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 48 [2018-11-23 00:05:27,721 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:05:27,723 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:05:27,725 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:05:27,742 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 46 [2018-11-23 00:05:27,743 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 00:05:27,777 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:05:27,803 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:05:27,825 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:05:27,867 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:05:27,931 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 00:05:27,931 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:98, output treesize:86 [2018-11-23 00:05:34,973 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:05:34,977 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:05:34,982 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 00:05:34,984 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 21 [2018-11-23 00:05:34,984 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 00:05:35,158 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:05:35,191 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 78 treesize of output 101 [2018-11-23 00:05:35,201 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 102 treesize of output 101 [2018-11-23 00:05:35,213 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:05:35,215 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 34 [2018-11-23 00:05:35,231 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 38 [2018-11-23 00:05:35,231 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 00:05:35,260 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:05:35,294 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:05:35,452 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:05:35,453 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 60 [2018-11-23 00:05:35,461 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24 [2018-11-23 00:05:35,468 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:05:35,470 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 34 [2018-11-23 00:05:35,470 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 00:05:35,493 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:05:35,517 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:05:35,560 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 00:05:35,664 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-11-23 00:05:35,664 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:129, output treesize:209 [2018-11-23 00:05:36,007 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 64 [2018-11-23 00:05:36,026 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2018-11-23 00:05:36,026 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 00:05:36,050 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:05:36,051 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 12 [2018-11-23 00:05:36,051 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 00:05:36,059 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:05:36,075 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:05:36,075 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 8 variables, input treesize:109, output treesize:25 [2018-11-23 00:05:36,079 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:05:36,079 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 00:05:43,367 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 00:05:43,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 15 [2018-11-23 00:05:43,370 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 00:05:43,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 00:05:43,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=316, Unknown=5, NotChecked=0, Total=380 [2018-11-23 00:05:43,385 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 15 states. [2018-11-23 00:05:47,725 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((|v_returnsStructure_~#c~1.base_5| (_ BitVec 32))) (and (= (select |c_old(#valid)| |v_returnsStructure_~#c~1.base_5|) (_ bv0 1)) (= |c_returnsStructure_#res.f| (let ((.cse0 (select (select |c_#memory_int| |v_returnsStructure_~#c~1.base_5|) (_ bv0 32)))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0)))) (= (store |c_old(#memory_int)| |v_returnsStructure_~#c~1.base_5| (store (store (store (select |c_old(#memory_int)| |v_returnsStructure_~#c~1.base_5|) (_ bv0 32) (bvand (_ bv1 32) |c_returnsStructure_#in~index|)) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |c_#memory_int|))) (exists ((|v_returnsStructure_~#c~1.base_4| (_ BitVec 32))) (let ((.cse1 (select |c_#memory_int| |v_returnsStructure_~#c~1.base_4|))) (let ((.cse2 (select .cse1 (_ bv0 32)))) (and (= |c_#valid| (store |c_old(#valid)| |v_returnsStructure_~#c~1.base_4| (_ bv0 1))) (= (_ bv0 32) (select .cse1 (_ bv8 32))) (= |c_returnsStructure_#res.f| (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))) (= (bvand (_ bv1 32) |c_returnsStructure_#in~index|) .cse2) (= (_ bv0 32) (select .cse1 (_ bv4 32))) (= (_ bv0 1) (select |c_old(#valid)| |v_returnsStructure_~#c~1.base_4|))))))) is different from true [2018-11-23 00:05:55,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:05:55,197 INFO L93 Difference]: Finished difference Result 104 states and 121 transitions. [2018-11-23 00:05:55,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 00:05:55,198 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 19 [2018-11-23 00:05:55,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:05:55,206 INFO L225 Difference]: With dead ends: 104 [2018-11-23 00:05:55,206 INFO L226 Difference]: Without dead ends: 49 [2018-11-23 00:05:55,208 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 26.6s TimeCoverageRelationStatistics Valid=61, Invalid=317, Unknown=6, NotChecked=36, Total=420 [2018-11-23 00:05:55,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-23 00:05:55,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-11-23 00:05:55,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-23 00:05:55,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2018-11-23 00:05:55,234 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 19 [2018-11-23 00:05:55,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:05:55,235 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2018-11-23 00:05:55,235 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 00:05:55,236 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2018-11-23 00:05:55,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-23 00:05:55,237 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:05:55,237 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:05:55,237 INFO L423 AbstractCegarLoop]: === Iteration 2 === [testOneErr0ASSERT_VIOLATIONERROR_FUNCTION, testThreeErr0ASSERT_VIOLATIONERROR_FUNCTION, testTwoErr0ASSERT_VIOLATIONERROR_FUNCTION, testTwoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:05:55,237 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:05:55,237 INFO L82 PathProgramCache]: Analyzing trace with hash -787169268, now seen corresponding path program 1 times [2018-11-23 00:05:55,238 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 00:05:55,238 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6a2ef302-4608-4ca4-a4dc-4a13342c03d1/bin-2019/uautomizer/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2018-11-23 00:05:55,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:05:55,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:05:55,407 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:05:55,415 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 54 treesize of output 48 [2018-11-23 00:05:55,417 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 48 treesize of output 41 [2018-11-23 00:05:55,420 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2018-11-23 00:05:55,432 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 15 [2018-11-23 00:05:55,432 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 00:05:55,434 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:05:55,435 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:05:55,437 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:05:55,438 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:05:55,438 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:54, output treesize:15 [2018-11-23 00:05:55,457 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:05:55,458 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 27 [2018-11-23 00:05:55,460 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-11-23 00:05:55,461 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 00:05:55,464 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:05:55,468 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:05:55,468 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:18, output treesize:15 [2018-11-23 00:05:55,499 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 19 treesize of output 16 [2018-11-23 00:05:55,503 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 16 treesize of output 19 [2018-11-23 00:05:55,508 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2018-11-23 00:05:55,515 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2018-11-23 00:05:55,515 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 00:05:55,524 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:05:55,533 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:05:55,542 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:05:55,559 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 00:05:55,559 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:52, output treesize:56 [2018-11-23 00:05:57,598 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:05:57,599 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:05:57,600 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:05:57,601 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 36 [2018-11-23 00:05:57,601 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 00:05:57,622 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 00:05:57,623 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:70, output treesize:64 [2018-11-23 00:05:57,659 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:05:57,677 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 74 [2018-11-23 00:05:57,687 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 21 treesize of output 24 [2018-11-23 00:05:57,699 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:05:57,703 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2018-11-23 00:05:57,714 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:05:57,715 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:05:57,717 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:05:57,725 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 48 [2018-11-23 00:05:57,735 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:05:57,737 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:05:57,739 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:05:57,754 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 46 [2018-11-23 00:05:57,754 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 00:05:57,781 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:05:57,802 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:05:57,821 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:05:57,857 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:05:57,910 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 00:05:57,910 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:92, output treesize:80 [2018-11-23 00:06:02,262 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:06:02,267 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:06:02,270 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:06:02,273 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:06:02,276 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:06:02,277 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2018-11-23 00:06:02,277 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 00:06:02,405 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:06:02,468 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 78 treesize of output 101 [2018-11-23 00:06:02,480 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 102 treesize of output 101 [2018-11-23 00:06:02,491 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:06:02,492 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 34 [2018-11-23 00:06:02,502 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 38 [2018-11-23 00:06:02,502 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 00:06:02,518 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:06:02,566 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:06:02,740 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:06:02,741 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 60 [2018-11-23 00:06:02,749 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24 [2018-11-23 00:06:02,755 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:06:02,756 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 34 [2018-11-23 00:06:02,757 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 00:06:02,771 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:06:02,793 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:06:02,848 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 00:06:02,958 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-11-23 00:06:02,959 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:123, output treesize:205 [2018-11-23 00:06:03,170 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 64 [2018-11-23 00:06:03,176 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:06:03,177 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 12 [2018-11-23 00:06:03,177 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 00:06:03,200 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2018-11-23 00:06:03,200 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 00:06:03,208 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:06:03,224 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:06:03,224 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 9 variables, input treesize:115, output treesize:25 [2018-11-23 00:06:03,272 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 00:06:03,272 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 00:06:08,137 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 00:06:08,137 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6a2ef302-4608-4ca4-a4dc-4a13342c03d1/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 00:06:08,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:06:08,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:06:08,184 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:06:08,194 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:06:08,195 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 27 [2018-11-23 00:06:08,198 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-11-23 00:06:08,198 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 00:06:08,217 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:06:08,223 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:06:08,223 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:18, output treesize:15 [2018-11-23 00:06:08,237 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 19 treesize of output 16 [2018-11-23 00:06:08,240 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 16 treesize of output 19 [2018-11-23 00:06:08,246 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2018-11-23 00:06:08,253 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2018-11-23 00:06:08,254 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 00:06:08,266 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:06:08,277 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:06:08,289 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:06:08,309 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 00:06:08,309 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:52, output treesize:56 [2018-11-23 00:06:10,356 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:06:10,358 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:06:10,359 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:06:10,360 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 36 [2018-11-23 00:06:10,361 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 00:06:10,388 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 00:06:10,388 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:70, output treesize:64 [2018-11-23 00:06:10,402 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:06:10,427 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 74 [2018-11-23 00:06:10,438 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 21 treesize of output 24 [2018-11-23 00:06:10,450 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:06:10,455 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2018-11-23 00:06:10,469 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:06:10,472 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:06:10,475 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:06:10,489 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 48 [2018-11-23 00:06:10,503 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:06:10,505 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:06:10,507 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:06:10,531 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 46 [2018-11-23 00:06:10,531 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 00:06:10,562 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:06:10,587 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:06:10,610 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:06:10,654 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:06:10,712 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 00:06:10,712 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:92, output treesize:80 [2018-11-23 00:06:12,730 WARN L854 $PredicateComparison]: unable to prove that (exists ((|v_returnsStructure_~#c~1.base_32| (_ BitVec 32))) (and (= (store |c_old(#memory_int)| |v_returnsStructure_~#c~1.base_32| (store (store (store (select |c_old(#memory_int)| |v_returnsStructure_~#c~1.base_32|) (_ bv0 32) (bvand (_ bv1 32) |c_returnsStructure_#in~index|)) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |c_#memory_int|) (= (select |c_old(#valid)| |v_returnsStructure_~#c~1.base_32|) (_ bv0 1)) (= |c_returnsStructure_#res.f| (let ((.cse0 (select (select |c_#memory_int| |v_returnsStructure_~#c~1.base_32|) (_ bv0 32)))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0)))))) is different from true [2018-11-23 00:06:12,749 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:06:12,752 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:06:12,756 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:06:12,759 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:06:12,763 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:06:12,764 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2018-11-23 00:06:12,765 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 00:06:12,892 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:06:12,968 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 78 treesize of output 101 [2018-11-23 00:06:12,987 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 102 treesize of output 101 [2018-11-23 00:06:13,009 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:06:13,011 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 34 [2018-11-23 00:06:13,020 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 38 [2018-11-23 00:06:13,020 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 00:06:13,045 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:06:13,089 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:06:13,264 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:06:13,266 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 60 [2018-11-23 00:06:13,274 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24 [2018-11-23 00:06:13,287 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:06:13,289 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 34 [2018-11-23 00:06:13,289 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 00:06:13,321 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:06:13,350 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:06:13,426 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 00:06:13,558 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-11-23 00:06:13,558 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:125, output treesize:205 [2018-11-23 00:06:13,710 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 64 [2018-11-23 00:06:13,716 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:06:13,717 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 12 [2018-11-23 00:06:13,717 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 00:06:13,736 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2018-11-23 00:06:13,736 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 00:06:13,746 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:06:13,761 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:06:13,761 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 9 variables, input treesize:115, output treesize:25 [2018-11-23 00:06:13,765 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 2 not checked. [2018-11-23 00:06:13,765 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 00:06:22,358 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 00:06:22,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 14 [2018-11-23 00:06:22,359 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 00:06:22,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 00:06:22,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=224, Unknown=9, NotChecked=30, Total=306 [2018-11-23 00:06:22,359 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand 14 states. [2018-11-23 00:06:32,123 WARN L180 SmtUtils]: Spent 8.17 s on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2018-11-23 00:06:34,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:06:34,829 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2018-11-23 00:06:34,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 00:06:34,830 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 35 [2018-11-23 00:06:34,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:06:34,831 INFO L225 Difference]: With dead ends: 49 [2018-11-23 00:06:34,831 INFO L226 Difference]: Without dead ends: 47 [2018-11-23 00:06:34,832 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 57 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 33.5s TimeCoverageRelationStatistics Valid=61, Invalid=314, Unknown=9, NotChecked=36, Total=420 [2018-11-23 00:06:34,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-11-23 00:06:34,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-11-23 00:06:34,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-23 00:06:34,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2018-11-23 00:06:34,839 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 35 [2018-11-23 00:06:34,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:06:34,839 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2018-11-23 00:06:34,839 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 00:06:34,839 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2018-11-23 00:06:34,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-23 00:06:34,840 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:06:34,840 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:06:34,840 INFO L423 AbstractCegarLoop]: === Iteration 3 === [testOneErr0ASSERT_VIOLATIONERROR_FUNCTION, testThreeErr0ASSERT_VIOLATIONERROR_FUNCTION, testTwoErr0ASSERT_VIOLATIONERROR_FUNCTION, testTwoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:06:34,840 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:06:34,840 INFO L82 PathProgramCache]: Analyzing trace with hash -2050564504, now seen corresponding path program 1 times [2018-11-23 00:06:34,841 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 00:06:34,841 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6a2ef302-4608-4ca4-a4dc-4a13342c03d1/bin-2019/uautomizer/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2018-11-23 00:06:34,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:06:35,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:06:35,154 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:06:35,160 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 9 treesize of output 12 [2018-11-23 00:06:35,166 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-23 00:06:35,166 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 00:06:35,174 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:06:35,182 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:06:35,182 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:16, output treesize:17 [2018-11-23 00:06:36,097 WARN L854 $PredicateComparison]: unable to prove that (exists ((|v_returnsStructure_~#c~1.base_40| (_ BitVec 32))) (and (= |c_#valid| (store |c_old(#valid)| |v_returnsStructure_~#c~1.base_40| (_ bv0 1))) (= (_ bv0 1) (select |c_old(#valid)| |v_returnsStructure_~#c~1.base_40|)))) is different from true [2018-11-23 00:06:36,103 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:06:36,104 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:06:36,108 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:06:36,109 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2018-11-23 00:06:36,109 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 00:06:36,123 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 00:06:36,123 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:23 [2018-11-23 00:06:38,145 WARN L854 $PredicateComparison]: unable to prove that (exists ((|v_returnsStructure_~#c~1.base_41| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |v_returnsStructure_~#c~1.base_41|)) (= (store |c_old(#valid)| |v_returnsStructure_~#c~1.base_41| (_ bv0 1)) |c_#valid|))) is different from true [2018-11-23 00:06:38,153 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:06:38,155 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:06:38,159 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:06:38,159 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 00:06:38,160 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 51 [2018-11-23 00:06:38,160 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 00:06:38,182 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 00:06:38,182 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:30 [2018-11-23 00:06:38,208 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 15 treesize of output 19 [2018-11-23 00:06:38,212 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2018-11-23 00:06:38,212 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 00:06:38,231 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-11-23 00:06:38,232 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 00:06:38,247 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2018-11-23 00:06:38,247 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 00:06:38,254 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 00:06:38,272 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-23 00:06:38,272 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:37, output treesize:54 [2018-11-23 00:06:38,364 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 19 treesize of output 16 [2018-11-23 00:06:38,368 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 16 treesize of output 19 [2018-11-23 00:06:38,374 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2018-11-23 00:06:38,381 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2018-11-23 00:06:38,381 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 00:06:38,391 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:06:38,402 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:06:38,411 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:06:38,430 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 00:06:38,430 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:52, output treesize:56 [2018-11-23 00:06:38,504 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:06:38,506 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:06:38,513 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:06:38,513 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 00:06:38,514 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 55 [2018-11-23 00:06:38,515 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 00:06:38,566 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 00:06:38,566 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:80, output treesize:76 [2018-11-23 00:06:38,645 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:06:38,655 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 61 [2018-11-23 00:06:38,665 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 00:06:38,665 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 00:06:38,686 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:06:38,719 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 00:06:38,719 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:88, output treesize:89 [2018-11-23 00:06:42,826 WARN L854 $PredicateComparison]: unable to prove that (exists ((|v_returnsField_~#c~0.base_5| (_ BitVec 32))) (and (= (store |c_old(#memory_int)| |v_returnsField_~#c~0.base_5| (store (store (store (select |c_old(#memory_int)| |v_returnsField_~#c~0.base_5|) (_ bv0 32) (bvand (_ bv1 32) |c_returnsField_#in~index|)) (_ bv4 32) (_ bv0 32)) (_ bv8 32) (_ bv0 32))) |c_#memory_int|) (= |c_returnsField_#res| (let ((.cse0 (select (select |c_#memory_int| |v_returnsField_~#c~0.base_5|) (_ bv0 32)))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0)))) (= (_ bv0 1) (select |c_old(#valid)| |v_returnsField_~#c~0.base_5|)))) is different from true [2018-11-23 00:06:42,842 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 28 [2018-11-23 00:06:42,843 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 00:06:43,009 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:06:43,014 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:06:43,061 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 78 treesize of output 116 [2018-11-23 00:06:43,075 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 117 treesize of output 113 [2018-11-23 00:06:43,088 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:06:43,089 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 43 [2018-11-23 00:06:43,101 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 46 [2018-11-23 00:06:43,101 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 00:06:43,128 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:06:43,162 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:06:43,330 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:06:43,331 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 60 [2018-11-23 00:06:43,341 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24 [2018-11-23 00:06:43,348 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:06:43,349 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 34 [2018-11-23 00:06:43,350 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 00:06:43,364 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:06:43,385 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:06:43,444 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 00:06:43,546 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-11-23 00:06:43,547 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:132, output treesize:213 [2018-11-23 00:06:43,777 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:06:43,778 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:06:43,779 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 70 [2018-11-23 00:06:43,794 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 27 [2018-11-23 00:06:43,795 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-23 00:06:43,831 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:06:43,832 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 12 [2018-11-23 00:06:43,832 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 00:06:43,848 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:06:43,865 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:06:43,865 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:102, output treesize:25 [2018-11-23 00:06:43,910 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 4 not checked. [2018-11-23 00:06:43,910 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 00:06:44,458 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 00:06:44,458 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6a2ef302-4608-4ca4-a4dc-4a13342c03d1/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 00:06:44,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:06:44,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:06:44,539 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:06:44,557 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:06:44,557 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 27 [2018-11-23 00:06:44,560 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-11-23 00:06:44,560 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 00:06:44,564 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:06:44,570 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:06:44,570 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:18, output treesize:15 [2018-11-23 00:06:45,037 WARN L854 $PredicateComparison]: unable to prove that (exists ((|v_returnsStructure_~#c~1.base_44| (_ BitVec 32))) (and (= |c_#valid| (store |c_old(#valid)| |v_returnsStructure_~#c~1.base_44| (_ bv0 1))) (= (_ bv0 1) (select |c_old(#valid)| |v_returnsStructure_~#c~1.base_44|)))) is different from true [2018-11-23 00:06:45,042 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:06:45,043 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:06:45,044 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:06:45,045 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 34 [2018-11-23 00:06:45,045 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 00:06:45,055 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 00:06:45,055 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:20 [2018-11-23 00:06:46,171 WARN L854 $PredicateComparison]: unable to prove that (exists ((|v_returnsStructure_~#c~1.base_45| (_ BitVec 32))) (and (= |c_#valid| (store |c_old(#valid)| |v_returnsStructure_~#c~1.base_45| (_ bv0 1))) (= (select |c_old(#valid)| |v_returnsStructure_~#c~1.base_45|) (_ bv0 1)))) is different from true [2018-11-23 00:06:46,179 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:06:46,180 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:06:46,182 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:06:46,183 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:06:46,188 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:06:46,188 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 47 [2018-11-23 00:06:46,189 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 00:06:46,208 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 00:06:46,208 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:25 [2018-11-23 00:06:46,268 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 19 treesize of output 16 [2018-11-23 00:06:46,271 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 16 treesize of output 19 [2018-11-23 00:06:46,281 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2018-11-23 00:06:46,295 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2018-11-23 00:06:46,295 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 00:06:46,307 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:06:46,328 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:06:46,342 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:06:46,376 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 00:06:46,377 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:52, output treesize:56 [2018-11-23 00:06:46,430 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:06:46,434 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:06:46,442 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:06:46,446 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:06:46,448 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:06:46,449 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2018-11-23 00:06:46,450 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 00:06:46,503 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 00:06:46,504 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:77, output treesize:70 [2018-11-23 00:06:46,595 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:06:46,606 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 61 [2018-11-23 00:06:46,616 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 00:06:46,616 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 00:06:46,643 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:06:46,670 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 00:06:46,670 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:80, output treesize:81 [2018-11-23 00:06:50,365 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:06:50,368 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:06:50,372 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:06:50,373 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 00:06:50,374 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 21 [2018-11-23 00:06:50,374 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 00:06:50,525 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:06:50,606 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 78 treesize of output 101 [2018-11-23 00:06:50,619 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:06:50,624 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:06:50,625 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 00:06:50,629 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:06:50,631 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 94 [2018-11-23 00:06:50,638 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 33 [2018-11-23 00:06:50,680 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:06:50,681 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 34 [2018-11-23 00:06:50,682 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 00:06:50,698 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:06:50,734 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:06:50,964 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 75 treesize of output 77 [2018-11-23 00:06:50,980 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:06:50,981 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 25 [2018-11-23 00:06:50,991 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2018-11-23 00:06:50,991 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 00:06:51,012 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:06:51,041 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:06:51,153 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 00:06:51,259 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-11-23 00:06:51,260 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:126, output treesize:205 [2018-11-23 00:06:53,095 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 46 [2018-11-23 00:06:53,105 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 64 [2018-11-23 00:06:53,109 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2018-11-23 00:06:53,110 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 00:06:53,142 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:06:53,143 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 12 [2018-11-23 00:06:53,143 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 00:06:53,152 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:06:53,176 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:06:53,176 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:102, output treesize:25 [2018-11-23 00:06:53,184 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 2 not checked. [2018-11-23 00:06:53,184 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 00:06:58,220 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 00:06:58,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 24 [2018-11-23 00:06:58,221 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-23 00:06:58,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 00:06:58,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=468, Unknown=9, NotChecked=240, Total=812 [2018-11-23 00:06:58,221 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand 24 states. [2018-11-23 00:07:09,694 WARN L180 SmtUtils]: Spent 4.02 s on a formula simplification. DAG size of input: 33 DAG size of output: 10 [2018-11-23 00:07:20,824 WARN L180 SmtUtils]: Spent 8.10 s on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2018-11-23 00:07:28,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:07:28,893 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2018-11-23 00:07:28,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 00:07:28,894 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 46 [2018-11-23 00:07:28,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:07:28,895 INFO L225 Difference]: With dead ends: 47 [2018-11-23 00:07:28,895 INFO L226 Difference]: Without dead ends: 45 [2018-11-23 00:07:28,896 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 68 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 38.1s TimeCoverageRelationStatistics Valid=138, Invalid=683, Unknown=11, NotChecked=290, Total=1122 [2018-11-23 00:07:28,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-23 00:07:28,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-11-23 00:07:28,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-23 00:07:28,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2018-11-23 00:07:28,901 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 46 [2018-11-23 00:07:28,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:07:28,901 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2018-11-23 00:07:28,901 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-23 00:07:28,901 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2018-11-23 00:07:28,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-23 00:07:28,902 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:07:28,902 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:07:28,903 INFO L423 AbstractCegarLoop]: === Iteration 4 === [testOneErr0ASSERT_VIOLATIONERROR_FUNCTION, testThreeErr0ASSERT_VIOLATIONERROR_FUNCTION, testTwoErr0ASSERT_VIOLATIONERROR_FUNCTION, testTwoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:07:28,903 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:07:28,903 INFO L82 PathProgramCache]: Analyzing trace with hash 1306260443, now seen corresponding path program 1 times [2018-11-23 00:07:28,903 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 00:07:28,903 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6a2ef302-4608-4ca4-a4dc-4a13342c03d1/bin-2019/uautomizer/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2018-11-23 00:07:28,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:07:29,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:07:29,202 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:07:29,220 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:07:29,221 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 27 [2018-11-23 00:07:29,223 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-11-23 00:07:29,223 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 00:07:29,227 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:07:29,230 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:07:29,231 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:18, output treesize:15 [2018-11-23 00:07:29,248 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 19 treesize of output 16 [2018-11-23 00:07:29,251 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 16 treesize of output 19 [2018-11-23 00:07:29,257 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2018-11-23 00:07:29,263 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2018-11-23 00:07:29,263 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 00:07:29,272 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:07:29,279 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:07:29,286 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:07:29,302 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 00:07:29,302 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:52, output treesize:56 [2018-11-23 00:07:31,338 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:07:31,350 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:07:31,352 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:07:31,353 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 34 [2018-11-23 00:07:31,353 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 00:07:31,375 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 00:07:31,375 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:68, output treesize:63 [2018-11-23 00:07:31,399 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:07:31,405 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 61 [2018-11-23 00:07:31,412 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 00:07:31,412 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 00:07:31,428 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:07:31,446 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 00:07:31,447 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:80, output treesize:81 [2018-11-23 00:07:33,770 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:07:33,772 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:07:33,773 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 00:07:33,774 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-11-23 00:07:33,774 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 00:07:33,887 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:07:33,939 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 78 treesize of output 101 [2018-11-23 00:07:33,950 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 102 treesize of output 101 [2018-11-23 00:07:33,958 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:07:33,959 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 34 [2018-11-23 00:07:33,969 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 38 [2018-11-23 00:07:33,969 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 00:07:33,988 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:07:34,015 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:07:34,141 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:07:34,142 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 60 [2018-11-23 00:07:34,147 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24 [2018-11-23 00:07:34,152 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:07:34,153 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 34 [2018-11-23 00:07:34,153 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 00:07:34,164 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:07:34,183 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:07:34,229 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 00:07:34,314 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-11-23 00:07:34,314 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:124, output treesize:203 [2018-11-23 00:07:34,533 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 64 [2018-11-23 00:07:34,537 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:07:34,538 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 12 [2018-11-23 00:07:34,538 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 00:07:34,559 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2018-11-23 00:07:34,559 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 00:07:34,567 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:07:34,582 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:07:34,582 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:100, output treesize:25 [2018-11-23 00:07:34,634 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-23 00:07:34,634 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 00:07:43,516 WARN L180 SmtUtils]: Spent 1.20 s on a formula simplification that was a NOOP. DAG size: 41 [2018-11-23 00:07:43,526 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 00:07:43,526 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6a2ef302-4608-4ca4-a4dc-4a13342c03d1/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 00:07:43,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:07:43,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:07:43,584 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:07:43,598 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:07:43,599 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 27 [2018-11-23 00:07:43,601 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-11-23 00:07:43,601 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 00:07:43,612 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:07:43,617 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:07:43,617 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:18, output treesize:15 [2018-11-23 00:07:43,627 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 19 treesize of output 16 [2018-11-23 00:07:43,631 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 16 treesize of output 19 [2018-11-23 00:07:43,637 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2018-11-23 00:07:43,646 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2018-11-23 00:07:43,647 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 00:07:43,654 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:07:43,662 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:07:43,670 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:07:43,685 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 00:07:43,685 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:52, output treesize:56 [2018-11-23 00:07:43,707 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:07:43,709 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:07:43,710 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:07:43,711 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 34 [2018-11-23 00:07:43,711 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 00:07:43,739 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 00:07:43,739 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:68, output treesize:63 [2018-11-23 00:07:43,743 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:07:43,751 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 61 [2018-11-23 00:07:43,757 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 00:07:43,757 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 00:07:43,771 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:07:43,790 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 00:07:43,791 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:80, output treesize:81 [2018-11-23 00:07:48,504 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:07:48,507 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:07:48,507 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 00:07:48,508 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 21 [2018-11-23 00:07:48,508 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 00:07:48,613 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:07:48,640 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 78 treesize of output 101 [2018-11-23 00:07:48,648 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 102 treesize of output 101 [2018-11-23 00:07:48,657 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:07:48,658 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 34 [2018-11-23 00:07:48,667 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 38 [2018-11-23 00:07:48,667 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 00:07:48,681 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:07:48,707 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:07:48,837 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:07:48,838 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 60 [2018-11-23 00:07:48,843 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24 [2018-11-23 00:07:48,848 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:07:48,848 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 34 [2018-11-23 00:07:48,848 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 00:07:48,863 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:07:48,880 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:07:48,930 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 00:07:49,005 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-11-23 00:07:49,005 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:126, output treesize:203 [2018-11-23 00:07:49,324 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 64 [2018-11-23 00:07:49,329 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 00:07:49,329 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 12 [2018-11-23 00:07:49,329 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 00:07:49,342 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2018-11-23 00:07:49,342 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 00:07:49,351 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:07:49,362 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:07:49,362 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:100, output treesize:25 [2018-11-23 00:07:49,367 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-23 00:07:49,367 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 00:07:58,101 WARN L180 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 41 [2018-11-23 00:07:58,117 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 00:07:58,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-11-23 00:07:58,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 00:07:58,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 00:07:58,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=169, Unknown=6, NotChecked=0, Total=210 [2018-11-23 00:07:58,118 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand 11 states. [2018-11-23 00:08:06,549 WARN L180 SmtUtils]: Spent 6.03 s on a formula simplification that was a NOOP. DAG size: 50 [2018-11-23 00:08:12,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:08:12,971 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2018-11-23 00:08:12,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 00:08:12,971 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 62 [2018-11-23 00:08:12,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:08:12,971 INFO L225 Difference]: With dead ends: 45 [2018-11-23 00:08:12,972 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 00:08:12,972 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 113 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 33.3s TimeCoverageRelationStatistics Valid=52, Invalid=248, Unknown=6, NotChecked=0, Total=306 [2018-11-23 00:08:12,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 00:08:12,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 00:08:12,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 00:08:12,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 00:08:12,972 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 62 [2018-11-23 00:08:12,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:08:12,972 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 00:08:12,972 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 00:08:12,973 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 00:08:12,973 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 00:08:12,975 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 00:08:13,179 INFO L448 ceAbstractionStarter]: For program point L130-1(line 130) no Hoare annotation was computed. [2018-11-23 00:08:13,179 INFO L448 ceAbstractionStarter]: For program point testOneFINAL(lines 127 136) no Hoare annotation was computed. [2018-11-23 00:08:13,179 INFO L448 ceAbstractionStarter]: For program point testOneEXIT(lines 127 136) no Hoare annotation was computed. [2018-11-23 00:08:13,179 INFO L444 ceAbstractionStarter]: At program point testOneENTRY(lines 127 136) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |old(#memory_int)| |#memory_int|)) [2018-11-23 00:08:13,180 INFO L448 ceAbstractionStarter]: For program point testOneErr0ASSERT_VIOLATIONERROR_FUNCTION(line 133) no Hoare annotation was computed. [2018-11-23 00:08:13,180 INFO L448 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2018-11-23 00:08:13,180 INFO L448 ceAbstractionStarter]: For program point L133-1(line 133) no Hoare annotation was computed. [2018-11-23 00:08:13,180 INFO L444 ceAbstractionStarter]: At program point L131(line 131) the Hoare annotation is: (and (exists ((|v_returnsStructure_~#c~1.base_4| (_ BitVec 32))) (let ((.cse0 (select |#memory_int| |v_returnsStructure_~#c~1.base_4|))) (let ((.cse1 (select .cse0 (_ bv0 32)))) (and (= (_ bv0 32) (select .cse0 (_ bv8 32))) (= (_ bv0 1) (select |#valid| |v_returnsStructure_~#c~1.base_4|)) (= (_ bv0 32) (select .cse0 (_ bv4 32))) (= (_ bv0 32) .cse1) (= (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1)) (let ((.cse2 (select (select |#memory_int| |testOne_~#f1~0.base|) |testOne_~#f1~0.offset|))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2)))))))) (not (= |testOne_~#f1~0.base| |testOne_~#f2~0.base|)) (= |testOne_~#f2~0.offset| (_ bv0 32)) (= (bvadd (select |#valid| |testOne_~#f1~0.base|) (_ bv1 1)) (_ bv0 1)) (not (= (_ bv0 1) (select |#valid| |testOne_~#f2~0.base|)))) [2018-11-23 00:08:13,180 INFO L444 ceAbstractionStarter]: At program point L130(line 130) the Hoare annotation is: (and (not (= |testOne_~#f1~0.base| |testOne_~#f2~0.base|)) (= (_ bv1 1) (select |#valid| |testOne_~#f2~0.base|)) (= |testOne_~#f2~0.offset| (_ bv0 32)) (= (bvadd (select |#valid| |testOne_~#f1~0.base|) (_ bv1 1)) (_ bv0 1))) [2018-11-23 00:08:13,180 INFO L448 ceAbstractionStarter]: For program point L131-1(line 131) no Hoare annotation was computed. [2018-11-23 00:08:13,180 INFO L448 ceAbstractionStarter]: For program point L133-3(line 133) no Hoare annotation was computed. [2018-11-23 00:08:13,180 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-23 00:08:13,180 INFO L444 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-11-23 00:08:13,180 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 00:08:13,180 INFO L448 ceAbstractionStarter]: For program point L162-1(line 162) no Hoare annotation was computed. [2018-11-23 00:08:13,180 INFO L444 ceAbstractionStarter]: At program point L160(line 160) the Hoare annotation is: (and (exists ((|v_returnsField_~#c~0.base_20| (_ BitVec 32))) (let ((.cse0 (select |#memory_int| |v_returnsField_~#c~0.base_20|))) (let ((.cse1 (select .cse0 (_ bv0 32)))) (and (= (_ bv0 1) (select |#valid| |v_returnsField_~#c~0.base_20|)) (= (select .cse0 (_ bv4 32)) (_ bv0 32)) (= (select .cse0 (_ bv8 32)) (_ bv0 32)) (= (_ bv0 32) .cse1) (= (let ((.cse2 (select (select |#memory_int| |testThree_~#f1~2.base|) |testThree_~#f1~2.offset|))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))))))) (= (_ bv1 1) (select |#valid| |testThree_~#f1~2.base|)) (not (= (_ bv0 1) (select |#valid| |testThree_~#f2~2.base|))) (not (= |testThree_~#f1~2.base| |testThree_~#f2~2.base|))) [2018-11-23 00:08:13,180 INFO L444 ceAbstractionStarter]: At program point L159(line 159) the Hoare annotation is: (and (= (_ bv1 1) (select |#valid| |testThree_~#f1~2.base|)) (= (_ bv1 1) (select |#valid| |testThree_~#f2~2.base|)) (not (= |testThree_~#f1~2.base| |testThree_~#f2~2.base|))) [2018-11-23 00:08:13,180 INFO L448 ceAbstractionStarter]: For program point L160-1(line 160) no Hoare annotation was computed. [2018-11-23 00:08:13,180 INFO L448 ceAbstractionStarter]: For program point L162-3(line 162) no Hoare annotation was computed. [2018-11-23 00:08:13,180 INFO L448 ceAbstractionStarter]: For program point L159-1(line 159) no Hoare annotation was computed. [2018-11-23 00:08:13,180 INFO L448 ceAbstractionStarter]: For program point testThreeFINAL(lines 156 165) no Hoare annotation was computed. [2018-11-23 00:08:13,180 INFO L448 ceAbstractionStarter]: For program point testThreeErr0ASSERT_VIOLATIONERROR_FUNCTION(line 162) no Hoare annotation was computed. [2018-11-23 00:08:13,181 INFO L448 ceAbstractionStarter]: For program point testThreeEXIT(lines 156 165) no Hoare annotation was computed. [2018-11-23 00:08:13,181 INFO L444 ceAbstractionStarter]: At program point testThreeENTRY(lines 156 165) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |old(#memory_int)| |#memory_int|)) [2018-11-23 00:08:13,181 INFO L448 ceAbstractionStarter]: For program point L162(line 162) no Hoare annotation was computed. [2018-11-23 00:08:13,181 INFO L444 ceAbstractionStarter]: At program point returnsStructureENTRY(lines 116 124) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |old(#memory_int)| |#memory_int|)) [2018-11-23 00:08:13,181 INFO L448 ceAbstractionStarter]: For program point returnsStructureFINAL(lines 116 124) no Hoare annotation was computed. [2018-11-23 00:08:13,181 INFO L448 ceAbstractionStarter]: For program point returnsStructureEXIT(lines 116 124) no Hoare annotation was computed. [2018-11-23 00:08:13,181 INFO L448 ceAbstractionStarter]: For program point returnsFieldEXIT(lines 106 114) no Hoare annotation was computed. [2018-11-23 00:08:13,181 INFO L444 ceAbstractionStarter]: At program point returnsFieldENTRY(lines 106 114) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |old(#memory_int)| |#memory_int|)) [2018-11-23 00:08:13,181 INFO L448 ceAbstractionStarter]: For program point returnsFieldFINAL(lines 106 114) no Hoare annotation was computed. [2018-11-23 00:08:13,181 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 00:08:13,181 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 00:08:13,181 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 00:08:13,181 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 00:08:13,181 INFO L444 ceAbstractionStarter]: At program point mainENTRY(lines 167 173) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |old(#memory_int)| |#memory_int|)) [2018-11-23 00:08:13,181 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 167 173) no Hoare annotation was computed. [2018-11-23 00:08:13,181 INFO L448 ceAbstractionStarter]: For program point L170(line 170) no Hoare annotation was computed. [2018-11-23 00:08:13,181 INFO L451 ceAbstractionStarter]: At program point L169(line 169) the Hoare annotation is: true [2018-11-23 00:08:13,181 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 167 173) no Hoare annotation was computed. [2018-11-23 00:08:13,181 INFO L451 ceAbstractionStarter]: At program point L168(line 168) the Hoare annotation is: true [2018-11-23 00:08:13,181 INFO L448 ceAbstractionStarter]: For program point testTwoEXIT(lines 139 153) no Hoare annotation was computed. [2018-11-23 00:08:13,181 INFO L448 ceAbstractionStarter]: For program point L147(line 147) no Hoare annotation was computed. [2018-11-23 00:08:13,181 INFO L448 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2018-11-23 00:08:13,181 INFO L448 ceAbstractionStarter]: For program point L145-1(line 145) no Hoare annotation was computed. [2018-11-23 00:08:13,182 INFO L444 ceAbstractionStarter]: At program point L143(line 143) the Hoare annotation is: (and (= (_ bv1 1) (select |#valid| |testTwo_~#f2~1.base|)) (not (= (_ bv0 1) (select |#valid| |testTwo_~#f1~1.base|))) (= (_ bv0 32) |testTwo_~#f2~1.offset|) (exists ((|v_returnsStructure_~#c~1.base_21| (_ BitVec 32))) (let ((.cse0 (select |#memory_int| |v_returnsStructure_~#c~1.base_21|))) (let ((.cse1 (select .cse0 (_ bv0 32)))) (and (= (select .cse0 (_ bv8 32)) (_ bv0 32)) (= (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1)) (let ((.cse2 (select (select |#memory_int| |testTwo_~#f1~1.base|) |testTwo_~#f1~1.offset|))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2)))) (= (select .cse0 (_ bv4 32)) (_ bv0 32)) (= (_ bv0 1) (select |#valid| |v_returnsStructure_~#c~1.base_21|)) (= .cse1 (_ bv0 32)))))) (not (= |testTwo_~#f1~1.base| |testTwo_~#f2~1.base|)) (= (_ bv0 32) |testTwo_~#f1~1.offset|)) [2018-11-23 00:08:13,182 INFO L448 ceAbstractionStarter]: For program point L143-1(line 143) no Hoare annotation was computed. [2018-11-23 00:08:13,182 INFO L444 ceAbstractionStarter]: At program point L145-3(line 145) the Hoare annotation is: (and (= (_ bv1 1) (select |#valid| |testTwo_~#f2~1.base|)) (not (= (_ bv0 1) (select |#valid| |testTwo_~#f1~1.base|))) (= (_ bv0 32) |testTwo_~#f2~1.offset|) (not (= |testTwo_~#f1~1.base| |testTwo_~#f2~1.base|)) (exists ((|v_returnsStructure_~#c~1.base_40| (_ BitVec 32))) (= (select |#valid| |v_returnsStructure_~#c~1.base_40|) (_ bv0 1))) (= (_ bv0 32) |testTwo_~#f1~1.offset|)) [2018-11-23 00:08:13,182 INFO L448 ceAbstractionStarter]: For program point testTwoFINAL(lines 139 153) no Hoare annotation was computed. [2018-11-23 00:08:13,182 INFO L448 ceAbstractionStarter]: For program point testTwoErr0ASSERT_VIOLATIONERROR_FUNCTION(line 145) no Hoare annotation was computed. [2018-11-23 00:08:13,182 INFO L448 ceAbstractionStarter]: For program point testTwoErr1ASSERT_VIOLATIONERROR_FUNCTION(line 150) no Hoare annotation was computed. [2018-11-23 00:08:13,182 INFO L448 ceAbstractionStarter]: For program point L150(line 150) no Hoare annotation was computed. [2018-11-23 00:08:13,182 INFO L448 ceAbstractionStarter]: For program point L150-1(line 150) no Hoare annotation was computed. [2018-11-23 00:08:13,182 INFO L444 ceAbstractionStarter]: At program point L148(line 148) the Hoare annotation is: (let ((.cse3 (select |#valid| |testTwo_~#f2~1.base|))) (and (exists ((|v_returnsField_~#c~0.base_4| (_ BitVec 32))) (let ((.cse0 (select |#memory_int| |v_returnsField_~#c~0.base_4|))) (let ((.cse1 (select .cse0 (_ bv0 32)))) (and (= (select |#valid| |v_returnsField_~#c~0.base_4|) (_ bv0 1)) (= (select .cse0 (_ bv4 32)) (_ bv0 32)) (= (select .cse0 (_ bv8 32)) (_ bv0 32)) (= .cse1 (_ bv0 32)) (= (let ((.cse2 (select (select |#memory_int| |testTwo_~#f1~1.base|) |testTwo_~#f1~1.offset|))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))))))) (not (= (_ bv0 1) .cse3)) (= (_ bv0 32) |testTwo_~#f2~1.offset|) (not (= |testTwo_~#f1~1.base| |testTwo_~#f2~1.base|)) (= (select |#valid| |testTwo_~#f1~1.base|) .cse3) (= (_ bv0 32) |testTwo_~#f1~1.offset|))) [2018-11-23 00:08:13,182 INFO L448 ceAbstractionStarter]: For program point L148-1(line 148) no Hoare annotation was computed. [2018-11-23 00:08:13,182 INFO L448 ceAbstractionStarter]: For program point L150-3(line 150) no Hoare annotation was computed. [2018-11-23 00:08:13,182 INFO L444 ceAbstractionStarter]: At program point testTwoENTRY(lines 139 153) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |old(#memory_int)| |#memory_int|)) [2018-11-23 00:08:13,183 INFO L444 ceAbstractionStarter]: At program point L142(line 142) the Hoare annotation is: (and (= (_ bv1 1) (select |#valid| |testTwo_~#f2~1.base|)) (= (_ bv1 1) (select |#valid| |testTwo_~#f1~1.base|)) (= (_ bv0 32) |testTwo_~#f2~1.offset|) (not (= |testTwo_~#f1~1.base| |testTwo_~#f2~1.base|)) (= (_ bv0 32) |testTwo_~#f1~1.offset|)) [2018-11-23 00:08:13,183 INFO L448 ceAbstractionStarter]: For program point L142-1(line 142) no Hoare annotation was computed. [2018-11-23 00:08:13,184 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 12:08:13 BoogieIcfgContainer [2018-11-23 00:08:13,184 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 00:08:13,185 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 00:08:13,185 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 00:08:13,185 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 00:08:13,185 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:05:15" (3/4) ... [2018-11-23 00:08:13,187 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 00:08:13,191 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure testOne [2018-11-23 00:08:13,191 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 00:08:13,191 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure testThree [2018-11-23 00:08:13,192 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure returnsStructure [2018-11-23 00:08:13,192 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure returnsField [2018-11-23 00:08:13,192 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 00:08:13,192 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure testTwo [2018-11-23 00:08:13,196 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 36 nodes and edges [2018-11-23 00:08:13,196 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2018-11-23 00:08:13,196 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-23 00:08:13,196 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 00:08:13,229 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_6a2ef302-4608-4ca4-a4dc-4a13342c03d1/bin-2019/uautomizer/witness.graphml [2018-11-23 00:08:13,229 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 00:08:13,230 INFO L168 Benchmark]: Toolchain (without parser) took 178551.11 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 234.4 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -191.8 MB). Peak memory consumption was 42.5 MB. Max. memory is 11.5 GB. [2018-11-23 00:08:13,231 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 00:08:13,231 INFO L168 Benchmark]: CACSL2BoogieTranslator took 235.37 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 932.5 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-23 00:08:13,231 INFO L168 Benchmark]: Boogie Procedure Inliner took 24.32 ms. Allocated memory is still 1.0 GB. Free memory is still 932.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 00:08:13,231 INFO L168 Benchmark]: Boogie Preprocessor took 30.38 ms. Allocated memory is still 1.0 GB. Free memory is still 932.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 00:08:13,231 INFO L168 Benchmark]: RCFGBuilder took 326.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 128.5 MB). Free memory was 932.5 MB in the beginning and 1.1 GB in the end (delta: -159.7 MB). Peak memory consumption was 21.1 MB. Max. memory is 11.5 GB. [2018-11-23 00:08:13,232 INFO L168 Benchmark]: TraceAbstraction took 177886.25 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 105.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -56.7 MB). Peak memory consumption was 49.2 MB. Max. memory is 11.5 GB. [2018-11-23 00:08:13,232 INFO L168 Benchmark]: Witness Printer took 45.00 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 11.5 GB. [2018-11-23 00:08:13,233 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 235.37 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 932.5 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 24.32 ms. Allocated memory is still 1.0 GB. Free memory is still 932.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 30.38 ms. Allocated memory is still 1.0 GB. Free memory is still 932.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 326.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 128.5 MB). Free memory was 932.5 MB in the beginning and 1.1 GB in the end (delta: -159.7 MB). Peak memory consumption was 21.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 177886.25 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 105.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -56.7 MB). Peak memory consumption was 49.2 MB. Max. memory is 11.5 GB. * Witness Printer took 45.00 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 133]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 162]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 145]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 150]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 59 locations, 4 error locations. SAFE Result, 177.8s OverallTime, 4 OverallIterations, 4 TraceHistogramMax, 69.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 154 SDtfs, 17 SDslu, 948 SDs, 0 SdLazy, 866 SolverSat, 120 SolverUnsat, 13 SolverUnknown, 0 SolverNotchecked, 32.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 361 GetRequests, 263 SyntacticMatches, 12 SemanticMatches, 86 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 459 ImplicationChecksByTransitivity, 131.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=59occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 19 LocationsWithAnnotation, 39 PreInvPairs, 43 NumberOfFragments, 484 HoareAnnotationTreeSize, 39 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 19 FomulaSimplificationsInter, 20 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 106.5s InterpolantComputationTime, 324 NumberOfCodeBlocks, 324 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 316 ConstructedInterpolants, 74 QuantifiedInterpolants, 183657 SizeOfPredicates, 82 NumberOfNonLiveVariables, 1388 ConjunctsInSsa, 275 ConjunctsInUnsatCore, 8 InterpolantComputations, 0 PerfectInterpolantSequences, 136/156 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...