./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/filter_iir_true-unreach-call.c --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_4af422bf-c203-4a3a-9375-c9715ccab05e/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_4af422bf-c203-4a3a-9375-c9715ccab05e/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_4af422bf-c203-4a3a-9375-c9715ccab05e/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_4af422bf-c203-4a3a-9375-c9715ccab05e/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/float-benchs/filter_iir_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_4af422bf-c203-4a3a-9375-c9715ccab05e/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_4af422bf-c203-4a3a-9375-c9715ccab05e/bin-2019/ukojak --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 Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4d8de78cb0edef97ecd7b2050e9bc61ccb30afeb ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_4af422bf-c203-4a3a-9375-c9715ccab05e/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_4af422bf-c203-4a3a-9375-c9715ccab05e/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_4af422bf-c203-4a3a-9375-c9715ccab05e/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_4af422bf-c203-4a3a-9375-c9715ccab05e/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/float-benchs/filter_iir_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_4af422bf-c203-4a3a-9375-c9715ccab05e/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_4af422bf-c203-4a3a-9375-c9715ccab05e/bin-2019/ukojak --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 Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4d8de78cb0edef97ecd7b2050e9bc61ccb30afeb ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: var is still there: v_arrayElimArr_39 input size 13 context size 13 output size 13 --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 03:23:17,345 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 03:23:17,347 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 03:23:17,354 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 03:23:17,354 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 03:23:17,355 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 03:23:17,356 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 03:23:17,357 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 03:23:17,358 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 03:23:17,359 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 03:23:17,359 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 03:23:17,360 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 03:23:17,361 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 03:23:17,362 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 03:23:17,362 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 03:23:17,363 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 03:23:17,364 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 03:23:17,365 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 03:23:17,367 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 03:23:17,368 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 03:23:17,369 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 03:23:17,370 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 03:23:17,372 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 03:23:17,372 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 03:23:17,372 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 03:23:17,373 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 03:23:17,373 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 03:23:17,374 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 03:23:17,374 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 03:23:17,375 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 03:23:17,376 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 03:23:17,376 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 03:23:17,377 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 03:23:17,377 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 03:23:17,377 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 03:23:17,378 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 03:23:17,378 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_4af422bf-c203-4a3a-9375-c9715ccab05e/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-11-23 03:23:17,388 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 03:23:17,389 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 03:23:17,389 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 03:23:17,389 INFO L133 SettingsManager]: * ... to procedures called more than once=ALWAYS [2018-11-23 03:23:17,389 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 03:23:17,390 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 03:23:17,390 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 03:23:17,390 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 03:23:17,390 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 03:23:17,390 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 03:23:17,390 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 03:23:17,390 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 03:23:17,390 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 03:23:17,391 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 03:23:17,391 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 03:23:17,391 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 03:23:17,391 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 03:23:17,391 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 03:23:17,391 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-23 03:23:17,392 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-23 03:23:17,392 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 03:23:17,392 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 03:23:17,392 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-23 03:23:17,392 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 03:23:17,392 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 03:23:17,392 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 03:23:17,393 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-11-23 03:23:17,393 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 03:23:17,393 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 03:23:17,393 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_4af422bf-c203-4a3a-9375-c9715ccab05e/bin-2019/ukojak 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 -> Kojak 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 -> 4d8de78cb0edef97ecd7b2050e9bc61ccb30afeb [2018-11-23 03:23:17,416 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 03:23:17,424 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 03:23:17,426 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 03:23:17,427 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 03:23:17,428 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 03:23:17,428 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_4af422bf-c203-4a3a-9375-c9715ccab05e/bin-2019/ukojak/../../sv-benchmarks/c/float-benchs/filter_iir_true-unreach-call.c [2018-11-23 03:23:17,461 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4af422bf-c203-4a3a-9375-c9715ccab05e/bin-2019/ukojak/data/04b97eb3a/80ac6a93870643d9a9e858c57cc68ba2/FLAGa3f751ac5 [2018-11-23 03:23:17,853 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 03:23:17,854 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_4af422bf-c203-4a3a-9375-c9715ccab05e/sv-benchmarks/c/float-benchs/filter_iir_true-unreach-call.c [2018-11-23 03:23:17,858 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4af422bf-c203-4a3a-9375-c9715ccab05e/bin-2019/ukojak/data/04b97eb3a/80ac6a93870643d9a9e858c57cc68ba2/FLAGa3f751ac5 [2018-11-23 03:23:17,867 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_4af422bf-c203-4a3a-9375-c9715ccab05e/bin-2019/ukojak/data/04b97eb3a/80ac6a93870643d9a9e858c57cc68ba2 [2018-11-23 03:23:17,869 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 03:23:17,870 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 03:23:17,871 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 03:23:17,871 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 03:23:17,873 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 03:23:17,874 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:23:17" (1/1) ... [2018-11-23 03:23:17,875 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a16ae76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:23:17, skipping insertion in model container [2018-11-23 03:23:17,876 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:23:17" (1/1) ... [2018-11-23 03:23:17,882 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 03:23:17,895 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 03:23:18,017 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 03:23:18,028 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 03:23:18,044 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 03:23:18,055 INFO L195 MainTranslator]: Completed translation [2018-11-23 03:23:18,055 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:23:18 WrapperNode [2018-11-23 03:23:18,055 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 03:23:18,056 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 03:23:18,056 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 03:23:18,056 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 03:23:18,061 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:23:18" (1/1) ... [2018-11-23 03:23:18,068 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:23:18" (1/1) ... [2018-11-23 03:23:18,122 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 03:23:18,122 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 03:23:18,122 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 03:23:18,123 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 03:23:18,131 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:23:18" (1/1) ... [2018-11-23 03:23:18,132 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:23:18" (1/1) ... [2018-11-23 03:23:18,134 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:23:18" (1/1) ... [2018-11-23 03:23:18,134 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:23:18" (1/1) ... [2018-11-23 03:23:18,140 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:23:18" (1/1) ... [2018-11-23 03:23:18,143 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:23:18" (1/1) ... [2018-11-23 03:23:18,144 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:23:18" (1/1) ... [2018-11-23 03:23:18,146 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 03:23:18,146 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 03:23:18,146 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 03:23:18,146 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 03:23:18,147 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:23:18" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4af422bf-c203-4a3a-9375-c9715ccab05e/bin-2019/ukojak/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (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:10000 [2018-11-23 03:23:18,185 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2018-11-23 03:23:18,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2018-11-23 03:23:18,186 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 03:23:18,186 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 03:23:18,186 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 03:23:18,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2018-11-23 03:23:18,513 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 03:23:18,513 INFO L280 CfgBuilder]: Removed 9 assue(true) statements. [2018-11-23 03:23:18,513 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:23:18 BoogieIcfgContainer [2018-11-23 03:23:18,514 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 03:23:18,514 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-23 03:23:18,514 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-23 03:23:18,524 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-23 03:23:18,524 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:23:18" (1/1) ... [2018-11-23 03:23:18,536 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:23:18,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 03:23:18,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 7 states and 8 transitions. [2018-11-23 03:23:18,568 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2018-11-23 03:23:18,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-11-23 03:23:18,571 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 03:23:18,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:23:18,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:23:18,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:23:18,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:23:18,804 WARN L493 CodeCheckObserver]: This program is UNSAFE, Check terminated with 1 iterations. ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#A1~0.base, ~#A1~0.offset := #Ultimate.alloc(24);call write~init~real(~convertINTToDOUBLE(1), ~#A1~0.base, ~#A1~0.offset, 8);call write~init~real(0.5179422053046, ~#A1~0.base, 8 + ~#A1~0.offset, 8);call write~init~real(1.0, ~#A1~0.base, 16 + ~#A1~0.offset, 8);call ~#b1~0.base, ~#b1~0.offset := #Ultimate.alloc(16);call write~init~real(1.470767736573, ~#b1~0.base, ~#b1~0.offset, 8);call write~init~real(0.5522073405779, ~#b1~0.base, 8 + ~#b1~0.offset, 8);call ~#A2~0.base, ~#A2~0.offset := #Ultimate.alloc(24);call write~init~real(~convertINTToDOUBLE(1), ~#A2~0.base, ~#A2~0.offset, 8);call write~init~real(1.633101801841, ~#A2~0.base, 8 + ~#A2~0.offset, 8);call write~init~real(1.0, ~#A2~0.base, 16 + ~#A2~0.offset, 8);call ~#b2~0.base, ~#b2~0.offset := #Ultimate.alloc(16);call write~init~real(1.74231955483, ~#b2~0.base, ~#b2~0.offset, 8);call write~init~real(0.820939679242, ~#b2~0.base, 8 + ~#b2~0.offset, 8);call ~#D1~0.base, ~#D1~0.offset := #Ultimate.alloc(16);call write~init~real(0.0, ~#D1~0.base, ~#D1~0.offset, 8);call write~init~real(0.0, ~#D1~0.base, 8 + ~#D1~0.offset, 8);call ~#D2~0.base, ~#D2~0.offset := #Ultimate.alloc(16);call write~init~real(0.0, ~#D2~0.base, ~#D2~0.offset, 8);call write~init~real(0.0, ~#D2~0.base, 8 + ~#D2~0.offset, 8);call ~#P~0.base, ~#P~0.offset := #Ultimate.alloc(8);call write~init~real(0.0, ~#P~0.base, ~#P~0.offset, 8);call ~#X~0.base, ~#X~0.offset := #Ultimate.alloc(8);call write~init~real(0.0, ~#X~0.base, ~#X~0.offset, 8);havoc main_#res;havoc main_#t~nondet21, main_#t~mem22, main_#t~mem23, main_#t~short24, main_#t~mem25, main_#t~mem26, main_#t~short27;call write~real(0.0, ~#D1~0.base, ~#D1~0.offset, 8);call write~real(0.0, ~#D1~0.base, 8 + ~#D1~0.offset, 8);call write~real(0.0, ~#D2~0.base, ~#D2~0.offset, 8);call write~real(0.0, ~#D2~0.base, 8 + ~#D2~0.offset, 8);call write~real(0.0, ~#P~0.base, ~#P~0.offset, 8); VAL [|#NULL.base|=0, |#NULL.offset|=0, |~#A1~0.base|=23, |~#A1~0.offset|=0, |~#A2~0.base|=22, |~#A2~0.offset|=0, |~#b1~0.base|=19, |~#b1~0.offset|=0, |~#b2~0.base|=20, |~#b2~0.offset|=0, |~#D1~0.base|=21, |~#D1~0.offset|=0, |~#D2~0.base|=25, |~#D2~0.offset|=0, |~#P~0.base|=28, |~#P~0.offset|=0, |~#X~0.base|=27, |~#X~0.offset|=0] [?] assume !false;call write~real(main_#t~nondet21, ~#X~0.base, ~#X~0.offset, 8);havoc main_#t~nondet21;call main_#t~mem22 := read~real(~#X~0.base, ~#X~0.offset, 8);main_#t~short24 := ~someBinaryDOUBLEComparisonOperation(main_#t~mem22, ~someUnaryDOUBLEoperation(10.0));BeginParallelComposition{ParallelCodeBlock0: assume main_#t~short24;call main_#t~mem23 := read~real(~#X~0.base, ~#X~0.offset, 8);main_#t~short24 := ~someBinaryDOUBLEComparisonOperation(main_#t~mem23, 10.0);ParallelCodeBlock1: assume !main_#t~short24;}EndParallelCompositionassume 0 != (if main_#t~short24 then 1 else 0);havoc main_#t~mem23;havoc main_#t~short24;havoc main_#t~mem22;iir4_#in~x.base, iir4_#in~x.offset, iir4_#in~y.base, iir4_#in~y.offset := ~#X~0.base, ~#X~0.offset, ~#P~0.base, ~#P~0.offset;havoc iir4_#t~mem0, iir4_#t~mem1, iir4_#t~mem2, iir4_#t~mem3, iir4_#t~mem4, iir4_#t~mem5, iir4_#t~mem6, iir4_#t~mem7, iir4_#t~mem8, iir4_#t~mem9, iir4_#t~mem10, iir4_#t~mem11, iir4_#t~mem12, iir4_#t~mem13, iir4_#t~mem14, iir4_#t~mem15, iir4_#t~mem16, iir4_#t~mem17, iir4_#t~mem18, iir4_#t~mem19, iir4_#t~mem20, iir4_~x.base, iir4_~x.offset, iir4_~y.base, iir4_~y.offset, iir4_~x1~0, iir4_~y1~0, iir4_~t1~0, iir4_~t2~0;iir4_~x.base, iir4_~x.offset := iir4_#in~x.base, iir4_#in~x.offset;iir4_~y.base, iir4_~y.offset := iir4_#in~y.base, iir4_#in~y.offset;havoc iir4_~x1~0;havoc iir4_~y1~0;havoc iir4_~t1~0;havoc iir4_~t2~0;call iir4_#t~mem0 := read~real(iir4_~x.base, iir4_~x.offset, 8);iir4_~x1~0 := ~someBinaryArithmeticDOUBLEoperation(0.0117749388721091, iir4_#t~mem0);havoc iir4_#t~mem0;call iir4_#t~mem1 := read~real(~#b1~0.base, ~#b1~0.offset, 8);call iir4_#t~mem2 := read~real(~#D1~0.base, ~#D1~0.offset, 8);call iir4_#t~mem3 := read~real(~#b1~0.base, 8 + ~#b1~0.offset, 8);call iir4_#t~mem4 := read~real(~#D1~0.base, 8 + ~#D1~0.offset, 8);iir4_~t1~0 := ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(iir4_~x1~0, ~someBinaryArithmeticDOUBLEoperation(iir4_#t~mem1, iir4_#t~mem2)), ~someBinaryArithmeticDOUBLEoperation(iir4_#t~mem3, iir4_#t~mem4));havoc iir4_#t~mem4;havoc iir4_#t~mem3;havoc iir4_#t~mem2;havoc iir4_#t~mem1;call iir4_#t~mem5 := read~real(~#A1~0.base, ~#A1~0.offset, 8);call iir4_#t~mem6 := read~real(~#A1~0.base, 8 + ~#A1~0.offset, 8);call iir4_#t~mem7 := read~real(~#D1~0.base, ~#D1~0.offset, 8);call iir4_#t~mem8 := read~real(~#A1~0.base, 16 + ~#A1~0.offset, 8);call iir4_#t~mem9 := read~real(~#D1~0.base, 8 + ~#D1~0.offset, 8);iir4_~y1~0 := ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(iir4_#t~mem5, iir4_~t1~0), ~someBinaryArithmeticDOUBLEoperation(iir4_#t~mem6, iir4_#t~mem7)), ~someBinaryArithmeticDOUBLEoperation(iir4_#t~mem8, iir4_#t~mem9));havoc iir4_#t~mem8;havoc iir4_#t~mem5;havoc iir4_#t~mem6;havoc iir4_#t~mem7;havoc iir4_#t~mem9;call iir4_#t~mem10 := read~real(~#D1~0.base, ~#D1~0.offset, 8);call write~real(iir4_#t~mem10, ~#D1~0.base, 8 + ~#D1~0.offset, 8);havoc iir4_#t~mem10;call write~real(iir4_~t1~0, ~#D1~0.base, ~#D1~0.offset, 8);call iir4_#t~mem11 := read~real(~#b2~0.base, ~#b2~0.offset, 8);call iir4_#t~mem12 := read~real(~#D2~0.base, ~#D2~0.offset, 8);call iir4_#t~mem13 := read~real(~#b2~0.base, 8 + ~#b2~0.offset, 8);call iir4_#t~mem14 := read~real(~#D2~0.base, 8 + ~#D2~0.offset, 8);iir4_~t2~0 := ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(iir4_~y1~0, ~someBinaryArithmeticDOUBLEoperation(iir4_#t~mem11, iir4_#t~mem12)), ~someBinaryArithmeticDOUBLEoperation(iir4_#t~mem13, iir4_#t~mem14));havoc iir4_#t~mem13;havoc iir4_#t~mem12;havoc iir4_#t~mem14;havoc iir4_#t~mem11;call iir4_#t~mem15 := read~real(~#A2~0.base, ~#A2~0.offset, 8);call iir4_#t~mem16 := read~real(~#A2~0.base, 8 + ~#A2~0.offset, 8);call iir4_#t~mem17 := read~real(~#D2~0.base, ~#D2~0.offset, 8);call iir4_#t~mem18 := read~real(~#A2~0.base, 16 + ~#A2~0.offset, 8);call iir4_#t~mem19 := read~real(~#D2~0.base, 8 + ~#D2~0.offset, 8);call write~real(~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(iir4_#t~mem15, iir4_~t2~0), ~someBinaryArithmeticDOUBLEoperation(iir4_#t~mem16, iir4_#t~mem17)), ~someBinaryArithmeticDOUBLEoperation(iir4_#t~mem18, iir4_#t~mem19)), iir4_~y.base, iir4_~y.offset, 8);havoc iir4_#t~mem15;havoc iir4_#t~mem18;havoc iir4_#t~mem17;havoc iir4_#t~mem16;havoc iir4_#t~mem19;call iir4_#t~mem20 := read~real(~#D2~0.base, ~#D2~0.offset, 8);call write~real(iir4_#t~mem20, ~#D2~0.base, 8 + ~#D2~0.offset, 8);havoc iir4_#t~mem20;call write~real(iir4_~t2~0, ~#D2~0.base, ~#D2~0.offset, 8);call main_#t~mem25 := read~real(~#P~0.base, ~#P~0.offset, 8);main_#t~short27 := ~someBinaryDOUBLEComparisonOperation(main_#t~mem25, ~someUnaryDOUBLEoperation(1.0E30));BeginParallelComposition{ParallelCodeBlock0: assume main_#t~short27;call main_#t~mem26 := read~real(~#P~0.base, ~#P~0.offset, 8);main_#t~short27 := ~someBinaryDOUBLEComparisonOperation(main_#t~mem26, 1.0E30);ParallelCodeBlock1: assume !main_#t~short27;}EndParallelComposition__VERIFIER_assert_#in~cond := (if main_#t~short27 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [ULTIMATE.start___VERIFIER_assert_~cond=0, ULTIMATE.start_iir4_~t1~0=33.0, ULTIMATE.start_iir4_~t2~0=14.0, ULTIMATE.start_iir4_~x.base=27, ULTIMATE.start_iir4_~x.offset=0, ULTIMATE.start_iir4_~y.base=28, ULTIMATE.start_iir4_~y.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start___VERIFIER_assert_#in~cond|=0, |ULTIMATE.start_iir4_#in~x.base|=27, |ULTIMATE.start_iir4_#in~x.offset|=0, |ULTIMATE.start_iir4_#in~y.base|=28, |ULTIMATE.start_iir4_#in~y.offset|=0, |ULTIMATE.start_main_#t~mem25|=25.0, |ULTIMATE.start_main_#t~mem26|=43.0, |ULTIMATE.start_main_#t~short27|=false, |~#A1~0.base|=23, |~#A1~0.offset|=0, |~#A2~0.base|=22, |~#A2~0.offset|=0, |~#b1~0.base|=19, |~#b1~0.offset|=0, |~#b2~0.base|=20, |~#b2~0.offset|=0, |~#D1~0.base|=21, |~#D1~0.offset|=0, |~#D2~0.base|=25, |~#D2~0.offset|=0, |~#P~0.base|=28, |~#P~0.offset|=0, |~#X~0.base|=27, |~#X~0.offset|=0] [?] assume 0 == __VERIFIER_assert_~cond; VAL [ULTIMATE.start___VERIFIER_assert_~cond=0, ULTIMATE.start_iir4_~t1~0=33.0, ULTIMATE.start_iir4_~t2~0=14.0, ULTIMATE.start_iir4_~x.base=27, ULTIMATE.start_iir4_~x.offset=0, ULTIMATE.start_iir4_~y.base=28, ULTIMATE.start_iir4_~y.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start___VERIFIER_assert_#in~cond|=0, |ULTIMATE.start_iir4_#in~x.base|=27, |ULTIMATE.start_iir4_#in~x.offset|=0, |ULTIMATE.start_iir4_#in~y.base|=28, |ULTIMATE.start_iir4_#in~y.offset|=0, |ULTIMATE.start_main_#t~mem25|=25.0, |ULTIMATE.start_main_#t~mem26|=43.0, |ULTIMATE.start_main_#t~short27|=false, |~#A1~0.base|=23, |~#A1~0.offset|=0, |~#A2~0.base|=22, |~#A2~0.offset|=0, |~#b1~0.base|=19, |~#b1~0.offset|=0, |~#b2~0.base|=20, |~#b2~0.offset|=0, |~#D1~0.base|=21, |~#D1~0.offset|=0, |~#D2~0.base|=25, |~#D2~0.offset|=0, |~#P~0.base|=28, |~#P~0.offset|=0, |~#X~0.base|=27, |~#X~0.offset|=0] [?] assume !false; VAL [ULTIMATE.start___VERIFIER_assert_~cond=0, ULTIMATE.start_iir4_~t1~0=33.0, ULTIMATE.start_iir4_~t2~0=14.0, ULTIMATE.start_iir4_~x.base=27, ULTIMATE.start_iir4_~x.offset=0, ULTIMATE.start_iir4_~y.base=28, ULTIMATE.start_iir4_~y.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start___VERIFIER_assert_#in~cond|=0, |ULTIMATE.start_iir4_#in~x.base|=27, |ULTIMATE.start_iir4_#in~x.offset|=0, |ULTIMATE.start_iir4_#in~y.base|=28, |ULTIMATE.start_iir4_#in~y.offset|=0, |ULTIMATE.start_main_#t~mem25|=25.0, |ULTIMATE.start_main_#t~mem26|=43.0, |ULTIMATE.start_main_#t~short27|=false, |~#A1~0.base|=23, |~#A1~0.offset|=0, |~#A2~0.base|=22, |~#A2~0.offset|=0, |~#b1~0.base|=19, |~#b1~0.offset|=0, |~#b2~0.base|=20, |~#b2~0.offset|=0, |~#D1~0.base|=21, |~#D1~0.offset|=0, |~#D2~0.base|=25, |~#D2~0.offset|=0, |~#P~0.base|=28, |~#P~0.offset|=0, |~#X~0.base|=27, |~#X~0.offset|=0] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [L11] call ~#A1~0.base, ~#A1~0.offset := #Ultimate.alloc(24); [L11] call write~init~real(~convertINTToDOUBLE(1), ~#A1~0.base, ~#A1~0.offset, 8); [L11] call write~init~real(0.5179422053046, ~#A1~0.base, 8 + ~#A1~0.offset, 8); [L11] call write~init~real(1.0, ~#A1~0.base, 16 + ~#A1~0.offset, 8); [L12] call ~#b1~0.base, ~#b1~0.offset := #Ultimate.alloc(16); [L12] call write~init~real(1.470767736573, ~#b1~0.base, ~#b1~0.offset, 8); [L12] call write~init~real(0.5522073405779, ~#b1~0.base, 8 + ~#b1~0.offset, 8); [L13] call ~#A2~0.base, ~#A2~0.offset := #Ultimate.alloc(24); [L13] call write~init~real(~convertINTToDOUBLE(1), ~#A2~0.base, ~#A2~0.offset, 8); [L13] call write~init~real(1.633101801841, ~#A2~0.base, 8 + ~#A2~0.offset, 8); [L13] call write~init~real(1.0, ~#A2~0.base, 16 + ~#A2~0.offset, 8); [L14] call ~#b2~0.base, ~#b2~0.offset := #Ultimate.alloc(16); [L14] call write~init~real(1.74231955483, ~#b2~0.base, ~#b2~0.offset, 8); [L14] call write~init~real(0.820939679242, ~#b2~0.base, 8 + ~#b2~0.offset, 8); [L16] call ~#D1~0.base, ~#D1~0.offset := #Ultimate.alloc(16); [L16] call write~init~real(0.0, ~#D1~0.base, ~#D1~0.offset, 8); [L16] call write~init~real(0.0, ~#D1~0.base, 8 + ~#D1~0.offset, 8); [L16] call ~#D2~0.base, ~#D2~0.offset := #Ultimate.alloc(16); [L16] call write~init~real(0.0, ~#D2~0.base, ~#D2~0.offset, 8); [L16] call write~init~real(0.0, ~#D2~0.base, 8 + ~#D2~0.offset, 8); [L17] call ~#P~0.base, ~#P~0.offset := #Ultimate.alloc(8); [L17] call write~init~real(0.0, ~#P~0.base, ~#P~0.offset, 8); [L17] call ~#X~0.base, ~#X~0.offset := #Ultimate.alloc(8); [L17] call write~init~real(0.0, ~#X~0.base, ~#X~0.offset, 8); [?] havoc main_#res; [?] havoc main_#t~nondet21, main_#t~mem22, main_#t~mem23, main_#t~short24, main_#t~mem25, main_#t~mem26, main_#t~short27; [L38] call write~real(0.0, ~#D1~0.base, ~#D1~0.offset, 8); [L38] call write~real(0.0, ~#D1~0.base, 8 + ~#D1~0.offset, 8); [L39] call write~real(0.0, ~#D2~0.base, ~#D2~0.offset, 8); [L39] call write~real(0.0, ~#D2~0.base, 8 + ~#D2~0.offset, 8); [L40] call write~real(0.0, ~#P~0.base, ~#P~0.offset, 8); VAL [#NULL.base=0, #NULL.offset=0, ~#A1~0.base=23, ~#A1~0.offset=0, ~#A2~0.base=22, ~#A2~0.offset=0, ~#b1~0.base=19, ~#b1~0.offset=0, ~#b2~0.base=20, ~#b2~0.offset=0, ~#D1~0.base=21, ~#D1~0.offset=0, ~#D2~0.base=25, ~#D2~0.offset=0, ~#P~0.base=28, ~#P~0.offset=0, ~#X~0.base=27, ~#X~0.offset=0] [L42-L50] assume !false; [L44] call write~real(main_#t~nondet21, ~#X~0.base, ~#X~0.offset, 8); [L44] havoc main_#t~nondet21; [L45] call main_#t~mem22 := read~real(~#X~0.base, ~#X~0.offset, 8); [L45] main_#t~short24 := ~someBinaryDOUBLEComparisonOperation(main_#t~mem22, ~someUnaryDOUBLEoperation(10.0)); [L45] assume main_#t~short24; [L45] call main_#t~mem23 := read~real(~#X~0.base, ~#X~0.offset, 8); [L45] main_#t~short24 := ~someBinaryDOUBLEComparisonOperation(main_#t~mem23, 10.0); [L45] assume 0 != (if main_#t~short24 then 1 else 0); [L45] havoc main_#t~mem23; [L45] havoc main_#t~short24; [L45] havoc main_#t~mem22; [L47] iir4_#in~x.base, iir4_#in~x.offset, iir4_#in~y.base, iir4_#in~y.offset := ~#X~0.base, ~#X~0.offset, ~#P~0.base, ~#P~0.offset; [L47] havoc iir4_#t~mem0, iir4_#t~mem1, iir4_#t~mem2, iir4_#t~mem3, iir4_#t~mem4, iir4_#t~mem5, iir4_#t~mem6, iir4_#t~mem7, iir4_#t~mem8, iir4_#t~mem9, iir4_#t~mem10, iir4_#t~mem11, iir4_#t~mem12, iir4_#t~mem13, iir4_#t~mem14, iir4_#t~mem15, iir4_#t~mem16, iir4_#t~mem17, iir4_#t~mem18, iir4_#t~mem19, iir4_#t~mem20, iir4_~x.base, iir4_~x.offset, iir4_~y.base, iir4_~y.offset, iir4_~x1~0, iir4_~y1~0, iir4_~t1~0, iir4_~t2~0; [L19-L34] iir4_~x.base, iir4_~x.offset := iir4_#in~x.base, iir4_#in~x.offset; [L19-L34] iir4_~y.base, iir4_~y.offset := iir4_#in~y.base, iir4_#in~y.offset; [L21] havoc iir4_~x1~0; [L21] havoc iir4_~y1~0; [L21] havoc iir4_~t1~0; [L21] havoc iir4_~t2~0; [L23] call iir4_#t~mem0 := read~real(iir4_~x.base, iir4_~x.offset, 8); [L23] iir4_~x1~0 := ~someBinaryArithmeticDOUBLEoperation(0.0117749388721091, iir4_#t~mem0); [L23] havoc iir4_#t~mem0; [L25] call iir4_#t~mem1 := read~real(~#b1~0.base, ~#b1~0.offset, 8); [L25] call iir4_#t~mem2 := read~real(~#D1~0.base, ~#D1~0.offset, 8); [L25] call iir4_#t~mem3 := read~real(~#b1~0.base, 8 + ~#b1~0.offset, 8); [L25] call iir4_#t~mem4 := read~real(~#D1~0.base, 8 + ~#D1~0.offset, 8); [L25] iir4_~t1~0 := ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(iir4_~x1~0, ~someBinaryArithmeticDOUBLEoperation(iir4_#t~mem1, iir4_#t~mem2)), ~someBinaryArithmeticDOUBLEoperation(iir4_#t~mem3, iir4_#t~mem4)); [L25] havoc iir4_#t~mem4; [L25] havoc iir4_#t~mem3; [L25] havoc iir4_#t~mem2; [L25] havoc iir4_#t~mem1; [L26] call iir4_#t~mem5 := read~real(~#A1~0.base, ~#A1~0.offset, 8); [L26] call iir4_#t~mem6 := read~real(~#A1~0.base, 8 + ~#A1~0.offset, 8); [L26] call iir4_#t~mem7 := read~real(~#D1~0.base, ~#D1~0.offset, 8); [L26] call iir4_#t~mem8 := read~real(~#A1~0.base, 16 + ~#A1~0.offset, 8); [L26] call iir4_#t~mem9 := read~real(~#D1~0.base, 8 + ~#D1~0.offset, 8); [L26] iir4_~y1~0 := ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(iir4_#t~mem5, iir4_~t1~0), ~someBinaryArithmeticDOUBLEoperation(iir4_#t~mem6, iir4_#t~mem7)), ~someBinaryArithmeticDOUBLEoperation(iir4_#t~mem8, iir4_#t~mem9)); [L26] havoc iir4_#t~mem8; [L26] havoc iir4_#t~mem5; [L26] havoc iir4_#t~mem6; [L26] havoc iir4_#t~mem7; [L26] havoc iir4_#t~mem9; [L27] call iir4_#t~mem10 := read~real(~#D1~0.base, ~#D1~0.offset, 8); [L27] call write~real(iir4_#t~mem10, ~#D1~0.base, 8 + ~#D1~0.offset, 8); [L27] havoc iir4_#t~mem10; [L28] call write~real(iir4_~t1~0, ~#D1~0.base, ~#D1~0.offset, 8); [L30] call iir4_#t~mem11 := read~real(~#b2~0.base, ~#b2~0.offset, 8); [L30] call iir4_#t~mem12 := read~real(~#D2~0.base, ~#D2~0.offset, 8); [L30] call iir4_#t~mem13 := read~real(~#b2~0.base, 8 + ~#b2~0.offset, 8); [L30] call iir4_#t~mem14 := read~real(~#D2~0.base, 8 + ~#D2~0.offset, 8); [L30] iir4_~t2~0 := ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(iir4_~y1~0, ~someBinaryArithmeticDOUBLEoperation(iir4_#t~mem11, iir4_#t~mem12)), ~someBinaryArithmeticDOUBLEoperation(iir4_#t~mem13, iir4_#t~mem14)); [L30] havoc iir4_#t~mem13; [L30] havoc iir4_#t~mem12; [L30] havoc iir4_#t~mem14; [L30] havoc iir4_#t~mem11; [L31] call iir4_#t~mem15 := read~real(~#A2~0.base, ~#A2~0.offset, 8); [L31] call iir4_#t~mem16 := read~real(~#A2~0.base, 8 + ~#A2~0.offset, 8); [L31] call iir4_#t~mem17 := read~real(~#D2~0.base, ~#D2~0.offset, 8); [L31] call iir4_#t~mem18 := read~real(~#A2~0.base, 16 + ~#A2~0.offset, 8); [L31] call iir4_#t~mem19 := read~real(~#D2~0.base, 8 + ~#D2~0.offset, 8); [L31] call write~real(~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(iir4_#t~mem15, iir4_~t2~0), ~someBinaryArithmeticDOUBLEoperation(iir4_#t~mem16, iir4_#t~mem17)), ~someBinaryArithmeticDOUBLEoperation(iir4_#t~mem18, iir4_#t~mem19)), iir4_~y.base, iir4_~y.offset, 8); [L31] havoc iir4_#t~mem15; [L31] havoc iir4_#t~mem18; [L31] havoc iir4_#t~mem17; [L31] havoc iir4_#t~mem16; [L31] havoc iir4_#t~mem19; [L32] call iir4_#t~mem20 := read~real(~#D2~0.base, ~#D2~0.offset, 8); [L32] call write~real(iir4_#t~mem20, ~#D2~0.base, 8 + ~#D2~0.offset, 8); [L32] havoc iir4_#t~mem20; [L33] call write~real(iir4_~t2~0, ~#D2~0.base, ~#D2~0.offset, 8); [L49] call main_#t~mem25 := read~real(~#P~0.base, ~#P~0.offset, 8); [L49] main_#t~short27 := ~someBinaryDOUBLEComparisonOperation(main_#t~mem25, ~someUnaryDOUBLEoperation(1.0E30)); [L49] assume !main_#t~short27; [L49] __VERIFIER_assert_#in~cond := (if main_#t~short27 then 1 else 0); [L49] havoc __VERIFIER_assert_~cond; [L8] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [#NULL.base=0, #NULL.offset=0, __VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, iir4_#in~x.base=27, iir4_#in~x.offset=0, iir4_#in~y.base=28, iir4_#in~y.offset=0, iir4_~t1~0=33.0, iir4_~t2~0=14.0, iir4_~x.base=27, iir4_~x.offset=0, iir4_~y.base=28, iir4_~y.offset=0, main_#t~mem25=25.0, main_#t~mem26=43.0, main_#t~short27=false, ~#A1~0.base=23, ~#A1~0.offset=0, ~#A2~0.base=22, ~#A2~0.offset=0, ~#b1~0.base=19, ~#b1~0.offset=0, ~#b2~0.base=20, ~#b2~0.offset=0, ~#D1~0.base=21, ~#D1~0.offset=0, ~#D2~0.base=25, ~#D2~0.offset=0, ~#P~0.base=28, ~#P~0.offset=0, ~#X~0.base=27, ~#X~0.offset=0] [L8] assume 0 == __VERIFIER_assert_~cond; VAL [#NULL.base=0, #NULL.offset=0, __VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, iir4_#in~x.base=27, iir4_#in~x.offset=0, iir4_#in~y.base=28, iir4_#in~y.offset=0, iir4_~t1~0=33.0, iir4_~t2~0=14.0, iir4_~x.base=27, iir4_~x.offset=0, iir4_~y.base=28, iir4_~y.offset=0, main_#t~mem25=25.0, main_#t~mem26=43.0, main_#t~short27=false, ~#A1~0.base=23, ~#A1~0.offset=0, ~#A2~0.base=22, ~#A2~0.offset=0, ~#b1~0.base=19, ~#b1~0.offset=0, ~#b2~0.base=20, ~#b2~0.offset=0, ~#D1~0.base=21, ~#D1~0.offset=0, ~#D2~0.base=25, ~#D2~0.offset=0, ~#P~0.base=28, ~#P~0.offset=0, ~#X~0.base=27, ~#X~0.offset=0] [L8] assert false; VAL [#NULL.base=0, #NULL.offset=0, __VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, iir4_#in~x.base=27, iir4_#in~x.offset=0, iir4_#in~y.base=28, iir4_#in~y.offset=0, iir4_~t1~0=33.0, iir4_~t2~0=14.0, iir4_~x.base=27, iir4_~x.offset=0, iir4_~y.base=28, iir4_~y.offset=0, main_#t~mem25=25.0, main_#t~mem26=43.0, main_#t~short27=false, ~#A1~0.base=23, ~#A1~0.offset=0, ~#A2~0.base=22, ~#A2~0.offset=0, ~#b1~0.base=19, ~#b1~0.offset=0, ~#b2~0.base=20, ~#b2~0.offset=0, ~#D1~0.base=21, ~#D1~0.offset=0, ~#D2~0.base=25, ~#D2~0.offset=0, ~#P~0.base=28, ~#P~0.offset=0, ~#X~0.base=27, ~#X~0.offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [L11] call ~#A1~0.base, ~#A1~0.offset := #Ultimate.alloc(24); [L11] call write~init~real(~convertINTToDOUBLE(1), ~#A1~0.base, ~#A1~0.offset, 8); [L11] call write~init~real(0.5179422053046, ~#A1~0.base, 8 + ~#A1~0.offset, 8); [L11] call write~init~real(1.0, ~#A1~0.base, 16 + ~#A1~0.offset, 8); [L12] call ~#b1~0.base, ~#b1~0.offset := #Ultimate.alloc(16); [L12] call write~init~real(1.470767736573, ~#b1~0.base, ~#b1~0.offset, 8); [L12] call write~init~real(0.5522073405779, ~#b1~0.base, 8 + ~#b1~0.offset, 8); [L13] call ~#A2~0.base, ~#A2~0.offset := #Ultimate.alloc(24); [L13] call write~init~real(~convertINTToDOUBLE(1), ~#A2~0.base, ~#A2~0.offset, 8); [L13] call write~init~real(1.633101801841, ~#A2~0.base, 8 + ~#A2~0.offset, 8); [L13] call write~init~real(1.0, ~#A2~0.base, 16 + ~#A2~0.offset, 8); [L14] call ~#b2~0.base, ~#b2~0.offset := #Ultimate.alloc(16); [L14] call write~init~real(1.74231955483, ~#b2~0.base, ~#b2~0.offset, 8); [L14] call write~init~real(0.820939679242, ~#b2~0.base, 8 + ~#b2~0.offset, 8); [L16] call ~#D1~0.base, ~#D1~0.offset := #Ultimate.alloc(16); [L16] call write~init~real(0.0, ~#D1~0.base, ~#D1~0.offset, 8); [L16] call write~init~real(0.0, ~#D1~0.base, 8 + ~#D1~0.offset, 8); [L16] call ~#D2~0.base, ~#D2~0.offset := #Ultimate.alloc(16); [L16] call write~init~real(0.0, ~#D2~0.base, ~#D2~0.offset, 8); [L16] call write~init~real(0.0, ~#D2~0.base, 8 + ~#D2~0.offset, 8); [L17] call ~#P~0.base, ~#P~0.offset := #Ultimate.alloc(8); [L17] call write~init~real(0.0, ~#P~0.base, ~#P~0.offset, 8); [L17] call ~#X~0.base, ~#X~0.offset := #Ultimate.alloc(8); [L17] call write~init~real(0.0, ~#X~0.base, ~#X~0.offset, 8); [?] havoc main_#res; [?] havoc main_#t~nondet21, main_#t~mem22, main_#t~mem23, main_#t~short24, main_#t~mem25, main_#t~mem26, main_#t~short27; [L38] call write~real(0.0, ~#D1~0.base, ~#D1~0.offset, 8); [L38] call write~real(0.0, ~#D1~0.base, 8 + ~#D1~0.offset, 8); [L39] call write~real(0.0, ~#D2~0.base, ~#D2~0.offset, 8); [L39] call write~real(0.0, ~#D2~0.base, 8 + ~#D2~0.offset, 8); [L40] call write~real(0.0, ~#P~0.base, ~#P~0.offset, 8); VAL [#NULL.base=0, #NULL.offset=0, ~#A1~0.base=23, ~#A1~0.offset=0, ~#A2~0.base=22, ~#A2~0.offset=0, ~#b1~0.base=19, ~#b1~0.offset=0, ~#b2~0.base=20, ~#b2~0.offset=0, ~#D1~0.base=21, ~#D1~0.offset=0, ~#D2~0.base=25, ~#D2~0.offset=0, ~#P~0.base=28, ~#P~0.offset=0, ~#X~0.base=27, ~#X~0.offset=0] [L42-L50] assume !false; [L44] call write~real(main_#t~nondet21, ~#X~0.base, ~#X~0.offset, 8); [L44] havoc main_#t~nondet21; [L45] call main_#t~mem22 := read~real(~#X~0.base, ~#X~0.offset, 8); [L45] main_#t~short24 := ~someBinaryDOUBLEComparisonOperation(main_#t~mem22, ~someUnaryDOUBLEoperation(10.0)); [L45] assume main_#t~short24; [L45] call main_#t~mem23 := read~real(~#X~0.base, ~#X~0.offset, 8); [L45] main_#t~short24 := ~someBinaryDOUBLEComparisonOperation(main_#t~mem23, 10.0); [L45] assume 0 != (if main_#t~short24 then 1 else 0); [L45] havoc main_#t~mem23; [L45] havoc main_#t~short24; [L45] havoc main_#t~mem22; [L47] iir4_#in~x.base, iir4_#in~x.offset, iir4_#in~y.base, iir4_#in~y.offset := ~#X~0.base, ~#X~0.offset, ~#P~0.base, ~#P~0.offset; [L47] havoc iir4_#t~mem0, iir4_#t~mem1, iir4_#t~mem2, iir4_#t~mem3, iir4_#t~mem4, iir4_#t~mem5, iir4_#t~mem6, iir4_#t~mem7, iir4_#t~mem8, iir4_#t~mem9, iir4_#t~mem10, iir4_#t~mem11, iir4_#t~mem12, iir4_#t~mem13, iir4_#t~mem14, iir4_#t~mem15, iir4_#t~mem16, iir4_#t~mem17, iir4_#t~mem18, iir4_#t~mem19, iir4_#t~mem20, iir4_~x.base, iir4_~x.offset, iir4_~y.base, iir4_~y.offset, iir4_~x1~0, iir4_~y1~0, iir4_~t1~0, iir4_~t2~0; [L19-L34] iir4_~x.base, iir4_~x.offset := iir4_#in~x.base, iir4_#in~x.offset; [L19-L34] iir4_~y.base, iir4_~y.offset := iir4_#in~y.base, iir4_#in~y.offset; [L21] havoc iir4_~x1~0; [L21] havoc iir4_~y1~0; [L21] havoc iir4_~t1~0; [L21] havoc iir4_~t2~0; [L23] call iir4_#t~mem0 := read~real(iir4_~x.base, iir4_~x.offset, 8); [L23] iir4_~x1~0 := ~someBinaryArithmeticDOUBLEoperation(0.0117749388721091, iir4_#t~mem0); [L23] havoc iir4_#t~mem0; [L25] call iir4_#t~mem1 := read~real(~#b1~0.base, ~#b1~0.offset, 8); [L25] call iir4_#t~mem2 := read~real(~#D1~0.base, ~#D1~0.offset, 8); [L25] call iir4_#t~mem3 := read~real(~#b1~0.base, 8 + ~#b1~0.offset, 8); [L25] call iir4_#t~mem4 := read~real(~#D1~0.base, 8 + ~#D1~0.offset, 8); [L25] iir4_~t1~0 := ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(iir4_~x1~0, ~someBinaryArithmeticDOUBLEoperation(iir4_#t~mem1, iir4_#t~mem2)), ~someBinaryArithmeticDOUBLEoperation(iir4_#t~mem3, iir4_#t~mem4)); [L25] havoc iir4_#t~mem4; [L25] havoc iir4_#t~mem3; [L25] havoc iir4_#t~mem2; [L25] havoc iir4_#t~mem1; [L26] call iir4_#t~mem5 := read~real(~#A1~0.base, ~#A1~0.offset, 8); [L26] call iir4_#t~mem6 := read~real(~#A1~0.base, 8 + ~#A1~0.offset, 8); [L26] call iir4_#t~mem7 := read~real(~#D1~0.base, ~#D1~0.offset, 8); [L26] call iir4_#t~mem8 := read~real(~#A1~0.base, 16 + ~#A1~0.offset, 8); [L26] call iir4_#t~mem9 := read~real(~#D1~0.base, 8 + ~#D1~0.offset, 8); [L26] iir4_~y1~0 := ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(iir4_#t~mem5, iir4_~t1~0), ~someBinaryArithmeticDOUBLEoperation(iir4_#t~mem6, iir4_#t~mem7)), ~someBinaryArithmeticDOUBLEoperation(iir4_#t~mem8, iir4_#t~mem9)); [L26] havoc iir4_#t~mem8; [L26] havoc iir4_#t~mem5; [L26] havoc iir4_#t~mem6; [L26] havoc iir4_#t~mem7; [L26] havoc iir4_#t~mem9; [L27] call iir4_#t~mem10 := read~real(~#D1~0.base, ~#D1~0.offset, 8); [L27] call write~real(iir4_#t~mem10, ~#D1~0.base, 8 + ~#D1~0.offset, 8); [L27] havoc iir4_#t~mem10; [L28] call write~real(iir4_~t1~0, ~#D1~0.base, ~#D1~0.offset, 8); [L30] call iir4_#t~mem11 := read~real(~#b2~0.base, ~#b2~0.offset, 8); [L30] call iir4_#t~mem12 := read~real(~#D2~0.base, ~#D2~0.offset, 8); [L30] call iir4_#t~mem13 := read~real(~#b2~0.base, 8 + ~#b2~0.offset, 8); [L30] call iir4_#t~mem14 := read~real(~#D2~0.base, 8 + ~#D2~0.offset, 8); [L30] iir4_~t2~0 := ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(iir4_~y1~0, ~someBinaryArithmeticDOUBLEoperation(iir4_#t~mem11, iir4_#t~mem12)), ~someBinaryArithmeticDOUBLEoperation(iir4_#t~mem13, iir4_#t~mem14)); [L30] havoc iir4_#t~mem13; [L30] havoc iir4_#t~mem12; [L30] havoc iir4_#t~mem14; [L30] havoc iir4_#t~mem11; [L31] call iir4_#t~mem15 := read~real(~#A2~0.base, ~#A2~0.offset, 8); [L31] call iir4_#t~mem16 := read~real(~#A2~0.base, 8 + ~#A2~0.offset, 8); [L31] call iir4_#t~mem17 := read~real(~#D2~0.base, ~#D2~0.offset, 8); [L31] call iir4_#t~mem18 := read~real(~#A2~0.base, 16 + ~#A2~0.offset, 8); [L31] call iir4_#t~mem19 := read~real(~#D2~0.base, 8 + ~#D2~0.offset, 8); [L31] call write~real(~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(iir4_#t~mem15, iir4_~t2~0), ~someBinaryArithmeticDOUBLEoperation(iir4_#t~mem16, iir4_#t~mem17)), ~someBinaryArithmeticDOUBLEoperation(iir4_#t~mem18, iir4_#t~mem19)), iir4_~y.base, iir4_~y.offset, 8); [L31] havoc iir4_#t~mem15; [L31] havoc iir4_#t~mem18; [L31] havoc iir4_#t~mem17; [L31] havoc iir4_#t~mem16; [L31] havoc iir4_#t~mem19; [L32] call iir4_#t~mem20 := read~real(~#D2~0.base, ~#D2~0.offset, 8); [L32] call write~real(iir4_#t~mem20, ~#D2~0.base, 8 + ~#D2~0.offset, 8); [L32] havoc iir4_#t~mem20; [L33] call write~real(iir4_~t2~0, ~#D2~0.base, ~#D2~0.offset, 8); [L49] call main_#t~mem25 := read~real(~#P~0.base, ~#P~0.offset, 8); [L49] main_#t~short27 := ~someBinaryDOUBLEComparisonOperation(main_#t~mem25, ~someUnaryDOUBLEoperation(1.0E30)); [L49] assume !main_#t~short27; [L49] __VERIFIER_assert_#in~cond := (if main_#t~short27 then 1 else 0); [L49] havoc __VERIFIER_assert_~cond; [L8] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [#NULL.base=0, #NULL.offset=0, __VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, iir4_#in~x.base=27, iir4_#in~x.offset=0, iir4_#in~y.base=28, iir4_#in~y.offset=0, iir4_~t1~0=33.0, iir4_~t2~0=14.0, iir4_~x.base=27, iir4_~x.offset=0, iir4_~y.base=28, iir4_~y.offset=0, main_#t~mem25=25.0, main_#t~mem26=43.0, main_#t~short27=false, ~#A1~0.base=23, ~#A1~0.offset=0, ~#A2~0.base=22, ~#A2~0.offset=0, ~#b1~0.base=19, ~#b1~0.offset=0, ~#b2~0.base=20, ~#b2~0.offset=0, ~#D1~0.base=21, ~#D1~0.offset=0, ~#D2~0.base=25, ~#D2~0.offset=0, ~#P~0.base=28, ~#P~0.offset=0, ~#X~0.base=27, ~#X~0.offset=0] [L8] assume 0 == __VERIFIER_assert_~cond; VAL [#NULL.base=0, #NULL.offset=0, __VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, iir4_#in~x.base=27, iir4_#in~x.offset=0, iir4_#in~y.base=28, iir4_#in~y.offset=0, iir4_~t1~0=33.0, iir4_~t2~0=14.0, iir4_~x.base=27, iir4_~x.offset=0, iir4_~y.base=28, iir4_~y.offset=0, main_#t~mem25=25.0, main_#t~mem26=43.0, main_#t~short27=false, ~#A1~0.base=23, ~#A1~0.offset=0, ~#A2~0.base=22, ~#A2~0.offset=0, ~#b1~0.base=19, ~#b1~0.offset=0, ~#b2~0.base=20, ~#b2~0.offset=0, ~#D1~0.base=21, ~#D1~0.offset=0, ~#D2~0.base=25, ~#D2~0.offset=0, ~#P~0.base=28, ~#P~0.offset=0, ~#X~0.base=27, ~#X~0.offset=0] [L8] assert false; VAL [#NULL.base=0, #NULL.offset=0, __VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, iir4_#in~x.base=27, iir4_#in~x.offset=0, iir4_#in~y.base=28, iir4_#in~y.offset=0, iir4_~t1~0=33.0, iir4_~t2~0=14.0, iir4_~x.base=27, iir4_~x.offset=0, iir4_~y.base=28, iir4_~y.offset=0, main_#t~mem25=25.0, main_#t~mem26=43.0, main_#t~short27=false, ~#A1~0.base=23, ~#A1~0.offset=0, ~#A2~0.base=22, ~#A2~0.offset=0, ~#b1~0.base=19, ~#b1~0.offset=0, ~#b2~0.base=20, ~#b2~0.offset=0, ~#D1~0.base=21, ~#D1~0.offset=0, ~#D2~0.base=25, ~#D2~0.offset=0, ~#P~0.base=28, ~#P~0.offset=0, ~#X~0.base=27, ~#X~0.offset=0] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L11] FCALL call ~#A1~0 := #Ultimate.alloc(24); [L11] FCALL call write~init~real(~convertINTToDOUBLE(1), { base: ~#A1~0!base, offset: ~#A1~0!offset }, 8); [L11] FCALL call write~init~real(0.5179422053046, { base: ~#A1~0!base, offset: 8 + ~#A1~0!offset }, 8); [L11] FCALL call write~init~real(1.0, { base: ~#A1~0!base, offset: 16 + ~#A1~0!offset }, 8); [L12] FCALL call ~#b1~0 := #Ultimate.alloc(16); [L12] FCALL call write~init~real(1.470767736573, { base: ~#b1~0!base, offset: ~#b1~0!offset }, 8); [L12] FCALL call write~init~real(0.5522073405779, { base: ~#b1~0!base, offset: 8 + ~#b1~0!offset }, 8); [L13] FCALL call ~#A2~0 := #Ultimate.alloc(24); [L13] FCALL call write~init~real(~convertINTToDOUBLE(1), { base: ~#A2~0!base, offset: ~#A2~0!offset }, 8); [L13] FCALL call write~init~real(1.633101801841, { base: ~#A2~0!base, offset: 8 + ~#A2~0!offset }, 8); [L13] FCALL call write~init~real(1.0, { base: ~#A2~0!base, offset: 16 + ~#A2~0!offset }, 8); [L14] FCALL call ~#b2~0 := #Ultimate.alloc(16); [L14] FCALL call write~init~real(1.74231955483, { base: ~#b2~0!base, offset: ~#b2~0!offset }, 8); [L14] FCALL call write~init~real(0.820939679242, { base: ~#b2~0!base, offset: 8 + ~#b2~0!offset }, 8); [L16] FCALL call ~#D1~0 := #Ultimate.alloc(16); [L16] FCALL call write~init~real(0.0, { base: ~#D1~0!base, offset: ~#D1~0!offset }, 8); [L16] FCALL call write~init~real(0.0, { base: ~#D1~0!base, offset: 8 + ~#D1~0!offset }, 8); [L16] FCALL call ~#D2~0 := #Ultimate.alloc(16); [L16] FCALL call write~init~real(0.0, { base: ~#D2~0!base, offset: ~#D2~0!offset }, 8); [L16] FCALL call write~init~real(0.0, { base: ~#D2~0!base, offset: 8 + ~#D2~0!offset }, 8); [L17] FCALL call ~#P~0 := #Ultimate.alloc(8); [L17] FCALL call write~init~real(0.0, ~#P~0, 8); [L17] FCALL call ~#X~0 := #Ultimate.alloc(8); [L17] FCALL call write~init~real(0.0, ~#X~0, 8); [?] havoc main_#res; [?] havoc main_#t~nondet21, main_#t~mem22, main_#t~mem23, main_#t~short24, main_#t~mem25, main_#t~mem26, main_#t~short27; [L38] FCALL call write~real(0.0, { base: ~#D1~0!base, offset: ~#D1~0!offset }, 8); [L38] FCALL call write~real(0.0, { base: ~#D1~0!base, offset: 8 + ~#D1~0!offset }, 8); [L39] FCALL call write~real(0.0, { base: ~#D2~0!base, offset: ~#D2~0!offset }, 8); [L39] FCALL call write~real(0.0, { base: ~#D2~0!base, offset: 8 + ~#D2~0!offset }, 8); [L40] FCALL call write~real(0.0, ~#P~0, 8); VAL [#NULL!base=0, #NULL!offset=0, ~#A1~0!base=23, ~#A1~0!offset=0, ~#A2~0!base=22, ~#A2~0!offset=0, ~#b1~0!base=19, ~#b1~0!offset=0, ~#b2~0!base=20, ~#b2~0!offset=0, ~#D1~0!base=21, ~#D1~0!offset=0, ~#D2~0!base=25, ~#D2~0!offset=0, ~#P~0!base=28, ~#P~0!offset=0, ~#X~0!base=27, ~#X~0!offset=0] [L42-L50] COND FALSE !(false) [L44] FCALL call write~real(main_#t~nondet21, ~#X~0, 8); [L44] havoc main_#t~nondet21; [L45] FCALL call main_#t~mem22 := read~real(~#X~0, 8); [L45] main_#t~short24 := ~someBinaryDOUBLEComparisonOperation(main_#t~mem22, ~someUnaryDOUBLEoperation(10.0)); [L45] COND TRUE main_#t~short24 [L45] FCALL call main_#t~mem23 := read~real(~#X~0, 8); [L45] main_#t~short24 := ~someBinaryDOUBLEComparisonOperation(main_#t~mem23, 10.0); [L45] assume 0 != (if main_#t~short24 then 1 else 0); [L45] havoc main_#t~mem23; [L45] havoc main_#t~short24; [L45] havoc main_#t~mem22; [L47] iir4_#in~x, iir4_#in~y := ~#X~0, ~#P~0; [L47] havoc iir4_#t~mem0, iir4_#t~mem1, iir4_#t~mem2, iir4_#t~mem3, iir4_#t~mem4, iir4_#t~mem5, iir4_#t~mem6, iir4_#t~mem7, iir4_#t~mem8, iir4_#t~mem9, iir4_#t~mem10, iir4_#t~mem11, iir4_#t~mem12, iir4_#t~mem13, iir4_#t~mem14, iir4_#t~mem15, iir4_#t~mem16, iir4_#t~mem17, iir4_#t~mem18, iir4_#t~mem19, iir4_#t~mem20, iir4_~x, iir4_~y, iir4_~x1~0, iir4_~y1~0, iir4_~t1~0, iir4_~t2~0; [L19-L34] iir4_~x := iir4_#in~x; [L19-L34] iir4_~y := iir4_#in~y; [L21] havoc iir4_~x1~0; [L21] havoc iir4_~y1~0; [L21] havoc iir4_~t1~0; [L21] havoc iir4_~t2~0; [L23] FCALL call iir4_#t~mem0 := read~real(iir4_~x, 8); [L23] iir4_~x1~0 := ~someBinaryArithmeticDOUBLEoperation(0.0117749388721091, iir4_#t~mem0); [L23] havoc iir4_#t~mem0; [L25] FCALL call iir4_#t~mem1 := read~real({ base: ~#b1~0!base, offset: ~#b1~0!offset }, 8); [L25] FCALL call iir4_#t~mem2 := read~real({ base: ~#D1~0!base, offset: ~#D1~0!offset }, 8); [L25] FCALL call iir4_#t~mem3 := read~real({ base: ~#b1~0!base, offset: 8 + ~#b1~0!offset }, 8); [L25] FCALL call iir4_#t~mem4 := read~real({ base: ~#D1~0!base, offset: 8 + ~#D1~0!offset }, 8); [L25] iir4_~t1~0 := ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(iir4_~x1~0, ~someBinaryArithmeticDOUBLEoperation(iir4_#t~mem1, iir4_#t~mem2)), ~someBinaryArithmeticDOUBLEoperation(iir4_#t~mem3, iir4_#t~mem4)); [L25] havoc iir4_#t~mem4; [L25] havoc iir4_#t~mem3; [L25] havoc iir4_#t~mem2; [L25] havoc iir4_#t~mem1; [L26] FCALL call iir4_#t~mem5 := read~real({ base: ~#A1~0!base, offset: ~#A1~0!offset }, 8); [L26] FCALL call iir4_#t~mem6 := read~real({ base: ~#A1~0!base, offset: 8 + ~#A1~0!offset }, 8); [L26] FCALL call iir4_#t~mem7 := read~real({ base: ~#D1~0!base, offset: ~#D1~0!offset }, 8); [L26] FCALL call iir4_#t~mem8 := read~real({ base: ~#A1~0!base, offset: 16 + ~#A1~0!offset }, 8); [L26] FCALL call iir4_#t~mem9 := read~real({ base: ~#D1~0!base, offset: 8 + ~#D1~0!offset }, 8); [L26] iir4_~y1~0 := ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(iir4_#t~mem5, iir4_~t1~0), ~someBinaryArithmeticDOUBLEoperation(iir4_#t~mem6, iir4_#t~mem7)), ~someBinaryArithmeticDOUBLEoperation(iir4_#t~mem8, iir4_#t~mem9)); [L26] havoc iir4_#t~mem8; [L26] havoc iir4_#t~mem5; [L26] havoc iir4_#t~mem6; [L26] havoc iir4_#t~mem7; [L26] havoc iir4_#t~mem9; [L27] FCALL call iir4_#t~mem10 := read~real({ base: ~#D1~0!base, offset: ~#D1~0!offset }, 8); [L27] FCALL call write~real(iir4_#t~mem10, { base: ~#D1~0!base, offset: 8 + ~#D1~0!offset }, 8); [L27] havoc iir4_#t~mem10; [L28] FCALL call write~real(iir4_~t1~0, { base: ~#D1~0!base, offset: ~#D1~0!offset }, 8); [L30] FCALL call iir4_#t~mem11 := read~real({ base: ~#b2~0!base, offset: ~#b2~0!offset }, 8); [L30] FCALL call iir4_#t~mem12 := read~real({ base: ~#D2~0!base, offset: ~#D2~0!offset }, 8); [L30] FCALL call iir4_#t~mem13 := read~real({ base: ~#b2~0!base, offset: 8 + ~#b2~0!offset }, 8); [L30] FCALL call iir4_#t~mem14 := read~real({ base: ~#D2~0!base, offset: 8 + ~#D2~0!offset }, 8); [L30] iir4_~t2~0 := ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(iir4_~y1~0, ~someBinaryArithmeticDOUBLEoperation(iir4_#t~mem11, iir4_#t~mem12)), ~someBinaryArithmeticDOUBLEoperation(iir4_#t~mem13, iir4_#t~mem14)); [L30] havoc iir4_#t~mem13; [L30] havoc iir4_#t~mem12; [L30] havoc iir4_#t~mem14; [L30] havoc iir4_#t~mem11; [L31] FCALL call iir4_#t~mem15 := read~real({ base: ~#A2~0!base, offset: ~#A2~0!offset }, 8); [L31] FCALL call iir4_#t~mem16 := read~real({ base: ~#A2~0!base, offset: 8 + ~#A2~0!offset }, 8); [L31] FCALL call iir4_#t~mem17 := read~real({ base: ~#D2~0!base, offset: ~#D2~0!offset }, 8); [L31] FCALL call iir4_#t~mem18 := read~real({ base: ~#A2~0!base, offset: 16 + ~#A2~0!offset }, 8); [L31] FCALL call iir4_#t~mem19 := read~real({ base: ~#D2~0!base, offset: 8 + ~#D2~0!offset }, 8); [L31] FCALL call write~real(~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(iir4_#t~mem15, iir4_~t2~0), ~someBinaryArithmeticDOUBLEoperation(iir4_#t~mem16, iir4_#t~mem17)), ~someBinaryArithmeticDOUBLEoperation(iir4_#t~mem18, iir4_#t~mem19)), iir4_~y, 8); [L31] havoc iir4_#t~mem15; [L31] havoc iir4_#t~mem18; [L31] havoc iir4_#t~mem17; [L31] havoc iir4_#t~mem16; [L31] havoc iir4_#t~mem19; [L32] FCALL call iir4_#t~mem20 := read~real({ base: ~#D2~0!base, offset: ~#D2~0!offset }, 8); [L32] FCALL call write~real(iir4_#t~mem20, { base: ~#D2~0!base, offset: 8 + ~#D2~0!offset }, 8); [L32] havoc iir4_#t~mem20; [L33] FCALL call write~real(iir4_~t2~0, { base: ~#D2~0!base, offset: ~#D2~0!offset }, 8); [L49] FCALL call main_#t~mem25 := read~real(~#P~0, 8); [L49] main_#t~short27 := ~someBinaryDOUBLEComparisonOperation(main_#t~mem25, ~someUnaryDOUBLEoperation(1.0E30)); [L49] COND FALSE !(main_#t~short27) [L49] __VERIFIER_assert_#in~cond := (if main_#t~short27 then 1 else 0); [L49] havoc __VERIFIER_assert_~cond; [L8] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [#NULL!base=0, #NULL!offset=0, __VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, iir4_#in~x!base=27, iir4_#in~x!offset=0, iir4_#in~y!base=28, iir4_#in~y!offset=0, iir4_~t1~0=33.0, iir4_~t2~0=14.0, iir4_~x!base=27, iir4_~x!offset=0, iir4_~y!base=28, iir4_~y!offset=0, main_#t~mem25=25.0, main_#t~mem26=43.0, main_#t~short27=false, ~#A1~0!base=23, ~#A1~0!offset=0, ~#A2~0!base=22, ~#A2~0!offset=0, ~#b1~0!base=19, ~#b1~0!offset=0, ~#b2~0!base=20, ~#b2~0!offset=0, ~#D1~0!base=21, ~#D1~0!offset=0, ~#D2~0!base=25, ~#D2~0!offset=0, ~#P~0!base=28, ~#P~0!offset=0, ~#X~0!base=27, ~#X~0!offset=0] [L8] COND TRUE 0 == __VERIFIER_assert_~cond VAL [#NULL!base=0, #NULL!offset=0, __VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, iir4_#in~x!base=27, iir4_#in~x!offset=0, iir4_#in~y!base=28, iir4_#in~y!offset=0, iir4_~t1~0=33.0, iir4_~t2~0=14.0, iir4_~x!base=27, iir4_~x!offset=0, iir4_~y!base=28, iir4_~y!offset=0, main_#t~mem25=25.0, main_#t~mem26=43.0, main_#t~short27=false, ~#A1~0!base=23, ~#A1~0!offset=0, ~#A2~0!base=22, ~#A2~0!offset=0, ~#b1~0!base=19, ~#b1~0!offset=0, ~#b2~0!base=20, ~#b2~0!offset=0, ~#D1~0!base=21, ~#D1~0!offset=0, ~#D2~0!base=25, ~#D2~0!offset=0, ~#P~0!base=28, ~#P~0!offset=0, ~#X~0!base=27, ~#X~0!offset=0] [L8] assert false; VAL [#NULL!base=0, #NULL!offset=0, __VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, iir4_#in~x!base=27, iir4_#in~x!offset=0, iir4_#in~y!base=28, iir4_#in~y!offset=0, iir4_~t1~0=33.0, iir4_~t2~0=14.0, iir4_~x!base=27, iir4_~x!offset=0, iir4_~y!base=28, iir4_~y!offset=0, main_#t~mem25=25.0, main_#t~mem26=43.0, main_#t~short27=false, ~#A1~0!base=23, ~#A1~0!offset=0, ~#A2~0!base=22, ~#A2~0!offset=0, ~#b1~0!base=19, ~#b1~0!offset=0, ~#b2~0!base=20, ~#b2~0!offset=0, ~#D1~0!base=21, ~#D1~0!offset=0, ~#D2~0!base=25, ~#D2~0!offset=0, ~#P~0!base=28, ~#P~0!offset=0, ~#X~0!base=27, ~#X~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L11] FCALL call ~#A1~0 := #Ultimate.alloc(24); [L11] FCALL call write~init~real(~convertINTToDOUBLE(1), { base: ~#A1~0!base, offset: ~#A1~0!offset }, 8); [L11] FCALL call write~init~real(0.5179422053046, { base: ~#A1~0!base, offset: 8 + ~#A1~0!offset }, 8); [L11] FCALL call write~init~real(1.0, { base: ~#A1~0!base, offset: 16 + ~#A1~0!offset }, 8); [L12] FCALL call ~#b1~0 := #Ultimate.alloc(16); [L12] FCALL call write~init~real(1.470767736573, { base: ~#b1~0!base, offset: ~#b1~0!offset }, 8); [L12] FCALL call write~init~real(0.5522073405779, { base: ~#b1~0!base, offset: 8 + ~#b1~0!offset }, 8); [L13] FCALL call ~#A2~0 := #Ultimate.alloc(24); [L13] FCALL call write~init~real(~convertINTToDOUBLE(1), { base: ~#A2~0!base, offset: ~#A2~0!offset }, 8); [L13] FCALL call write~init~real(1.633101801841, { base: ~#A2~0!base, offset: 8 + ~#A2~0!offset }, 8); [L13] FCALL call write~init~real(1.0, { base: ~#A2~0!base, offset: 16 + ~#A2~0!offset }, 8); [L14] FCALL call ~#b2~0 := #Ultimate.alloc(16); [L14] FCALL call write~init~real(1.74231955483, { base: ~#b2~0!base, offset: ~#b2~0!offset }, 8); [L14] FCALL call write~init~real(0.820939679242, { base: ~#b2~0!base, offset: 8 + ~#b2~0!offset }, 8); [L16] FCALL call ~#D1~0 := #Ultimate.alloc(16); [L16] FCALL call write~init~real(0.0, { base: ~#D1~0!base, offset: ~#D1~0!offset }, 8); [L16] FCALL call write~init~real(0.0, { base: ~#D1~0!base, offset: 8 + ~#D1~0!offset }, 8); [L16] FCALL call ~#D2~0 := #Ultimate.alloc(16); [L16] FCALL call write~init~real(0.0, { base: ~#D2~0!base, offset: ~#D2~0!offset }, 8); [L16] FCALL call write~init~real(0.0, { base: ~#D2~0!base, offset: 8 + ~#D2~0!offset }, 8); [L17] FCALL call ~#P~0 := #Ultimate.alloc(8); [L17] FCALL call write~init~real(0.0, ~#P~0, 8); [L17] FCALL call ~#X~0 := #Ultimate.alloc(8); [L17] FCALL call write~init~real(0.0, ~#X~0, 8); [?] havoc main_#res; [?] havoc main_#t~nondet21, main_#t~mem22, main_#t~mem23, main_#t~short24, main_#t~mem25, main_#t~mem26, main_#t~short27; [L38] FCALL call write~real(0.0, { base: ~#D1~0!base, offset: ~#D1~0!offset }, 8); [L38] FCALL call write~real(0.0, { base: ~#D1~0!base, offset: 8 + ~#D1~0!offset }, 8); [L39] FCALL call write~real(0.0, { base: ~#D2~0!base, offset: ~#D2~0!offset }, 8); [L39] FCALL call write~real(0.0, { base: ~#D2~0!base, offset: 8 + ~#D2~0!offset }, 8); [L40] FCALL call write~real(0.0, ~#P~0, 8); VAL [#NULL!base=0, #NULL!offset=0, ~#A1~0!base=23, ~#A1~0!offset=0, ~#A2~0!base=22, ~#A2~0!offset=0, ~#b1~0!base=19, ~#b1~0!offset=0, ~#b2~0!base=20, ~#b2~0!offset=0, ~#D1~0!base=21, ~#D1~0!offset=0, ~#D2~0!base=25, ~#D2~0!offset=0, ~#P~0!base=28, ~#P~0!offset=0, ~#X~0!base=27, ~#X~0!offset=0] [L42-L50] COND FALSE !(false) [L44] FCALL call write~real(main_#t~nondet21, ~#X~0, 8); [L44] havoc main_#t~nondet21; [L45] FCALL call main_#t~mem22 := read~real(~#X~0, 8); [L45] main_#t~short24 := ~someBinaryDOUBLEComparisonOperation(main_#t~mem22, ~someUnaryDOUBLEoperation(10.0)); [L45] COND TRUE main_#t~short24 [L45] FCALL call main_#t~mem23 := read~real(~#X~0, 8); [L45] main_#t~short24 := ~someBinaryDOUBLEComparisonOperation(main_#t~mem23, 10.0); [L45] assume 0 != (if main_#t~short24 then 1 else 0); [L45] havoc main_#t~mem23; [L45] havoc main_#t~short24; [L45] havoc main_#t~mem22; [L47] iir4_#in~x, iir4_#in~y := ~#X~0, ~#P~0; [L47] havoc iir4_#t~mem0, iir4_#t~mem1, iir4_#t~mem2, iir4_#t~mem3, iir4_#t~mem4, iir4_#t~mem5, iir4_#t~mem6, iir4_#t~mem7, iir4_#t~mem8, iir4_#t~mem9, iir4_#t~mem10, iir4_#t~mem11, iir4_#t~mem12, iir4_#t~mem13, iir4_#t~mem14, iir4_#t~mem15, iir4_#t~mem16, iir4_#t~mem17, iir4_#t~mem18, iir4_#t~mem19, iir4_#t~mem20, iir4_~x, iir4_~y, iir4_~x1~0, iir4_~y1~0, iir4_~t1~0, iir4_~t2~0; [L19-L34] iir4_~x := iir4_#in~x; [L19-L34] iir4_~y := iir4_#in~y; [L21] havoc iir4_~x1~0; [L21] havoc iir4_~y1~0; [L21] havoc iir4_~t1~0; [L21] havoc iir4_~t2~0; [L23] FCALL call iir4_#t~mem0 := read~real(iir4_~x, 8); [L23] iir4_~x1~0 := ~someBinaryArithmeticDOUBLEoperation(0.0117749388721091, iir4_#t~mem0); [L23] havoc iir4_#t~mem0; [L25] FCALL call iir4_#t~mem1 := read~real({ base: ~#b1~0!base, offset: ~#b1~0!offset }, 8); [L25] FCALL call iir4_#t~mem2 := read~real({ base: ~#D1~0!base, offset: ~#D1~0!offset }, 8); [L25] FCALL call iir4_#t~mem3 := read~real({ base: ~#b1~0!base, offset: 8 + ~#b1~0!offset }, 8); [L25] FCALL call iir4_#t~mem4 := read~real({ base: ~#D1~0!base, offset: 8 + ~#D1~0!offset }, 8); [L25] iir4_~t1~0 := ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(iir4_~x1~0, ~someBinaryArithmeticDOUBLEoperation(iir4_#t~mem1, iir4_#t~mem2)), ~someBinaryArithmeticDOUBLEoperation(iir4_#t~mem3, iir4_#t~mem4)); [L25] havoc iir4_#t~mem4; [L25] havoc iir4_#t~mem3; [L25] havoc iir4_#t~mem2; [L25] havoc iir4_#t~mem1; [L26] FCALL call iir4_#t~mem5 := read~real({ base: ~#A1~0!base, offset: ~#A1~0!offset }, 8); [L26] FCALL call iir4_#t~mem6 := read~real({ base: ~#A1~0!base, offset: 8 + ~#A1~0!offset }, 8); [L26] FCALL call iir4_#t~mem7 := read~real({ base: ~#D1~0!base, offset: ~#D1~0!offset }, 8); [L26] FCALL call iir4_#t~mem8 := read~real({ base: ~#A1~0!base, offset: 16 + ~#A1~0!offset }, 8); [L26] FCALL call iir4_#t~mem9 := read~real({ base: ~#D1~0!base, offset: 8 + ~#D1~0!offset }, 8); [L26] iir4_~y1~0 := ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(iir4_#t~mem5, iir4_~t1~0), ~someBinaryArithmeticDOUBLEoperation(iir4_#t~mem6, iir4_#t~mem7)), ~someBinaryArithmeticDOUBLEoperation(iir4_#t~mem8, iir4_#t~mem9)); [L26] havoc iir4_#t~mem8; [L26] havoc iir4_#t~mem5; [L26] havoc iir4_#t~mem6; [L26] havoc iir4_#t~mem7; [L26] havoc iir4_#t~mem9; [L27] FCALL call iir4_#t~mem10 := read~real({ base: ~#D1~0!base, offset: ~#D1~0!offset }, 8); [L27] FCALL call write~real(iir4_#t~mem10, { base: ~#D1~0!base, offset: 8 + ~#D1~0!offset }, 8); [L27] havoc iir4_#t~mem10; [L28] FCALL call write~real(iir4_~t1~0, { base: ~#D1~0!base, offset: ~#D1~0!offset }, 8); [L30] FCALL call iir4_#t~mem11 := read~real({ base: ~#b2~0!base, offset: ~#b2~0!offset }, 8); [L30] FCALL call iir4_#t~mem12 := read~real({ base: ~#D2~0!base, offset: ~#D2~0!offset }, 8); [L30] FCALL call iir4_#t~mem13 := read~real({ base: ~#b2~0!base, offset: 8 + ~#b2~0!offset }, 8); [L30] FCALL call iir4_#t~mem14 := read~real({ base: ~#D2~0!base, offset: 8 + ~#D2~0!offset }, 8); [L30] iir4_~t2~0 := ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(iir4_~y1~0, ~someBinaryArithmeticDOUBLEoperation(iir4_#t~mem11, iir4_#t~mem12)), ~someBinaryArithmeticDOUBLEoperation(iir4_#t~mem13, iir4_#t~mem14)); [L30] havoc iir4_#t~mem13; [L30] havoc iir4_#t~mem12; [L30] havoc iir4_#t~mem14; [L30] havoc iir4_#t~mem11; [L31] FCALL call iir4_#t~mem15 := read~real({ base: ~#A2~0!base, offset: ~#A2~0!offset }, 8); [L31] FCALL call iir4_#t~mem16 := read~real({ base: ~#A2~0!base, offset: 8 + ~#A2~0!offset }, 8); [L31] FCALL call iir4_#t~mem17 := read~real({ base: ~#D2~0!base, offset: ~#D2~0!offset }, 8); [L31] FCALL call iir4_#t~mem18 := read~real({ base: ~#A2~0!base, offset: 16 + ~#A2~0!offset }, 8); [L31] FCALL call iir4_#t~mem19 := read~real({ base: ~#D2~0!base, offset: 8 + ~#D2~0!offset }, 8); [L31] FCALL call write~real(~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(iir4_#t~mem15, iir4_~t2~0), ~someBinaryArithmeticDOUBLEoperation(iir4_#t~mem16, iir4_#t~mem17)), ~someBinaryArithmeticDOUBLEoperation(iir4_#t~mem18, iir4_#t~mem19)), iir4_~y, 8); [L31] havoc iir4_#t~mem15; [L31] havoc iir4_#t~mem18; [L31] havoc iir4_#t~mem17; [L31] havoc iir4_#t~mem16; [L31] havoc iir4_#t~mem19; [L32] FCALL call iir4_#t~mem20 := read~real({ base: ~#D2~0!base, offset: ~#D2~0!offset }, 8); [L32] FCALL call write~real(iir4_#t~mem20, { base: ~#D2~0!base, offset: 8 + ~#D2~0!offset }, 8); [L32] havoc iir4_#t~mem20; [L33] FCALL call write~real(iir4_~t2~0, { base: ~#D2~0!base, offset: ~#D2~0!offset }, 8); [L49] FCALL call main_#t~mem25 := read~real(~#P~0, 8); [L49] main_#t~short27 := ~someBinaryDOUBLEComparisonOperation(main_#t~mem25, ~someUnaryDOUBLEoperation(1.0E30)); [L49] COND FALSE !(main_#t~short27) [L49] __VERIFIER_assert_#in~cond := (if main_#t~short27 then 1 else 0); [L49] havoc __VERIFIER_assert_~cond; [L8] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [#NULL!base=0, #NULL!offset=0, __VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, iir4_#in~x!base=27, iir4_#in~x!offset=0, iir4_#in~y!base=28, iir4_#in~y!offset=0, iir4_~t1~0=33.0, iir4_~t2~0=14.0, iir4_~x!base=27, iir4_~x!offset=0, iir4_~y!base=28, iir4_~y!offset=0, main_#t~mem25=25.0, main_#t~mem26=43.0, main_#t~short27=false, ~#A1~0!base=23, ~#A1~0!offset=0, ~#A2~0!base=22, ~#A2~0!offset=0, ~#b1~0!base=19, ~#b1~0!offset=0, ~#b2~0!base=20, ~#b2~0!offset=0, ~#D1~0!base=21, ~#D1~0!offset=0, ~#D2~0!base=25, ~#D2~0!offset=0, ~#P~0!base=28, ~#P~0!offset=0, ~#X~0!base=27, ~#X~0!offset=0] [L8] COND TRUE 0 == __VERIFIER_assert_~cond VAL [#NULL!base=0, #NULL!offset=0, __VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, iir4_#in~x!base=27, iir4_#in~x!offset=0, iir4_#in~y!base=28, iir4_#in~y!offset=0, iir4_~t1~0=33.0, iir4_~t2~0=14.0, iir4_~x!base=27, iir4_~x!offset=0, iir4_~y!base=28, iir4_~y!offset=0, main_#t~mem25=25.0, main_#t~mem26=43.0, main_#t~short27=false, ~#A1~0!base=23, ~#A1~0!offset=0, ~#A2~0!base=22, ~#A2~0!offset=0, ~#b1~0!base=19, ~#b1~0!offset=0, ~#b2~0!base=20, ~#b2~0!offset=0, ~#D1~0!base=21, ~#D1~0!offset=0, ~#D2~0!base=25, ~#D2~0!offset=0, ~#P~0!base=28, ~#P~0!offset=0, ~#X~0!base=27, ~#X~0!offset=0] [L8] assert false; VAL [#NULL!base=0, #NULL!offset=0, __VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, iir4_#in~x!base=27, iir4_#in~x!offset=0, iir4_#in~y!base=28, iir4_#in~y!offset=0, iir4_~t1~0=33.0, iir4_~t2~0=14.0, iir4_~x!base=27, iir4_~x!offset=0, iir4_~y!base=28, iir4_~y!offset=0, main_#t~mem25=25.0, main_#t~mem26=43.0, main_#t~short27=false, ~#A1~0!base=23, ~#A1~0!offset=0, ~#A2~0!base=22, ~#A2~0!offset=0, ~#b1~0!base=19, ~#b1~0!offset=0, ~#b2~0!base=20, ~#b2~0!offset=0, ~#D1~0!base=21, ~#D1~0!offset=0, ~#D2~0!base=25, ~#D2~0!offset=0, ~#P~0!base=28, ~#P~0!offset=0, ~#X~0!base=27, ~#X~0!offset=0] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L11] FCALL call ~#A1~0 := #Ultimate.alloc(24); [L11] FCALL call write~init~real(~convertINTToDOUBLE(1), { base: ~#A1~0!base, offset: ~#A1~0!offset }, 8); [L11] FCALL call write~init~real(0.5179422053046, { base: ~#A1~0!base, offset: 8 + ~#A1~0!offset }, 8); [L11] FCALL call write~init~real(1.0, { base: ~#A1~0!base, offset: 16 + ~#A1~0!offset }, 8); [L12] FCALL call ~#b1~0 := #Ultimate.alloc(16); [L12] FCALL call write~init~real(1.470767736573, { base: ~#b1~0!base, offset: ~#b1~0!offset }, 8); [L12] FCALL call write~init~real(0.5522073405779, { base: ~#b1~0!base, offset: 8 + ~#b1~0!offset }, 8); [L13] FCALL call ~#A2~0 := #Ultimate.alloc(24); [L13] FCALL call write~init~real(~convertINTToDOUBLE(1), { base: ~#A2~0!base, offset: ~#A2~0!offset }, 8); [L13] FCALL call write~init~real(1.633101801841, { base: ~#A2~0!base, offset: 8 + ~#A2~0!offset }, 8); [L13] FCALL call write~init~real(1.0, { base: ~#A2~0!base, offset: 16 + ~#A2~0!offset }, 8); [L14] FCALL call ~#b2~0 := #Ultimate.alloc(16); [L14] FCALL call write~init~real(1.74231955483, { base: ~#b2~0!base, offset: ~#b2~0!offset }, 8); [L14] FCALL call write~init~real(0.820939679242, { base: ~#b2~0!base, offset: 8 + ~#b2~0!offset }, 8); [L16] FCALL call ~#D1~0 := #Ultimate.alloc(16); [L16] FCALL call write~init~real(0.0, { base: ~#D1~0!base, offset: ~#D1~0!offset }, 8); [L16] FCALL call write~init~real(0.0, { base: ~#D1~0!base, offset: 8 + ~#D1~0!offset }, 8); [L16] FCALL call ~#D2~0 := #Ultimate.alloc(16); [L16] FCALL call write~init~real(0.0, { base: ~#D2~0!base, offset: ~#D2~0!offset }, 8); [L16] FCALL call write~init~real(0.0, { base: ~#D2~0!base, offset: 8 + ~#D2~0!offset }, 8); [L17] FCALL call ~#P~0 := #Ultimate.alloc(8); [L17] FCALL call write~init~real(0.0, ~#P~0, 8); [L17] FCALL call ~#X~0 := #Ultimate.alloc(8); [L17] FCALL call write~init~real(0.0, ~#X~0, 8); [L38] FCALL call write~real(0.0, { base: ~#D1~0!base, offset: ~#D1~0!offset }, 8); [L38] FCALL call write~real(0.0, { base: ~#D1~0!base, offset: 8 + ~#D1~0!offset }, 8); [L39] FCALL call write~real(0.0, { base: ~#D2~0!base, offset: ~#D2~0!offset }, 8); [L39] FCALL call write~real(0.0, { base: ~#D2~0!base, offset: 8 + ~#D2~0!offset }, 8); [L40] FCALL call write~real(0.0, ~#P~0, 8); VAL [#NULL!base=0, #NULL!offset=0, ~#A1~0!base=23, ~#A1~0!offset=0, ~#A2~0!base=22, ~#A2~0!offset=0, ~#b1~0!base=19, ~#b1~0!offset=0, ~#b2~0!base=20, ~#b2~0!offset=0, ~#D1~0!base=21, ~#D1~0!offset=0, ~#D2~0!base=25, ~#D2~0!offset=0, ~#P~0!base=28, ~#P~0!offset=0, ~#X~0!base=27, ~#X~0!offset=0] [L42-L50] COND FALSE !(false) [L44] FCALL call write~real(#t~nondet21, ~#X~0, 8); [L44] havoc #t~nondet21; [L45] FCALL call #t~mem22 := read~real(~#X~0, 8); [L45] #t~short24 := ~someBinaryDOUBLEComparisonOperation(#t~mem22, ~someUnaryDOUBLEoperation(10.0)); [L45] COND TRUE #t~short24 [L45] FCALL call #t~mem23 := read~real(~#X~0, 8); [L45] #t~short24 := ~someBinaryDOUBLEComparisonOperation(#t~mem23, 10.0); [L45] assume 0 != (if #t~short24 then 1 else 0); [L45] havoc #t~mem23; [L45] havoc #t~short24; [L45] havoc #t~mem22; [L19-L34] ~x := #in~x; [L19-L34] ~y := #in~y; [L21] havoc ~x1~0; [L21] havoc ~y1~0; [L21] havoc ~t1~0; [L21] havoc ~t2~0; [L23] FCALL call #t~mem0 := read~real(~x, 8); [L23] ~x1~0 := ~someBinaryArithmeticDOUBLEoperation(0.0117749388721091, #t~mem0); [L23] havoc #t~mem0; [L25] FCALL call #t~mem1 := read~real({ base: ~#b1~0!base, offset: ~#b1~0!offset }, 8); [L25] FCALL call #t~mem2 := read~real({ base: ~#D1~0!base, offset: ~#D1~0!offset }, 8); [L25] FCALL call #t~mem3 := read~real({ base: ~#b1~0!base, offset: 8 + ~#b1~0!offset }, 8); [L25] FCALL call #t~mem4 := read~real({ base: ~#D1~0!base, offset: 8 + ~#D1~0!offset }, 8); [L25] ~t1~0 := ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~x1~0, ~someBinaryArithmeticDOUBLEoperation(#t~mem1, #t~mem2)), ~someBinaryArithmeticDOUBLEoperation(#t~mem3, #t~mem4)); [L25] havoc #t~mem4; [L25] havoc #t~mem3; [L25] havoc #t~mem2; [L25] havoc #t~mem1; [L26] FCALL call #t~mem5 := read~real({ base: ~#A1~0!base, offset: ~#A1~0!offset }, 8); [L26] FCALL call #t~mem6 := read~real({ base: ~#A1~0!base, offset: 8 + ~#A1~0!offset }, 8); [L26] FCALL call #t~mem7 := read~real({ base: ~#D1~0!base, offset: ~#D1~0!offset }, 8); [L26] FCALL call #t~mem8 := read~real({ base: ~#A1~0!base, offset: 16 + ~#A1~0!offset }, 8); [L26] FCALL call #t~mem9 := read~real({ base: ~#D1~0!base, offset: 8 + ~#D1~0!offset }, 8); [L26] ~y1~0 := ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(#t~mem5, ~t1~0), ~someBinaryArithmeticDOUBLEoperation(#t~mem6, #t~mem7)), ~someBinaryArithmeticDOUBLEoperation(#t~mem8, #t~mem9)); [L26] havoc #t~mem8; [L26] havoc #t~mem5; [L26] havoc #t~mem6; [L26] havoc #t~mem7; [L26] havoc #t~mem9; [L27] FCALL call #t~mem10 := read~real({ base: ~#D1~0!base, offset: ~#D1~0!offset }, 8); [L27] FCALL call write~real(#t~mem10, { base: ~#D1~0!base, offset: 8 + ~#D1~0!offset }, 8); [L27] havoc #t~mem10; [L28] FCALL call write~real(~t1~0, { base: ~#D1~0!base, offset: ~#D1~0!offset }, 8); [L30] FCALL call #t~mem11 := read~real({ base: ~#b2~0!base, offset: ~#b2~0!offset }, 8); [L30] FCALL call #t~mem12 := read~real({ base: ~#D2~0!base, offset: ~#D2~0!offset }, 8); [L30] FCALL call #t~mem13 := read~real({ base: ~#b2~0!base, offset: 8 + ~#b2~0!offset }, 8); [L30] FCALL call #t~mem14 := read~real({ base: ~#D2~0!base, offset: 8 + ~#D2~0!offset }, 8); [L30] ~t2~0 := ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~y1~0, ~someBinaryArithmeticDOUBLEoperation(#t~mem11, #t~mem12)), ~someBinaryArithmeticDOUBLEoperation(#t~mem13, #t~mem14)); [L30] havoc #t~mem13; [L30] havoc #t~mem12; [L30] havoc #t~mem14; [L30] havoc #t~mem11; [L31] FCALL call #t~mem15 := read~real({ base: ~#A2~0!base, offset: ~#A2~0!offset }, 8); [L31] FCALL call #t~mem16 := read~real({ base: ~#A2~0!base, offset: 8 + ~#A2~0!offset }, 8); [L31] FCALL call #t~mem17 := read~real({ base: ~#D2~0!base, offset: ~#D2~0!offset }, 8); [L31] FCALL call #t~mem18 := read~real({ base: ~#A2~0!base, offset: 16 + ~#A2~0!offset }, 8); [L31] FCALL call #t~mem19 := read~real({ base: ~#D2~0!base, offset: 8 + ~#D2~0!offset }, 8); [L31] FCALL call write~real(~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(#t~mem15, ~t2~0), ~someBinaryArithmeticDOUBLEoperation(#t~mem16, #t~mem17)), ~someBinaryArithmeticDOUBLEoperation(#t~mem18, #t~mem19)), ~y, 8); [L31] havoc #t~mem15; [L31] havoc #t~mem18; [L31] havoc #t~mem17; [L31] havoc #t~mem16; [L31] havoc #t~mem19; [L32] FCALL call #t~mem20 := read~real({ base: ~#D2~0!base, offset: ~#D2~0!offset }, 8); [L32] FCALL call write~real(#t~mem20, { base: ~#D2~0!base, offset: 8 + ~#D2~0!offset }, 8); [L32] havoc #t~mem20; [L33] FCALL call write~real(~t2~0, { base: ~#D2~0!base, offset: ~#D2~0!offset }, 8); [L49] FCALL call #t~mem25 := read~real(~#P~0, 8); [L49] #t~short27 := ~someBinaryDOUBLEComparisonOperation(#t~mem25, ~someUnaryDOUBLEoperation(1.0E30)); [L49] COND FALSE !(#t~short27) [L8] ~cond := #in~cond; VAL [#NULL!base=0, #NULL!offset=0, ~#A1~0!base=23, ~#A1~0!offset=0, ~#A2~0!base=22, ~#A2~0!offset=0, ~#b1~0!base=19, ~#b1~0!offset=0, ~#b2~0!base=20, ~#b2~0!offset=0, ~#D1~0!base=21, ~#D1~0!offset=0, ~#D2~0!base=25, ~#D2~0!offset=0, ~#P~0!base=28, ~#P~0!offset=0, ~#X~0!base=27, ~#X~0!offset=0] [L8] COND TRUE 0 == ~cond VAL [#NULL!base=0, #NULL!offset=0, ~#A1~0!base=23, ~#A1~0!offset=0, ~#A2~0!base=22, ~#A2~0!offset=0, ~#b1~0!base=19, ~#b1~0!offset=0, ~#b2~0!base=20, ~#b2~0!offset=0, ~#D1~0!base=21, ~#D1~0!offset=0, ~#D2~0!base=25, ~#D2~0!offset=0, ~#P~0!base=28, ~#P~0!offset=0, ~#X~0!base=27, ~#X~0!offset=0] [L8] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~#A1~0!base=23, ~#A1~0!offset=0, ~#A2~0!base=22, ~#A2~0!offset=0, ~#b1~0!base=19, ~#b1~0!offset=0, ~#b2~0!base=20, ~#b2~0!offset=0, ~#D1~0!base=21, ~#D1~0!offset=0, ~#D2~0!base=25, ~#D2~0!offset=0, ~#P~0!base=28, ~#P~0!offset=0, ~#X~0!base=27, ~#X~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L11] FCALL call ~#A1~0 := #Ultimate.alloc(24); [L11] FCALL call write~init~real(~convertINTToDOUBLE(1), { base: ~#A1~0!base, offset: ~#A1~0!offset }, 8); [L11] FCALL call write~init~real(0.5179422053046, { base: ~#A1~0!base, offset: 8 + ~#A1~0!offset }, 8); [L11] FCALL call write~init~real(1.0, { base: ~#A1~0!base, offset: 16 + ~#A1~0!offset }, 8); [L12] FCALL call ~#b1~0 := #Ultimate.alloc(16); [L12] FCALL call write~init~real(1.470767736573, { base: ~#b1~0!base, offset: ~#b1~0!offset }, 8); [L12] FCALL call write~init~real(0.5522073405779, { base: ~#b1~0!base, offset: 8 + ~#b1~0!offset }, 8); [L13] FCALL call ~#A2~0 := #Ultimate.alloc(24); [L13] FCALL call write~init~real(~convertINTToDOUBLE(1), { base: ~#A2~0!base, offset: ~#A2~0!offset }, 8); [L13] FCALL call write~init~real(1.633101801841, { base: ~#A2~0!base, offset: 8 + ~#A2~0!offset }, 8); [L13] FCALL call write~init~real(1.0, { base: ~#A2~0!base, offset: 16 + ~#A2~0!offset }, 8); [L14] FCALL call ~#b2~0 := #Ultimate.alloc(16); [L14] FCALL call write~init~real(1.74231955483, { base: ~#b2~0!base, offset: ~#b2~0!offset }, 8); [L14] FCALL call write~init~real(0.820939679242, { base: ~#b2~0!base, offset: 8 + ~#b2~0!offset }, 8); [L16] FCALL call ~#D1~0 := #Ultimate.alloc(16); [L16] FCALL call write~init~real(0.0, { base: ~#D1~0!base, offset: ~#D1~0!offset }, 8); [L16] FCALL call write~init~real(0.0, { base: ~#D1~0!base, offset: 8 + ~#D1~0!offset }, 8); [L16] FCALL call ~#D2~0 := #Ultimate.alloc(16); [L16] FCALL call write~init~real(0.0, { base: ~#D2~0!base, offset: ~#D2~0!offset }, 8); [L16] FCALL call write~init~real(0.0, { base: ~#D2~0!base, offset: 8 + ~#D2~0!offset }, 8); [L17] FCALL call ~#P~0 := #Ultimate.alloc(8); [L17] FCALL call write~init~real(0.0, ~#P~0, 8); [L17] FCALL call ~#X~0 := #Ultimate.alloc(8); [L17] FCALL call write~init~real(0.0, ~#X~0, 8); [L38] FCALL call write~real(0.0, { base: ~#D1~0!base, offset: ~#D1~0!offset }, 8); [L38] FCALL call write~real(0.0, { base: ~#D1~0!base, offset: 8 + ~#D1~0!offset }, 8); [L39] FCALL call write~real(0.0, { base: ~#D2~0!base, offset: ~#D2~0!offset }, 8); [L39] FCALL call write~real(0.0, { base: ~#D2~0!base, offset: 8 + ~#D2~0!offset }, 8); [L40] FCALL call write~real(0.0, ~#P~0, 8); VAL [#NULL!base=0, #NULL!offset=0, ~#A1~0!base=23, ~#A1~0!offset=0, ~#A2~0!base=22, ~#A2~0!offset=0, ~#b1~0!base=19, ~#b1~0!offset=0, ~#b2~0!base=20, ~#b2~0!offset=0, ~#D1~0!base=21, ~#D1~0!offset=0, ~#D2~0!base=25, ~#D2~0!offset=0, ~#P~0!base=28, ~#P~0!offset=0, ~#X~0!base=27, ~#X~0!offset=0] [L42-L50] COND FALSE !(false) [L44] FCALL call write~real(#t~nondet21, ~#X~0, 8); [L44] havoc #t~nondet21; [L45] FCALL call #t~mem22 := read~real(~#X~0, 8); [L45] #t~short24 := ~someBinaryDOUBLEComparisonOperation(#t~mem22, ~someUnaryDOUBLEoperation(10.0)); [L45] COND TRUE #t~short24 [L45] FCALL call #t~mem23 := read~real(~#X~0, 8); [L45] #t~short24 := ~someBinaryDOUBLEComparisonOperation(#t~mem23, 10.0); [L45] assume 0 != (if #t~short24 then 1 else 0); [L45] havoc #t~mem23; [L45] havoc #t~short24; [L45] havoc #t~mem22; [L19-L34] ~x := #in~x; [L19-L34] ~y := #in~y; [L21] havoc ~x1~0; [L21] havoc ~y1~0; [L21] havoc ~t1~0; [L21] havoc ~t2~0; [L23] FCALL call #t~mem0 := read~real(~x, 8); [L23] ~x1~0 := ~someBinaryArithmeticDOUBLEoperation(0.0117749388721091, #t~mem0); [L23] havoc #t~mem0; [L25] FCALL call #t~mem1 := read~real({ base: ~#b1~0!base, offset: ~#b1~0!offset }, 8); [L25] FCALL call #t~mem2 := read~real({ base: ~#D1~0!base, offset: ~#D1~0!offset }, 8); [L25] FCALL call #t~mem3 := read~real({ base: ~#b1~0!base, offset: 8 + ~#b1~0!offset }, 8); [L25] FCALL call #t~mem4 := read~real({ base: ~#D1~0!base, offset: 8 + ~#D1~0!offset }, 8); [L25] ~t1~0 := ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~x1~0, ~someBinaryArithmeticDOUBLEoperation(#t~mem1, #t~mem2)), ~someBinaryArithmeticDOUBLEoperation(#t~mem3, #t~mem4)); [L25] havoc #t~mem4; [L25] havoc #t~mem3; [L25] havoc #t~mem2; [L25] havoc #t~mem1; [L26] FCALL call #t~mem5 := read~real({ base: ~#A1~0!base, offset: ~#A1~0!offset }, 8); [L26] FCALL call #t~mem6 := read~real({ base: ~#A1~0!base, offset: 8 + ~#A1~0!offset }, 8); [L26] FCALL call #t~mem7 := read~real({ base: ~#D1~0!base, offset: ~#D1~0!offset }, 8); [L26] FCALL call #t~mem8 := read~real({ base: ~#A1~0!base, offset: 16 + ~#A1~0!offset }, 8); [L26] FCALL call #t~mem9 := read~real({ base: ~#D1~0!base, offset: 8 + ~#D1~0!offset }, 8); [L26] ~y1~0 := ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(#t~mem5, ~t1~0), ~someBinaryArithmeticDOUBLEoperation(#t~mem6, #t~mem7)), ~someBinaryArithmeticDOUBLEoperation(#t~mem8, #t~mem9)); [L26] havoc #t~mem8; [L26] havoc #t~mem5; [L26] havoc #t~mem6; [L26] havoc #t~mem7; [L26] havoc #t~mem9; [L27] FCALL call #t~mem10 := read~real({ base: ~#D1~0!base, offset: ~#D1~0!offset }, 8); [L27] FCALL call write~real(#t~mem10, { base: ~#D1~0!base, offset: 8 + ~#D1~0!offset }, 8); [L27] havoc #t~mem10; [L28] FCALL call write~real(~t1~0, { base: ~#D1~0!base, offset: ~#D1~0!offset }, 8); [L30] FCALL call #t~mem11 := read~real({ base: ~#b2~0!base, offset: ~#b2~0!offset }, 8); [L30] FCALL call #t~mem12 := read~real({ base: ~#D2~0!base, offset: ~#D2~0!offset }, 8); [L30] FCALL call #t~mem13 := read~real({ base: ~#b2~0!base, offset: 8 + ~#b2~0!offset }, 8); [L30] FCALL call #t~mem14 := read~real({ base: ~#D2~0!base, offset: 8 + ~#D2~0!offset }, 8); [L30] ~t2~0 := ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~y1~0, ~someBinaryArithmeticDOUBLEoperation(#t~mem11, #t~mem12)), ~someBinaryArithmeticDOUBLEoperation(#t~mem13, #t~mem14)); [L30] havoc #t~mem13; [L30] havoc #t~mem12; [L30] havoc #t~mem14; [L30] havoc #t~mem11; [L31] FCALL call #t~mem15 := read~real({ base: ~#A2~0!base, offset: ~#A2~0!offset }, 8); [L31] FCALL call #t~mem16 := read~real({ base: ~#A2~0!base, offset: 8 + ~#A2~0!offset }, 8); [L31] FCALL call #t~mem17 := read~real({ base: ~#D2~0!base, offset: ~#D2~0!offset }, 8); [L31] FCALL call #t~mem18 := read~real({ base: ~#A2~0!base, offset: 16 + ~#A2~0!offset }, 8); [L31] FCALL call #t~mem19 := read~real({ base: ~#D2~0!base, offset: 8 + ~#D2~0!offset }, 8); [L31] FCALL call write~real(~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(#t~mem15, ~t2~0), ~someBinaryArithmeticDOUBLEoperation(#t~mem16, #t~mem17)), ~someBinaryArithmeticDOUBLEoperation(#t~mem18, #t~mem19)), ~y, 8); [L31] havoc #t~mem15; [L31] havoc #t~mem18; [L31] havoc #t~mem17; [L31] havoc #t~mem16; [L31] havoc #t~mem19; [L32] FCALL call #t~mem20 := read~real({ base: ~#D2~0!base, offset: ~#D2~0!offset }, 8); [L32] FCALL call write~real(#t~mem20, { base: ~#D2~0!base, offset: 8 + ~#D2~0!offset }, 8); [L32] havoc #t~mem20; [L33] FCALL call write~real(~t2~0, { base: ~#D2~0!base, offset: ~#D2~0!offset }, 8); [L49] FCALL call #t~mem25 := read~real(~#P~0, 8); [L49] #t~short27 := ~someBinaryDOUBLEComparisonOperation(#t~mem25, ~someUnaryDOUBLEoperation(1.0E30)); [L49] COND FALSE !(#t~short27) [L8] ~cond := #in~cond; VAL [#NULL!base=0, #NULL!offset=0, ~#A1~0!base=23, ~#A1~0!offset=0, ~#A2~0!base=22, ~#A2~0!offset=0, ~#b1~0!base=19, ~#b1~0!offset=0, ~#b2~0!base=20, ~#b2~0!offset=0, ~#D1~0!base=21, ~#D1~0!offset=0, ~#D2~0!base=25, ~#D2~0!offset=0, ~#P~0!base=28, ~#P~0!offset=0, ~#X~0!base=27, ~#X~0!offset=0] [L8] COND TRUE 0 == ~cond VAL [#NULL!base=0, #NULL!offset=0, ~#A1~0!base=23, ~#A1~0!offset=0, ~#A2~0!base=22, ~#A2~0!offset=0, ~#b1~0!base=19, ~#b1~0!offset=0, ~#b2~0!base=20, ~#b2~0!offset=0, ~#D1~0!base=21, ~#D1~0!offset=0, ~#D2~0!base=25, ~#D2~0!offset=0, ~#P~0!base=28, ~#P~0!offset=0, ~#X~0!base=27, ~#X~0!offset=0] [L8] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~#A1~0!base=23, ~#A1~0!offset=0, ~#A2~0!base=22, ~#A2~0!offset=0, ~#b1~0!base=19, ~#b1~0!offset=0, ~#b2~0!base=20, ~#b2~0!offset=0, ~#D1~0!base=21, ~#D1~0!offset=0, ~#D2~0!base=25, ~#D2~0!offset=0, ~#P~0!base=28, ~#P~0!offset=0, ~#X~0!base=27, ~#X~0!offset=0] [L11] double A1[3] = { 1, 0.5179422053046, 1.0 }; [L12] double b1[2] = { 1.470767736573, 0.5522073405779 }; [L13] double A2[3] = { 1, 1.633101801841, 1.0 }; [L14] double b2[2] = { 1.742319554830, 0.820939679242 }; [L16] double D1[2], D2[2]; [L17] double P, X; [L38] D1[0] = 0. [L38] D1[1] = 0. [L39] D2[0] = 0. [L39] D2[1] = 0. [L40] P = 0. VAL [A1={23:0}, A2={22:0}, b1={19:0}, b2={20:0}, D1={21:0}, D2={25:0}, P={28:0}, X={27:0}] [L42] COND TRUE 1 [L44] X = __VERIFIER_nondet_double() [L45] EXPR \read(X) [L45] X >= -10. && X <= 10. [L45] EXPR \read(X) [L45] X >= -10. && X <= 10. [L21] double x1, y1, t1, t2; [L23] EXPR \read(*x) [L23] x1 = 0.0117749388721091 * *x [L25] EXPR b1[0] [L25] EXPR D1[0] [L25] EXPR b1[1] [L25] EXPR D1[1] [L25] t1 = x1 + b1[0]*D1[0] - b1[1]*D1[1] [L26] EXPR A1[0] [L26] EXPR A1[1] [L26] EXPR D1[0] [L26] EXPR A1[2] [L26] EXPR D1[1] [L26] y1 = A1[0]*t1 - A1[1]*D1[0] + A1[2]*D1[1] [L27] EXPR D1[0] [L27] D1[1] = D1[0] [L28] D1[0] = t1 [L30] EXPR b2[0] [L30] EXPR D2[0] [L30] EXPR b2[1] [L30] EXPR D2[1] [L30] t2 = y1 + b2[0]*D2[0] - b2[1]*D2[1] [L31] EXPR A2[0] [L31] EXPR A2[1] [L31] EXPR D2[0] [L31] EXPR A2[2] [L31] EXPR D2[1] [L31] *y = A2[0]*t2 - A2[1]*D2[0] + A2[2]*D2[1] [L32] EXPR D2[0] [L32] D2[1] = D2[0] [L33] D2[0] = t2 [L49] EXPR \read(P) [L49] P >= -1e30 && P <= 1e30 [L8] COND TRUE !(cond) VAL [A1={23:0}, A2={22:0}, b1={19:0}, b2={20:0}, D1={21:0}, D2={25:0}, P={28:0}, X={27:0}] [L8] __VERIFIER_error() VAL [A1={23:0}, A2={22:0}, b1={19:0}, b2={20:0}, D1={21:0}, D2={25:0}, P={28:0}, X={27:0}] ----- [2018-11-23 03:23:18,869 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 23.11 03:23:18 ImpRootNode [2018-11-23 03:23:18,869 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-11-23 03:23:18,870 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 03:23:18,870 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 03:23:18,870 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 03:23:18,871 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:23:18" (3/4) ... [2018-11-23 03:23:18,879 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 03:23:18,879 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 03:23:18,880 INFO L168 Benchmark]: Toolchain (without parser) took 1010.53 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 162.5 MB). Free memory was 953.8 MB in the beginning and 1.1 GB in the end (delta: -128.8 MB). Peak memory consumption was 33.7 MB. Max. memory is 11.5 GB. [2018-11-23 03:23:18,882 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 03:23:18,883 INFO L168 Benchmark]: CACSL2BoogieTranslator took 184.77 ms. Allocated memory is still 1.0 GB. Free memory was 953.8 MB in the beginning and 940.3 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-11-23 03:23:18,885 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 162.5 MB). Free memory was 940.3 MB in the beginning and 1.2 GB in the end (delta: -220.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. [2018-11-23 03:23:18,886 INFO L168 Benchmark]: Boogie Preprocessor took 23.67 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-11-23 03:23:18,886 INFO L168 Benchmark]: RCFGBuilder took 367.45 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: 45.3 MB). Peak memory consumption was 45.3 MB. Max. memory is 11.5 GB. [2018-11-23 03:23:18,887 INFO L168 Benchmark]: CodeCheck took 355.58 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: 29.7 MB). Peak memory consumption was 29.7 MB. Max. memory is 11.5 GB. [2018-11-23 03:23:18,887 INFO L168 Benchmark]: Witness Printer took 9.22 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 03:23:18,891 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 1 procedures, 16 locations, 1 error locations. UNSAFE Result, 0.2s OverallTime, 1 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 4 NumberOfCodeBlocks, 4 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, 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: No data available, ReuseStatistics: No data available - UnprovableResult [Line: 8]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 45, overapproximation of to_real at line 11, overapproximation of someBinaryArithmeticDOUBLEoperation at line 23. Possible FailurePath: [L11] double A1[3] = { 1, 0.5179422053046, 1.0 }; [L12] double b1[2] = { 1.470767736573, 0.5522073405779 }; [L13] double A2[3] = { 1, 1.633101801841, 1.0 }; [L14] double b2[2] = { 1.742319554830, 0.820939679242 }; [L16] double D1[2], D2[2]; [L17] double P, X; [L38] D1[0] = 0. [L38] D1[1] = 0. [L39] D2[0] = 0. [L39] D2[1] = 0. [L40] P = 0. VAL [A1={23:0}, A2={22:0}, b1={19:0}, b2={20:0}, D1={21:0}, D2={25:0}, P={28:0}, X={27:0}] [L42] COND TRUE 1 [L44] X = __VERIFIER_nondet_double() [L45] EXPR \read(X) [L45] X >= -10. && X <= 10. [L45] EXPR \read(X) [L45] X >= -10. && X <= 10. [L21] double x1, y1, t1, t2; [L23] EXPR \read(*x) [L23] x1 = 0.0117749388721091 * *x [L25] EXPR b1[0] [L25] EXPR D1[0] [L25] EXPR b1[1] [L25] EXPR D1[1] [L25] t1 = x1 + b1[0]*D1[0] - b1[1]*D1[1] [L26] EXPR A1[0] [L26] EXPR A1[1] [L26] EXPR D1[0] [L26] EXPR A1[2] [L26] EXPR D1[1] [L26] y1 = A1[0]*t1 - A1[1]*D1[0] + A1[2]*D1[1] [L27] EXPR D1[0] [L27] D1[1] = D1[0] [L28] D1[0] = t1 [L30] EXPR b2[0] [L30] EXPR D2[0] [L30] EXPR b2[1] [L30] EXPR D2[1] [L30] t2 = y1 + b2[0]*D2[0] - b2[1]*D2[1] [L31] EXPR A2[0] [L31] EXPR A2[1] [L31] EXPR D2[0] [L31] EXPR A2[2] [L31] EXPR D2[1] [L31] *y = A2[0]*t2 - A2[1]*D2[0] + A2[2]*D2[1] [L32] EXPR D2[0] [L32] D2[1] = D2[0] [L33] D2[0] = t2 [L49] EXPR \read(P) [L49] P >= -1e30 && P <= 1e30 [L8] COND TRUE !(cond) VAL [A1={23:0}, A2={22:0}, b1={19:0}, b2={20:0}, D1={21:0}, D2={25:0}, P={28:0}, X={27:0}] [L8] __VERIFIER_error() VAL [A1={23:0}, A2={22:0}, b1={19:0}, b2={20:0}, D1={21:0}, D2={25:0}, P={28:0}, X={27:0}] * 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 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 184.77 ms. Allocated memory is still 1.0 GB. Free memory was 953.8 MB in the beginning and 940.3 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 66.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 162.5 MB). Free memory was 940.3 MB in the beginning and 1.2 GB in the end (delta: -220.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.67 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 367.45 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: 45.3 MB). Peak memory consumption was 45.3 MB. Max. memory is 11.5 GB. * CodeCheck took 355.58 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: 29.7 MB). Peak memory consumption was 29.7 MB. Max. memory is 11.5 GB. * Witness Printer took 9.22 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. 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 03:23:20,359 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 03:23:20,360 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 03:23:20,369 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 03:23:20,369 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 03:23:20,370 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 03:23:20,371 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 03:23:20,372 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 03:23:20,373 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 03:23:20,373 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 03:23:20,374 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 03:23:20,374 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 03:23:20,375 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 03:23:20,376 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 03:23:20,376 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 03:23:20,377 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 03:23:20,378 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 03:23:20,379 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 03:23:20,380 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 03:23:20,381 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 03:23:20,382 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 03:23:20,383 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 03:23:20,384 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 03:23:20,385 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 03:23:20,385 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 03:23:20,385 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 03:23:20,386 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 03:23:20,387 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 03:23:20,387 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 03:23:20,388 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 03:23:20,388 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 03:23:20,388 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 03:23:20,389 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 03:23:20,389 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 03:23:20,389 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 03:23:20,390 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 03:23:20,390 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_4af422bf-c203-4a3a-9375-c9715ccab05e/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Bitvector.epf [2018-11-23 03:23:20,400 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 03:23:20,401 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 03:23:20,401 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 03:23:20,401 INFO L133 SettingsManager]: * ... to procedures called more than once=ALWAYS [2018-11-23 03:23:20,402 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 03:23:20,402 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 03:23:20,402 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 03:23:20,402 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 03:23:20,403 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 03:23:20,403 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 03:23:20,403 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 03:23:20,403 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 03:23:20,403 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 03:23:20,403 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 03:23:20,403 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 03:23:20,403 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 03:23:20,404 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 03:23:20,404 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 03:23:20,404 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 03:23:20,404 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-23 03:23:20,404 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-23 03:23:20,404 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 03:23:20,404 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 03:23:20,404 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-23 03:23:20,405 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 03:23:20,405 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 03:23:20,405 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 03:23:20,405 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-11-23 03:23:20,405 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-11-23 03:23:20,405 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 03:23:20,405 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 03:23:20,406 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 03:23:20,406 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_4af422bf-c203-4a3a-9375-c9715ccab05e/bin-2019/ukojak 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 -> Kojak 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 -> 4d8de78cb0edef97ecd7b2050e9bc61ccb30afeb [2018-11-23 03:23:20,435 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 03:23:20,445 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 03:23:20,447 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 03:23:20,448 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 03:23:20,449 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 03:23:20,449 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_4af422bf-c203-4a3a-9375-c9715ccab05e/bin-2019/ukojak/../../sv-benchmarks/c/float-benchs/filter_iir_true-unreach-call.c [2018-11-23 03:23:20,492 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4af422bf-c203-4a3a-9375-c9715ccab05e/bin-2019/ukojak/data/2d6e2f5e1/40bda2f241504faea39617647e6d47c9/FLAG59a07b9e6 [2018-11-23 03:23:20,802 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 03:23:20,803 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_4af422bf-c203-4a3a-9375-c9715ccab05e/sv-benchmarks/c/float-benchs/filter_iir_true-unreach-call.c [2018-11-23 03:23:20,807 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4af422bf-c203-4a3a-9375-c9715ccab05e/bin-2019/ukojak/data/2d6e2f5e1/40bda2f241504faea39617647e6d47c9/FLAG59a07b9e6 [2018-11-23 03:23:20,817 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_4af422bf-c203-4a3a-9375-c9715ccab05e/bin-2019/ukojak/data/2d6e2f5e1/40bda2f241504faea39617647e6d47c9 [2018-11-23 03:23:20,819 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 03:23:20,821 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 03:23:20,821 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 03:23:20,822 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 03:23:20,824 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 03:23:20,824 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:23:20" (1/1) ... [2018-11-23 03:23:20,826 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3bc5cec5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:23:20, skipping insertion in model container [2018-11-23 03:23:20,826 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:23:20" (1/1) ... [2018-11-23 03:23:20,834 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 03:23:20,852 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 03:23:20,987 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 03:23:21,005 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 03:23:21,029 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 03:23:21,047 INFO L195 MainTranslator]: Completed translation [2018-11-23 03:23:21,047 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:23:21 WrapperNode [2018-11-23 03:23:21,048 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 03:23:21,048 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 03:23:21,048 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 03:23:21,048 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 03:23:21,053 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:23:21" (1/1) ... [2018-11-23 03:23:21,061 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:23:21" (1/1) ... [2018-11-23 03:23:21,112 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 03:23:21,113 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 03:23:21,113 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 03:23:21,113 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 03:23:21,118 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:23:21" (1/1) ... [2018-11-23 03:23:21,119 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:23:21" (1/1) ... [2018-11-23 03:23:21,121 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:23:21" (1/1) ... [2018-11-23 03:23:21,121 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:23:21" (1/1) ... [2018-11-23 03:23:21,129 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:23:21" (1/1) ... [2018-11-23 03:23:21,132 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:23:21" (1/1) ... [2018-11-23 03:23:21,133 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:23:21" (1/1) ... [2018-11-23 03:23:21,135 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 03:23:21,135 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 03:23:21,135 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 03:23:21,136 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 03:23:21,136 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:23:21" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4af422bf-c203-4a3a-9375-c9715ccab05e/bin-2019/ukojak/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (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:10000 [2018-11-23 03:23:21,166 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2018-11-23 03:23:21,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8 [2018-11-23 03:23:21,167 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 03:23:21,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2018-11-23 03:23:21,167 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 03:23:21,167 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 03:23:21,370 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 03:23:21,446 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 03:23:21,460 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 03:23:31,821 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 03:24:55,087 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 03:24:55,088 INFO L280 CfgBuilder]: Removed 9 assue(true) statements. [2018-11-23 03:24:55,088 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:24:55 BoogieIcfgContainer [2018-11-23 03:24:55,088 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 03:24:55,089 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-23 03:24:55,089 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-23 03:24:55,096 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-23 03:24:55,096 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:24:55" (1/1) ... [2018-11-23 03:24:55,103 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:24:55,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 03:24:55,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 7 states and 8 transitions. [2018-11-23 03:24:55,128 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2018-11-23 03:24:55,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-11-23 03:24:55,130 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 03:24:55,172 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 03:24:56,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:24:56,366 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:25:01,051 WARN L180 SmtUtils]: Spent 4.64 s on a formula simplification. DAG size of input: 97 DAG size of output: 91 [2018-11-23 03:25:01,136 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 56 treesize of output 55 [2018-11-23 03:25:01,239 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:25:01,241 INFO L303 Elim1Store]: Index analysis took 102 ms [2018-11-23 03:25:01,255 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 2 case distinctions, treesize of input 55 treesize of output 58 [2018-11-23 03:25:01,342 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 51 [2018-11-23 03:25:01,664 INFO L303 Elim1Store]: Index analysis took 320 ms [2018-11-23 03:25:01,665 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 47 [2018-11-23 03:25:02,232 INFO L303 Elim1Store]: Index analysis took 565 ms [2018-11-23 03:25:02,233 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 46 [2018-11-23 03:25:03,246 INFO L303 Elim1Store]: Index analysis took 1010 ms [2018-11-23 03:25:03,247 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 45 [2018-11-23 03:25:03,472 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:25:03,715 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:25:03,958 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:25:04,174 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:25:04,262 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:25:04,602 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:25:04,603 INFO L303 Elim1Store]: Index analysis took 1316 ms [2018-11-23 03:25:04,605 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 74 [2018-11-23 03:25:04,731 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:25:05,541 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:25:05,848 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:25:05,928 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:25:05,982 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:25:06,029 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:25:06,225 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:25:06,431 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:25:07,272 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:25:07,624 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:25:07,937 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:25:08,005 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:25:08,006 INFO L303 Elim1Store]: Index analysis took 3344 ms [2018-11-23 03:25:08,007 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 14 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 53 [2018-11-23 03:25:08,008 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 03:25:08,913 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 03:25:09,700 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 03:25:10,758 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 03:25:11,423 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 03:25:13,340 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 03:25:14,466 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:25:14,737 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:25:14,738 INFO L303 Elim1Store]: Index analysis took 347 ms [2018-11-23 03:25:14,752 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 61 [2018-11-23 03:25:14,893 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:25:15,188 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:25:15,189 INFO L303 Elim1Store]: Index analysis took 434 ms [2018-11-23 03:25:15,199 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 64 [2018-11-23 03:25:15,388 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:25:15,926 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:25:15,927 INFO L303 Elim1Store]: Index analysis took 724 ms [2018-11-23 03:25:15,939 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 67 [2018-11-23 03:25:16,666 INFO L303 Elim1Store]: Index analysis took 722 ms [2018-11-23 03:25:16,667 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 72 [2018-11-23 03:25:16,973 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:25:17,263 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:25:17,472 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:25:18,016 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:25:18,044 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:25:18,915 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:25:18,916 INFO L303 Elim1Store]: Index analysis took 2185 ms [2018-11-23 03:25:18,917 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 86 [2018-11-23 03:25:19,068 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:25:19,093 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:25:19,196 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:25:19,218 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:25:19,263 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:25:19,287 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:25:19,416 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:25:19,598 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:25:20,119 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:25:20,468 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:25:20,724 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:25:20,828 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:25:20,829 INFO L303 Elim1Store]: Index analysis took 1843 ms [2018-11-23 03:25:20,830 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 17 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 65 [2018-11-23 03:25:20,831 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-23 03:25:21,729 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 03:25:23,526 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 03:25:26,599 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:25:26,885 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:25:26,982 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:25:27,255 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:25:27,625 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:25:27,626 INFO L303 Elim1Store]: Index analysis took 1333 ms [2018-11-23 03:25:27,637 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 70 [2018-11-23 03:25:27,742 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 69 [2018-11-23 03:25:28,075 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:25:28,167 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:25:28,373 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:25:28,466 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:25:28,671 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:25:28,809 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:25:29,082 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:25:29,171 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:25:29,290 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:25:29,360 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:25:29,585 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:25:29,586 INFO L303 Elim1Store]: Index analysis took 1841 ms [2018-11-23 03:25:29,616 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 12 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 103 [2018-11-23 03:25:29,776 WARN L180 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 71 [2018-11-23 03:25:29,910 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:25:29,956 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:25:30,081 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:25:30,209 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:25:30,253 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:25:30,336 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:25:30,630 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:25:31,263 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:25:31,792 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:25:32,211 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:25:32,305 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:25:32,351 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:25:32,535 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:25:32,536 INFO L303 Elim1Store]: Index analysis took 2756 ms [2018-11-23 03:25:32,537 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 19 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 96 [2018-11-23 03:25:32,538 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-11-23 03:25:34,881 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:25:35,155 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:25:35,252 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:25:35,502 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:25:35,560 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:25:35,685 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:25:35,839 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:25:35,894 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:25:36,260 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:25:36,693 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:25:36,970 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:25:37,106 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:25:37,401 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:25:37,518 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:25:37,556 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:25:37,587 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:25:38,485 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:25:38,574 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:25:38,759 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:25:38,760 INFO L303 Elim1Store]: Index analysis took 3959 ms [2018-11-23 03:25:38,761 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 9 select indices, 9 select index equivalence classes, 20 disjoint index pairs (out of 36 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 77 [2018-11-23 03:25:38,761 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-23 03:25:43,119 INFO L267 ElimStorePlain]: Start of recursive call 17: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 03:25:46,717 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:25:46,955 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:25:47,204 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:25:47,485 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:25:47,853 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:25:48,061 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:25:48,062 INFO L303 Elim1Store]: Index analysis took 1651 ms [2018-11-23 03:25:48,063 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 90 [2018-11-23 03:25:48,223 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:25:48,404 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:25:48,692 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:25:48,728 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:25:48,763 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:25:48,793 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:25:48,830 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:25:49,000 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:25:49,624 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:25:50,075 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:25:50,124 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:25:50,160 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:25:50,718 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:25:50,719 INFO L303 Elim1Store]: Index analysis took 2592 ms [2018-11-23 03:25:50,720 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 18 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 53 [2018-11-23 03:25:50,721 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-11-23 03:25:51,844 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 03:25:55,614 INFO L267 ElimStorePlain]: Start of recursive call 16: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 03:26:02,112 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 03:26:06,916 INFO L303 Elim1Store]: Index analysis took 425 ms [2018-11-23 03:26:06,917 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 54 [2018-11-23 03:26:08,343 INFO L303 Elim1Store]: Index analysis took 1424 ms [2018-11-23 03:26:08,343 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 45 [2018-11-23 03:26:08,572 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:26:08,928 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:26:09,331 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:26:09,740 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:26:09,779 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:26:10,214 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:26:10,215 INFO L303 Elim1Store]: Index analysis took 1852 ms [2018-11-23 03:26:10,216 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 74 [2018-11-23 03:26:10,395 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:26:10,443 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:26:10,476 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:26:10,504 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:26:10,531 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:26:10,570 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:26:10,798 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:26:11,379 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:26:11,810 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:26:12,293 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:26:12,328 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:26:12,639 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:26:12,640 INFO L303 Elim1Store]: Index analysis took 2375 ms [2018-11-23 03:26:12,641 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 16 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 53 [2018-11-23 03:26:12,641 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-11-23 03:26:13,492 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 03:26:15,171 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 03:26:17,058 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 03:26:20,641 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 03:26:25,108 INFO L303 Elim1Store]: Index analysis took 433 ms [2018-11-23 03:26:25,109 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 51 [2018-11-23 03:26:25,586 INFO L303 Elim1Store]: Index analysis took 476 ms [2018-11-23 03:26:25,587 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 46 [2018-11-23 03:26:26,698 INFO L303 Elim1Store]: Index analysis took 1109 ms [2018-11-23 03:26:26,699 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 45 [2018-11-23 03:26:27,021 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:26:27,832 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:26:28,190 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:26:28,481 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:26:28,511 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:26:28,819 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:26:28,820 INFO L303 Elim1Store]: Index analysis took 2102 ms [2018-11-23 03:26:28,821 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 8 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 74 [2018-11-23 03:26:28,947 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:26:29,849 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:26:29,921 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:26:29,958 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:26:30,088 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:26:30,125 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:26:30,899 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:26:30,900 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 03:26:30,901 INFO L303 Elim1Store]: Index analysis took 2031 ms [2018-11-23 03:26:30,902 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 16 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 53 [2018-11-23 03:26:30,902 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-11-23 03:26:32,295 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 03:26:32,993 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 03:26:34,107 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 03:26:36,436 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 03:26:39,118 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 03:26:42,848 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 03:26:44,811 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 03:26:47,667 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 206 treesize of output 147 [2018-11-23 03:26:49,209 WARN L180 SmtUtils]: Spent 1.54 s on a formula simplification that was a NOOP. DAG size: 56 [2018-11-23 03:26:49,210 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-23 03:26:49,210 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-11-23 03:26:49,229 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 98 treesize of output 88 [2018-11-23 03:26:49,255 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:26:49,274 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 85 [2018-11-23 03:26:49,274 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-11-23 03:26:49,389 INFO L267 ElimStorePlain]: Start of recursive call 33: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 03:26:49,566 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 65 [2018-11-23 03:26:49,587 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:26:49,760 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 32 treesize of output 54 [2018-11-23 03:26:49,785 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:26:49,788 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:26:49,791 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:26:49,805 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 39 treesize of output 62 [2018-11-23 03:26:49,805 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-11-23 03:26:50,190 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:26:50,193 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:26:50,240 INFO L303 Elim1Store]: Index analysis took 106 ms [2018-11-23 03:26:50,602 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 34 treesize of output 69 [2018-11-23 03:26:50,603 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 4 xjuncts. [2018-11-23 03:26:50,899 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:26:50,902 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:26:50,906 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:26:50,923 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 31 treesize of output 54 [2018-11-23 03:26:50,924 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-11-23 03:26:51,132 INFO L267 ElimStorePlain]: Start of recursive call 36: 4 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-11-23 03:26:51,398 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 03:26:51,399 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 03:26:51,414 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 74 [2018-11-23 03:26:51,428 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:26:51,429 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 03:26:51,430 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 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 35 treesize of output 38 [2018-11-23 03:26:51,431 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-11-23 03:26:51,489 INFO L267 ElimStorePlain]: Start of recursive call 40: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 03:26:51,509 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 03:26:51,509 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 03:26:51,526 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 77 [2018-11-23 03:26:51,543 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:26:51,544 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 03:26:51,545 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 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 35 treesize of output 38 [2018-11-23 03:26:51,546 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-11-23 03:26:51,606 INFO L267 ElimStorePlain]: Start of recursive call 42: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 03:26:51,628 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 03:26:51,628 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 03:26:51,647 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 74 [2018-11-23 03:26:51,664 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:26:51,664 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 03:26:51,666 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 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 35 treesize of output 38 [2018-11-23 03:26:51,666 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-11-23 03:26:51,720 INFO L267 ElimStorePlain]: Start of recursive call 44: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 03:26:51,748 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 03:26:51,749 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 03:26:51,766 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 72 [2018-11-23 03:26:51,789 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:26:51,789 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 03:26:51,791 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 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 35 treesize of output 38 [2018-11-23 03:26:51,792 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2018-11-23 03:26:51,847 INFO L267 ElimStorePlain]: Start of recursive call 46: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 03:26:51,866 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 03:26:51,866 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 03:26:51,884 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 72 [2018-11-23 03:26:51,902 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:26:51,902 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 03:26:51,904 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 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 35 treesize of output 38 [2018-11-23 03:26:51,904 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2018-11-23 03:26:51,959 INFO L267 ElimStorePlain]: Start of recursive call 48: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 03:26:52,200 INFO L267 ElimStorePlain]: Start of recursive call 35: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-11-23 03:26:52,459 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-11-23 03:26:52,668 INFO L303 Elim1Store]: Index analysis took 208 ms [2018-11-23 03:26:52,669 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 183 treesize of output 128 [2018-11-23 03:26:54,360 WARN L180 SmtUtils]: Spent 1.69 s on a formula simplification that was a NOOP. DAG size: 61 [2018-11-23 03:26:54,361 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-23 03:26:54,361 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2018-11-23 03:26:54,391 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 59 treesize of output 55 [2018-11-23 03:26:54,438 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:26:54,483 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 56 [2018-11-23 03:26:54,484 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2018-11-23 03:26:54,732 INFO L267 ElimStorePlain]: Start of recursive call 52: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 03:26:55,226 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 03:26:55,227 INFO L303 Elim1Store]: Index analysis took 233 ms [2018-11-23 03:26:55,228 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 116 [2018-11-23 03:26:55,245 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 41 treesize of output 39 [2018-11-23 03:26:55,266 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:26:55,277 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 62 [2018-11-23 03:26:55,277 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2018-11-23 03:26:55,291 INFO L267 ElimStorePlain]: Start of recursive call 55: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 03:26:55,390 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-11-23 03:26:55,390 INFO L267 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2018-11-23 03:26:55,514 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 03:26:55,564 INFO L303 Elim1Store]: Index analysis took 101 ms [2018-11-23 03:26:55,565 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 76 [2018-11-23 03:26:55,582 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:26:55,583 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 03:26:55,584 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2018-11-23 03:26:55,585 INFO L267 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2018-11-23 03:26:55,647 INFO L267 ElimStorePlain]: Start of recursive call 58: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 03:26:55,701 INFO L267 ElimStorePlain]: Start of recursive call 54: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 03:26:55,754 INFO L267 ElimStorePlain]: Start of recursive call 50: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 03:26:55,913 INFO L303 Elim1Store]: Index analysis took 158 ms [2018-11-23 03:26:55,914 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 159 treesize of output 108 [2018-11-23 03:26:56,860 WARN L180 SmtUtils]: Spent 945.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2018-11-23 03:26:56,876 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 17 treesize of output 20 [2018-11-23 03:26:56,900 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:26:56,913 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 29 [2018-11-23 03:26:56,913 INFO L267 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 1 xjuncts. [2018-11-23 03:26:56,961 INFO L267 ElimStorePlain]: Start of recursive call 61: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 03:26:57,223 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 74 [2018-11-23 03:26:57,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 15 treesize of output 18 [2018-11-23 03:26:57,256 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:26:57,263 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 25 [2018-11-23 03:26:57,264 INFO L267 ElimStorePlain]: Start of recursive call 65: End of recursive call: and 1 xjuncts. [2018-11-23 03:26:57,296 INFO L267 ElimStorePlain]: Start of recursive call 64: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 03:26:57,408 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 03:26:57,408 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 03:26:57,447 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 85 [2018-11-23 03:26:57,461 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:26:57,462 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 03:26:57,463 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 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 35 treesize of output 38 [2018-11-23 03:26:57,463 INFO L267 ElimStorePlain]: Start of recursive call 67: End of recursive call: and 1 xjuncts. [2018-11-23 03:26:57,535 INFO L267 ElimStorePlain]: Start of recursive call 66: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 03:26:57,585 INFO L267 ElimStorePlain]: Start of recursive call 63: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 03:26:57,642 INFO L267 ElimStorePlain]: Start of recursive call 60: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 03:26:57,815 INFO L303 Elim1Store]: Index analysis took 172 ms [2018-11-23 03:26:57,815 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 182 treesize of output 123 [2018-11-23 03:26:59,481 WARN L180 SmtUtils]: Spent 1.66 s on a formula simplification that was a NOOP. DAG size: 59 [2018-11-23 03:26:59,561 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 84 [2018-11-23 03:26:59,598 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 03:26:59,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 58 [2018-11-23 03:26:59,637 INFO L267 ElimStorePlain]: Start of recursive call 70: End of recursive call: and 1 xjuncts. [2018-11-23 03:26:59,848 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 03:26:59,864 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck has thrown an exception: java.lang.AssertionError: var is still there: v_arrayElimArr_39 input size 13 context size 13 output size 13 at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:221) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.elimAllRec(ElimStorePlain.java:199) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:293) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:286) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.CodeCheckObserver.createTraceCheck(CodeCheckObserver.java:624) at de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.CodeCheckObserver.process(CodeCheckObserver.java:454) at de.uni_freiburg.informatik.ultimate.core.coreplugin.modelwalker.CFGWalker.runObserver(CFGWalker.java:57) at de.uni_freiburg.informatik.ultimate.core.coreplugin.modelwalker.BaseWalker.runObserver(BaseWalker.java:93) at de.uni_freiburg.informatik.ultimate.core.coreplugin.modelwalker.BaseWalker.run(BaseWalker.java:86) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-11-23 03:26:59,866 INFO L168 Benchmark]: Toolchain (without parser) took 219046.45 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 179.8 MB). Free memory was 949.7 MB in the beginning and 1.1 GB in the end (delta: -133.8 MB). Peak memory consumption was 370.1 MB. Max. memory is 11.5 GB. [2018-11-23 03:26:59,867 INFO L168 Benchmark]: CDTParser took 0.16 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 03:26:59,867 INFO L168 Benchmark]: CACSL2BoogieTranslator took 226.44 ms. Allocated memory is still 1.0 GB. Free memory was 949.7 MB in the beginning and 933.6 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-23 03:26:59,867 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.44 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.8 MB). Free memory was 933.6 MB in the beginning and 1.1 GB in the end (delta: -175.4 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. [2018-11-23 03:26:59,867 INFO L168 Benchmark]: Boogie Preprocessor took 22.47 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2018-11-23 03:26:59,868 INFO L168 Benchmark]: RCFGBuilder took 93952.91 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 76.6 MB). Peak memory consumption was 76.6 MB. Max. memory is 11.5 GB. [2018-11-23 03:26:59,868 INFO L168 Benchmark]: CodeCheck took 124777.28 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 65.0 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -58.1 MB). Peak memory consumption was 331.0 MB. Max. memory is 11.5 GB. [2018-11-23 03:26:59,871 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - ExceptionOrErrorResult: AssertionError: var is still there: v_arrayElimArr_39 input size 13 context size 13 output size 13 de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: AssertionError: var is still there: v_arrayElimArr_39 input size 13 context size 13 output size 13: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452) * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 226.44 ms. Allocated memory is still 1.0 GB. Free memory was 949.7 MB in the beginning and 933.6 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 64.44 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.8 MB). Free memory was 933.6 MB in the beginning and 1.1 GB in the end (delta: -175.4 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.47 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 93952.91 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 76.6 MB). Peak memory consumption was 76.6 MB. Max. memory is 11.5 GB. * CodeCheck took 124777.28 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 65.0 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -58.1 MB). Peak memory consumption was 331.0 MB. Max. memory is 11.5 GB. RESULT: Ultimate could not prove your program: Toolchain returned no result. [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Forcibly destroying the process Received shutdown request...