./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-35.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c574f9-22c4-4928-a1a3-f19996331f0d/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c574f9-22c4-4928-a1a3-f19996331f0d/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c574f9-22c4-4928-a1a3-f19996331f0d/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c574f9-22c4-4928-a1a3-f19996331f0d/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-35.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c574f9-22c4-4928-a1a3-f19996331f0d/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c574f9-22c4-4928-a1a3-f19996331f0d/bin/uautomizer-verify-jihMAELWvX --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 10175ba88404a095227b7e35859de06b4a92973be853e9a8f08e99d638bebdbe --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 19:23:49,966 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 19:23:50,060 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c574f9-22c4-4928-a1a3-f19996331f0d/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 19:23:50,069 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 19:23:50,069 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 19:23:50,109 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 19:23:50,110 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 19:23:50,110 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 19:23:50,112 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 19:23:50,113 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 19:23:50,113 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 19:23:50,114 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 19:23:50,114 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 19:23:50,115 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 19:23:50,115 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 19:23:50,115 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 19:23:50,118 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 19:23:50,121 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 19:23:50,121 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 19:23:50,122 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 19:23:50,122 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 19:23:50,122 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 19:23:50,123 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 19:23:50,123 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 19:23:50,123 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 19:23:50,123 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 19:23:50,124 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 19:23:50,124 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 19:23:50,124 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 19:23:50,125 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 19:23:50,125 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 19:23:50,125 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 19:23:50,125 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:23:50,127 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 19:23:50,128 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 19:23:50,128 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 19:23:50,129 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 19:23:50,129 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 19:23:50,129 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 19:23:50,129 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 19:23:50,130 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 19:23:50,130 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 19:23:50,130 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c574f9-22c4-4928-a1a3-f19996331f0d/bin/uautomizer-verify-jihMAELWvX/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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_worker_vcloud-master_on_vcloud-master/run_dir_38c574f9-22c4-4928-a1a3-f19996331f0d/bin/uautomizer-verify-jihMAELWvX Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 10175ba88404a095227b7e35859de06b4a92973be853e9a8f08e99d638bebdbe [2024-11-08 19:23:50,440 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 19:23:50,469 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 19:23:50,475 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 19:23:50,476 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 19:23:50,477 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 19:23:50,478 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c574f9-22c4-4928-a1a3-f19996331f0d/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-35.i Unable to find full path for "g++" [2024-11-08 19:23:52,451 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 19:23:52,773 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 19:23:52,777 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c574f9-22c4-4928-a1a3-f19996331f0d/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-35.i [2024-11-08 19:23:52,789 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c574f9-22c4-4928-a1a3-f19996331f0d/bin/uautomizer-verify-jihMAELWvX/data/d0de368a4/72c5ac60b6ac4b38af2f322cdccf4291/FLAGb7de2e6d6 [2024-11-08 19:23:52,812 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c574f9-22c4-4928-a1a3-f19996331f0d/bin/uautomizer-verify-jihMAELWvX/data/d0de368a4/72c5ac60b6ac4b38af2f322cdccf4291 [2024-11-08 19:23:52,815 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 19:23:52,818 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 19:23:52,820 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 19:23:52,820 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 19:23:52,826 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 19:23:52,827 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:23:52" (1/1) ... [2024-11-08 19:23:52,830 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61bac054 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:23:52, skipping insertion in model container [2024-11-08 19:23:52,830 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:23:52" (1/1) ... [2024-11-08 19:23:52,863 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 19:23:53,091 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c574f9-22c4-4928-a1a3-f19996331f0d/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-35.i[916,929] [2024-11-08 19:23:53,157 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:23:53,179 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 19:23:53,192 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c574f9-22c4-4928-a1a3-f19996331f0d/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-35.i[916,929] [2024-11-08 19:23:53,239 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:23:53,263 INFO L204 MainTranslator]: Completed translation [2024-11-08 19:23:53,263 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:23:53 WrapperNode [2024-11-08 19:23:53,264 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 19:23:53,265 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 19:23:53,265 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 19:23:53,265 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 19:23:53,273 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:23:53" (1/1) ... [2024-11-08 19:23:53,296 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:23:53" (1/1) ... [2024-11-08 19:23:53,348 INFO L138 Inliner]: procedures = 29, calls = 152, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 418 [2024-11-08 19:23:53,349 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 19:23:53,349 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 19:23:53,350 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 19:23:53,350 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 19:23:53,366 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:23:53" (1/1) ... [2024-11-08 19:23:53,367 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:23:53" (1/1) ... [2024-11-08 19:23:53,373 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:23:53" (1/1) ... [2024-11-08 19:23:53,406 INFO L175 MemorySlicer]: Split 118 memory accesses to 6 slices as follows [2, 31, 25, 33, 7, 20]. 28 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 4, 3, 4, 1, 3]. The 19 writes are split as follows [0, 5, 3, 4, 3, 4]. [2024-11-08 19:23:53,407 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:23:53" (1/1) ... [2024-11-08 19:23:53,407 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:23:53" (1/1) ... [2024-11-08 19:23:53,428 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:23:53" (1/1) ... [2024-11-08 19:23:53,432 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:23:53" (1/1) ... [2024-11-08 19:23:53,435 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:23:53" (1/1) ... [2024-11-08 19:23:53,438 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:23:53" (1/1) ... [2024-11-08 19:23:53,443 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 19:23:53,444 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 19:23:53,444 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 19:23:53,445 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 19:23:53,446 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:23:53" (1/1) ... [2024-11-08 19:23:53,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:23:53,469 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c574f9-22c4-4928-a1a3-f19996331f0d/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 19:23:53,486 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c574f9-22c4-4928-a1a3-f19996331f0d/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 19:23:53,493 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c574f9-22c4-4928-a1a3-f19996331f0d/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 19:23:53,525 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 19:23:53,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-08 19:23:53,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-08 19:23:53,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-08 19:23:53,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-08 19:23:53,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-08 19:23:53,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-08 19:23:53,527 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-08 19:23:53,527 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-08 19:23:53,527 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-08 19:23:53,527 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-08 19:23:53,528 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-08 19:23:53,528 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-11-08 19:23:53,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-08 19:23:53,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-08 19:23:53,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-08 19:23:53,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-08 19:23:53,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-11-08 19:23:53,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-11-08 19:23:53,529 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-08 19:23:53,531 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-08 19:23:53,531 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-08 19:23:53,531 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-08 19:23:53,532 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-08 19:23:53,532 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-08 19:23:53,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-08 19:23:53,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-08 19:23:53,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-08 19:23:53,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-08 19:23:53,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-08 19:23:53,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-11-08 19:23:53,535 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 19:23:53,535 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 19:23:53,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 19:23:53,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-08 19:23:53,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-08 19:23:53,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-08 19:23:53,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-08 19:23:53,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-08 19:23:53,538 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 19:23:53,538 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 19:23:53,740 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 19:23:53,742 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 19:23:54,284 INFO L? ?]: Removed 83 outVars from TransFormulas that were not future-live. [2024-11-08 19:23:54,284 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 19:23:54,308 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 19:23:54,308 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 19:23:54,309 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:23:54 BoogieIcfgContainer [2024-11-08 19:23:54,309 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 19:23:54,312 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 19:23:54,312 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 19:23:54,316 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 19:23:54,316 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 07:23:52" (1/3) ... [2024-11-08 19:23:54,317 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@418078ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:23:54, skipping insertion in model container [2024-11-08 19:23:54,317 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:23:53" (2/3) ... [2024-11-08 19:23:54,319 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@418078ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:23:54, skipping insertion in model container [2024-11-08 19:23:54,319 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:23:54" (3/3) ... [2024-11-08 19:23:54,320 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-35.i [2024-11-08 19:23:54,340 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 19:23:54,340 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 19:23:54,408 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 19:23:54,415 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5945a2a5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 19:23:54,415 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 19:23:54,419 INFO L276 IsEmpty]: Start isEmpty. Operand has 101 states, 80 states have (on average 1.375) internal successors, (110), 81 states have internal predecessors, (110), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 19:23:54,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-08 19:23:54,430 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:23:54,431 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:23:54,432 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:23:54,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:23:54,437 INFO L85 PathProgramCache]: Analyzing trace with hash 775566824, now seen corresponding path program 1 times [2024-11-08 19:23:54,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:23:54,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176936377] [2024-11-08 19:23:54,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:23:54,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:23:54,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:23:54,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 19:23:54,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:23:54,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 19:23:54,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:23:54,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 19:23:54,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:23:54,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 19:23:54,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:23:54,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 19:23:54,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:23:54,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 19:23:54,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:23:54,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 19:23:54,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:23:54,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 19:23:54,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:23:54,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 19:23:54,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:23:54,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 19:23:54,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:23:54,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 19:23:54,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:23:54,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 19:23:54,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:23:54,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 19:23:54,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:23:54,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 19:23:54,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:23:55,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 19:23:55,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:23:55,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 19:23:55,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:23:55,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 19:23:55,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:23:55,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 19:23:55,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:23:55,056 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 19:23:55,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:23:55,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176936377] [2024-11-08 19:23:55,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176936377] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:23:55,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:23:55,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 19:23:55,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339868908] [2024-11-08 19:23:55,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:23:55,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 19:23:55,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:23:55,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 19:23:55,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 19:23:55,094 INFO L87 Difference]: Start difference. First operand has 101 states, 80 states have (on average 1.375) internal successors, (110), 81 states have internal predecessors, (110), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-08 19:23:55,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:23:55,147 INFO L93 Difference]: Finished difference Result 195 states and 304 transitions. [2024-11-08 19:23:55,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 19:23:55,150 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 143 [2024-11-08 19:23:55,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:23:55,160 INFO L225 Difference]: With dead ends: 195 [2024-11-08 19:23:55,160 INFO L226 Difference]: Without dead ends: 97 [2024-11-08 19:23:55,165 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 19:23:55,171 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 19:23:55,172 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 19:23:55,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-08 19:23:55,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2024-11-08 19:23:55,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 77 states have (on average 1.3246753246753247) internal successors, (102), 77 states have internal predecessors, (102), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 19:23:55,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 138 transitions. [2024-11-08 19:23:55,235 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 138 transitions. Word has length 143 [2024-11-08 19:23:55,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:23:55,235 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 138 transitions. [2024-11-08 19:23:55,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-08 19:23:55,236 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 138 transitions. [2024-11-08 19:23:55,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-08 19:23:55,242 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:23:55,242 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:23:55,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 19:23:55,242 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:23:55,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:23:55,243 INFO L85 PathProgramCache]: Analyzing trace with hash -1748773240, now seen corresponding path program 1 times [2024-11-08 19:23:55,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:23:55,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584461640] [2024-11-08 19:23:55,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:23:55,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:23:55,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:23:56,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 19:23:56,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:23:56,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 19:23:56,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:23:56,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 19:23:56,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:23:56,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 19:23:56,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:23:56,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 19:23:56,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:23:56,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 19:23:56,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:23:56,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 19:23:56,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:23:56,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 19:23:56,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:23:56,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 19:23:56,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:23:56,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 19:23:56,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:23:56,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 19:23:56,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:23:56,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 19:23:56,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:23:56,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 19:23:56,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:23:56,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 19:23:56,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:23:56,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 19:23:56,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:23:56,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 19:23:56,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:23:56,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 19:23:56,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:23:56,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 19:23:56,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:23:56,742 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 9 proven. 42 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-11-08 19:23:56,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:23:56,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584461640] [2024-11-08 19:23:56,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584461640] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 19:23:56,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [976572794] [2024-11-08 19:23:56,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:23:56,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 19:23:56,744 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c574f9-22c4-4928-a1a3-f19996331f0d/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 19:23:56,745 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c574f9-22c4-4928-a1a3-f19996331f0d/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 19:23:56,753 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c574f9-22c4-4928-a1a3-f19996331f0d/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 19:23:57,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:23:57,046 INFO L255 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-08 19:23:57,059 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:23:57,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-11-08 19:23:57,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 52 [2024-11-08 19:23:57,654 INFO L378 Elim1Store]: Elim1 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 70 [2024-11-08 19:23:57,692 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 19:23:57,693 INFO L378 Elim1Store]: Elim1 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 27 [2024-11-08 19:23:57,782 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 146 proven. 90 refuted. 0 times theorem prover too weak. 376 trivial. 0 not checked. [2024-11-08 19:23:57,786 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 19:23:58,313 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 9 proven. 42 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-11-08 19:23:58,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [976572794] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 19:23:58,314 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 19:23:58,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16 [2024-11-08 19:23:58,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150751426] [2024-11-08 19:23:58,315 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 19:23:58,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-08 19:23:58,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:23:58,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-08 19:23:58,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2024-11-08 19:23:58,319 INFO L87 Difference]: Start difference. First operand 97 states and 138 transitions. Second operand has 16 states, 13 states have (on average 5.923076923076923) internal successors, (77), 16 states have internal predecessors, (77), 5 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (35), 2 states have call predecessors, (35), 5 states have call successors, (35) [2024-11-08 19:23:59,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:23:59,307 INFO L93 Difference]: Finished difference Result 301 states and 422 transitions. [2024-11-08 19:23:59,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-08 19:23:59,309 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 5.923076923076923) internal successors, (77), 16 states have internal predecessors, (77), 5 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (35), 2 states have call predecessors, (35), 5 states have call successors, (35) Word has length 143 [2024-11-08 19:23:59,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:23:59,312 INFO L225 Difference]: With dead ends: 301 [2024-11-08 19:23:59,316 INFO L226 Difference]: Without dead ends: 207 [2024-11-08 19:23:59,317 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 311 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=195, Invalid=735, Unknown=0, NotChecked=0, Total=930 [2024-11-08 19:23:59,318 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 293 mSDsluCounter, 1070 mSDsCounter, 0 mSdLazyCounter, 643 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 1202 SdHoareTripleChecker+Invalid, 676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 643 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 19:23:59,319 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 1202 Invalid, 676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 643 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 19:23:59,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2024-11-08 19:23:59,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 107. [2024-11-08 19:23:59,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 86 states have (on average 1.302325581395349) internal successors, (112), 86 states have internal predecessors, (112), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 19:23:59,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 148 transitions. [2024-11-08 19:23:59,345 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 148 transitions. Word has length 143 [2024-11-08 19:23:59,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:23:59,346 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 148 transitions. [2024-11-08 19:23:59,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 5.923076923076923) internal successors, (77), 16 states have internal predecessors, (77), 5 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (35), 2 states have call predecessors, (35), 5 states have call successors, (35) [2024-11-08 19:23:59,346 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 148 transitions. [2024-11-08 19:23:59,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-08 19:23:59,351 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:23:59,352 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:23:59,375 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c574f9-22c4-4928-a1a3-f19996331f0d/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-08 19:23:59,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c574f9-22c4-4928-a1a3-f19996331f0d/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 19:23:59,557 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:23:59,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:23:59,558 INFO L85 PathProgramCache]: Analyzing trace with hash 857250314, now seen corresponding path program 1 times [2024-11-08 19:23:59,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:23:59,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209752894] [2024-11-08 19:23:59,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:23:59,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:23:59,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 19:23:59,722 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 19:23:59,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 19:23:59,854 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 19:23:59,854 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 19:23:59,855 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 19:23:59,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 19:23:59,861 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-08 19:23:59,983 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 19:23:59,986 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 07:23:59 BoogieIcfgContainer [2024-11-08 19:23:59,987 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 19:23:59,987 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 19:23:59,987 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 19:23:59,988 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 19:23:59,988 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:23:54" (3/4) ... [2024-11-08 19:23:59,991 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 19:23:59,992 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 19:23:59,993 INFO L158 Benchmark]: Toolchain (without parser) took 7175.00ms. Allocated memory was 199.2MB in the beginning and 255.9MB in the end (delta: 56.6MB). Free memory was 164.5MB in the beginning and 142.2MB in the end (delta: 22.2MB). Peak memory consumption was 79.8MB. Max. memory is 16.1GB. [2024-11-08 19:23:59,994 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 136.3MB. Free memory was 75.9MB in the beginning and 75.8MB in the end (delta: 158.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 19:23:59,994 INFO L158 Benchmark]: CACSL2BoogieTranslator took 444.08ms. Allocated memory is still 199.2MB. Free memory was 164.5MB in the beginning and 147.7MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-08 19:23:59,995 INFO L158 Benchmark]: Boogie Procedure Inliner took 83.98ms. Allocated memory is still 199.2MB. Free memory was 147.7MB in the beginning and 144.4MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 19:23:59,995 INFO L158 Benchmark]: Boogie Preprocessor took 94.16ms. Allocated memory is still 199.2MB. Free memory was 144.4MB in the beginning and 139.3MB in the end (delta: 5.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-08 19:23:59,996 INFO L158 Benchmark]: RCFGBuilder took 864.59ms. Allocated memory is still 199.2MB. Free memory was 139.3MB in the beginning and 105.8MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-11-08 19:23:59,997 INFO L158 Benchmark]: TraceAbstraction took 5674.61ms. Allocated memory was 199.2MB in the beginning and 255.9MB in the end (delta: 56.6MB). Free memory was 105.8MB in the beginning and 142.2MB in the end (delta: -36.5MB). Peak memory consumption was 21.1MB. Max. memory is 16.1GB. [2024-11-08 19:23:59,997 INFO L158 Benchmark]: Witness Printer took 4.99ms. Allocated memory is still 255.9MB. Free memory is still 142.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 19:24:00,000 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29ms. Allocated memory is still 136.3MB. Free memory was 75.9MB in the beginning and 75.8MB in the end (delta: 158.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 444.08ms. Allocated memory is still 199.2MB. Free memory was 164.5MB in the beginning and 147.7MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 83.98ms. Allocated memory is still 199.2MB. Free memory was 147.7MB in the beginning and 144.4MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 94.16ms. Allocated memory is still 199.2MB. Free memory was 144.4MB in the beginning and 139.3MB in the end (delta: 5.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 864.59ms. Allocated memory is still 199.2MB. Free memory was 139.3MB in the beginning and 105.8MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 5674.61ms. Allocated memory was 199.2MB in the beginning and 255.9MB in the end (delta: 56.6MB). Free memory was 105.8MB in the beginning and 142.2MB in the end (delta: -36.5MB). Peak memory consumption was 21.1MB. Max. memory is 16.1GB. * Witness Printer took 4.99ms. Allocated memory is still 255.9MB. Free memory is still 142.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 103, overapproximation of someUnaryDOUBLEoperation at line 26, overapproximation of someBinaryArithmeticFLOAToperation at line 43. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {1, 1}, {0, 1} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {1, 1}, {0, 1} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {1, 1}, {0, 1} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {1, 1}, {0, 1} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {1, 1}, {0, 1} }; [L25-L27] float float_Array_0[3] = { -0.6, 255.1, 4.8 }; [L25-L27] float float_Array_0[3] = { -0.6, 255.1, 4.8 }; [L25-L27] float float_Array_0[3] = { -0.6, 255.1, 4.8 }; [L25-L27] float float_Array_0[3] = { -0.6, 255.1, 4.8 }; [L28-L30] signed char signed_char_Array_0[2][2] = { {10, -2}, {5, -1} }; [L28-L30] signed char signed_char_Array_0[2][2] = { {10, -2}, {5, -1} }; [L28-L30] signed char signed_char_Array_0[2][2] = { {10, -2}, {5, -1} }; [L28-L30] signed char signed_char_Array_0[2][2] = { {10, -2}, {5, -1} }; [L28-L30] signed char signed_char_Array_0[2][2] = { {10, -2}, {5, -1} }; [L31-L33] signed short int signed_short_int_Array_0[1] = { -10 }; [L31-L33] signed short int signed_short_int_Array_0[1] = { -10 }; [L34-L36] unsigned char unsigned_char_Array_0[3] = { 5, 5, 64 }; [L34-L36] unsigned char unsigned_char_Array_0[3] = { 5, 5, 64 }; [L34-L36] unsigned char unsigned_char_Array_0[3] = { 5, 5, 64 }; [L34-L36] unsigned char unsigned_char_Array_0[3] = { 5, 5, 64 }; [L37] unsigned char last_1_unsigned_char_Array_0_1_ = 5; VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=0, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L107] isInitial = 1 [L108] FCALL initially() [L109] COND TRUE 1 [L110] CALL updateLastVariables() [L100] EXPR unsigned_char_Array_0[1] [L100] last_1_unsigned_char_Array_0_1_ = unsigned_char_Array_0[1] [L110] RET updateLastVariables() [L111] CALL updateVariables() [L70] BOOL_unsigned_char_Array_0[0][0] = __VERIFIER_nondet_uchar() [L71] EXPR BOOL_unsigned_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L71] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L71] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L72] EXPR BOOL_unsigned_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L72] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L72] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L73] BOOL_unsigned_char_Array_0[1][0] = __VERIFIER_nondet_uchar() [L74] EXPR BOOL_unsigned_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L74] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L74] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L75] EXPR BOOL_unsigned_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L75] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L75] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L76] BOOL_unsigned_char_Array_0[0][1] = __VERIFIER_nondet_uchar() [L77] EXPR BOOL_unsigned_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L77] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L77] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L78] EXPR BOOL_unsigned_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L78] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L78] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L79] float_Array_0[0] = __VERIFIER_nondet_float() [L80] EXPR float_Array_0[0] [L80] EXPR float_Array_0[0] >= -461168.6018427382800e+13F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L80] EXPR float_Array_0[0] >= -461168.6018427382800e+13F && float_Array_0[0] <= -1.0e-20F [L80] EXPR float_Array_0[0] [L80] EXPR float_Array_0[0] >= -461168.6018427382800e+13F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L80] EXPR (float_Array_0[0] >= -461168.6018427382800e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 4611686.018427382800e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L80] EXPR (float_Array_0[0] >= -461168.6018427382800e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 4611686.018427382800e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L80] CALL assume_abort_if_not((float_Array_0[0] >= -461168.6018427382800e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 4611686.018427382800e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L80] RET assume_abort_if_not((float_Array_0[0] >= -461168.6018427382800e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 4611686.018427382800e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L81] float_Array_0[1] = __VERIFIER_nondet_float() [L82] EXPR float_Array_0[1] [L82] EXPR float_Array_0[1] >= -461168.6018427382800e+13F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L82] EXPR float_Array_0[1] >= -461168.6018427382800e+13F && float_Array_0[1] <= -1.0e-20F [L82] EXPR float_Array_0[1] [L82] EXPR float_Array_0[1] >= -461168.6018427382800e+13F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L82] EXPR (float_Array_0[1] >= -461168.6018427382800e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 4611686.018427382800e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L82] EXPR (float_Array_0[1] >= -461168.6018427382800e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 4611686.018427382800e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L82] CALL assume_abort_if_not((float_Array_0[1] >= -461168.6018427382800e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 4611686.018427382800e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L82] RET assume_abort_if_not((float_Array_0[1] >= -461168.6018427382800e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 4611686.018427382800e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L83] signed_char_Array_0[0][0] = __VERIFIER_nondet_char() [L84] EXPR signed_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L84] CALL assume_abort_if_not(signed_char_Array_0[0][0] >= -31) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L84] RET assume_abort_if_not(signed_char_Array_0[0][0] >= -31) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L85] EXPR signed_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L85] CALL assume_abort_if_not(signed_char_Array_0[0][0] <= 32) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L85] RET assume_abort_if_not(signed_char_Array_0[0][0] <= 32) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L86] signed_char_Array_0[1][0] = __VERIFIER_nondet_char() [L87] EXPR signed_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L87] CALL assume_abort_if_not(signed_char_Array_0[1][0] >= -31) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L87] RET assume_abort_if_not(signed_char_Array_0[1][0] >= -31) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L88] EXPR signed_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L88] CALL assume_abort_if_not(signed_char_Array_0[1][0] <= 31) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L88] RET assume_abort_if_not(signed_char_Array_0[1][0] <= 31) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L89] signed_char_Array_0[1][1] = __VERIFIER_nondet_char() [L90] EXPR signed_char_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L90] CALL assume_abort_if_not(signed_char_Array_0[1][1] >= -63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L90] RET assume_abort_if_not(signed_char_Array_0[1][1] >= -63) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L91] EXPR signed_char_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L91] CALL assume_abort_if_not(signed_char_Array_0[1][1] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L91] RET assume_abort_if_not(signed_char_Array_0[1][1] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L92] unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L93] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L93] CALL assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L93] RET assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L94] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L94] CALL assume_abort_if_not(unsigned_char_Array_0[0] <= 32) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L94] RET assume_abort_if_not(unsigned_char_Array_0[0] <= 32) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L95] unsigned_char_Array_0[2] = __VERIFIER_nondet_uchar() [L96] EXPR unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L96] CALL assume_abort_if_not(unsigned_char_Array_0[2] >= 32) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L96] RET assume_abort_if_not(unsigned_char_Array_0[2] >= 32) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L97] EXPR unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L97] CALL assume_abort_if_not(unsigned_char_Array_0[2] <= 64) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L97] RET assume_abort_if_not(unsigned_char_Array_0[2] <= 64) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L111] RET updateVariables() [L112] CALL step() [L41] signed long int stepLocal_0 = ~ last_1_unsigned_char_Array_0_1_; VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, stepLocal_0=-6, unsigned_char_Array_0={8:0}] [L42] COND TRUE last_1_unsigned_char_Array_0_1_ >= stepLocal_0 [L43] EXPR float_Array_0[1] [L43] EXPR float_Array_0[0] [L43] float_Array_0[2] = (float_Array_0[1] + float_Array_0[0]) [L45] EXPR float_Array_0[2] [L45] EXPR float_Array_0[0] [L45] EXPR float_Array_0[1] [L45] unsigned char stepLocal_1 = (float_Array_0[2] * float_Array_0[0]) >= float_Array_0[1]; [L46] EXPR BOOL_unsigned_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L46] COND FALSE !(BOOL_unsigned_char_Array_0[0][1] && stepLocal_1) [L49] EXPR unsigned_char_Array_0[2] [L49] unsigned_char_Array_0[1] = unsigned_char_Array_0[2] [L51] BOOL_unsigned_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L51] COND FALSE !(BOOL_unsigned_char_Array_0[0][0]) [L54] EXPR BOOL_unsigned_char_Array_0[0][1] [L54] BOOL_unsigned_char_Array_0[1][1] = (! BOOL_unsigned_char_Array_0[0][1]) [L56] BOOL_unsigned_char_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L56] COND FALSE !(BOOL_unsigned_char_Array_0[1][1]) [L59] BOOL_unsigned_char_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L59] COND FALSE !(BOOL_unsigned_char_Array_0[1][1]) [L66] EXPR signed_char_Array_0[0][1] [L66] signed_short_int_Array_0[0] = signed_char_Array_0[0][1] [L112] RET step() [L113] CALL, EXPR property() [L103] EXPR (last_1_unsigned_char_Array_0_1_ >= (~ last_1_unsigned_char_Array_0_1_)) ? (float_Array_0[2] == ((float) (float_Array_0[1] + float_Array_0[0]))) : 1 [L103] EXPR float_Array_0[2] [L103] EXPR float_Array_0[1] [L103] EXPR float_Array_0[0] [L103] EXPR (last_1_unsigned_char_Array_0_1_ >= (~ last_1_unsigned_char_Array_0_1_)) ? (float_Array_0[2] == ((float) (float_Array_0[1] + float_Array_0[0]))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L103] EXPR ((last_1_unsigned_char_Array_0_1_ >= (~ last_1_unsigned_char_Array_0_1_)) ? (float_Array_0[2] == ((float) (float_Array_0[1] + float_Array_0[0]))) : 1) && (BOOL_unsigned_char_Array_0[1][1] ? (BOOL_unsigned_char_Array_0[1][1] ? (signed_short_int_Array_0[0] == ((signed short int) (signed_char_Array_0[0][1] + signed_char_Array_0[0][1]))) : (signed_short_int_Array_0[0] == ((signed short int) (signed_char_Array_0[0][1] + signed_char_Array_0[0][1])))) : (signed_short_int_Array_0[0] == ((signed short int) signed_char_Array_0[0][1]))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L103] EXPR ((last_1_unsigned_char_Array_0_1_ >= (~ last_1_unsigned_char_Array_0_1_)) ? (float_Array_0[2] == ((float) (float_Array_0[1] + float_Array_0[0]))) : 1) && (BOOL_unsigned_char_Array_0[1][1] ? (BOOL_unsigned_char_Array_0[1][1] ? (signed_short_int_Array_0[0] == ((signed short int) (signed_char_Array_0[0][1] + signed_char_Array_0[0][1]))) : (signed_short_int_Array_0[0] == ((signed short int) (signed_char_Array_0[0][1] + signed_char_Array_0[0][1])))) : (signed_short_int_Array_0[0] == ((signed short int) signed_char_Array_0[0][1]))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L103] EXPR (((last_1_unsigned_char_Array_0_1_ >= (~ last_1_unsigned_char_Array_0_1_)) ? (float_Array_0[2] == ((float) (float_Array_0[1] + float_Array_0[0]))) : 1) && (BOOL_unsigned_char_Array_0[1][1] ? (BOOL_unsigned_char_Array_0[1][1] ? (signed_short_int_Array_0[0] == ((signed short int) (signed_char_Array_0[0][1] + signed_char_Array_0[0][1]))) : (signed_short_int_Array_0[0] == ((signed short int) (signed_char_Array_0[0][1] + signed_char_Array_0[0][1])))) : (signed_short_int_Array_0[0] == ((signed short int) signed_char_Array_0[0][1])))) && (BOOL_unsigned_char_Array_0[1][1] ? (signed_char_Array_0[0][1] == ((signed char) ((signed_char_Array_0[0][0] + ((((10) < (signed_char_Array_0[1][0])) ? (10) : (signed_char_Array_0[1][0])))) + signed_char_Array_0[1][1]))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L103] EXPR (((last_1_unsigned_char_Array_0_1_ >= (~ last_1_unsigned_char_Array_0_1_)) ? (float_Array_0[2] == ((float) (float_Array_0[1] + float_Array_0[0]))) : 1) && (BOOL_unsigned_char_Array_0[1][1] ? (BOOL_unsigned_char_Array_0[1][1] ? (signed_short_int_Array_0[0] == ((signed short int) (signed_char_Array_0[0][1] + signed_char_Array_0[0][1]))) : (signed_short_int_Array_0[0] == ((signed short int) (signed_char_Array_0[0][1] + signed_char_Array_0[0][1])))) : (signed_short_int_Array_0[0] == ((signed short int) signed_char_Array_0[0][1])))) && (BOOL_unsigned_char_Array_0[1][1] ? (signed_char_Array_0[0][1] == ((signed char) ((signed_char_Array_0[0][0] + ((((10) < (signed_char_Array_0[1][0])) ? (10) : (signed_char_Array_0[1][0])))) + signed_char_Array_0[1][1]))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L103] EXPR ((((last_1_unsigned_char_Array_0_1_ >= (~ last_1_unsigned_char_Array_0_1_)) ? (float_Array_0[2] == ((float) (float_Array_0[1] + float_Array_0[0]))) : 1) && (BOOL_unsigned_char_Array_0[1][1] ? (BOOL_unsigned_char_Array_0[1][1] ? (signed_short_int_Array_0[0] == ((signed short int) (signed_char_Array_0[0][1] + signed_char_Array_0[0][1]))) : (signed_short_int_Array_0[0] == ((signed short int) (signed_char_Array_0[0][1] + signed_char_Array_0[0][1])))) : (signed_short_int_Array_0[0] == ((signed short int) signed_char_Array_0[0][1])))) && (BOOL_unsigned_char_Array_0[1][1] ? (signed_char_Array_0[0][1] == ((signed char) ((signed_char_Array_0[0][0] + ((((10) < (signed_char_Array_0[1][0])) ? (10) : (signed_char_Array_0[1][0])))) + signed_char_Array_0[1][1]))) : 1)) && (BOOL_unsigned_char_Array_0[0][0] ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1][0]))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (! BOOL_unsigned_char_Array_0[0][1])))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L103] EXPR ((((last_1_unsigned_char_Array_0_1_ >= (~ last_1_unsigned_char_Array_0_1_)) ? (float_Array_0[2] == ((float) (float_Array_0[1] + float_Array_0[0]))) : 1) && (BOOL_unsigned_char_Array_0[1][1] ? (BOOL_unsigned_char_Array_0[1][1] ? (signed_short_int_Array_0[0] == ((signed short int) (signed_char_Array_0[0][1] + signed_char_Array_0[0][1]))) : (signed_short_int_Array_0[0] == ((signed short int) (signed_char_Array_0[0][1] + signed_char_Array_0[0][1])))) : (signed_short_int_Array_0[0] == ((signed short int) signed_char_Array_0[0][1])))) && (BOOL_unsigned_char_Array_0[1][1] ? (signed_char_Array_0[0][1] == ((signed char) ((signed_char_Array_0[0][0] + ((((10) < (signed_char_Array_0[1][0])) ? (10) : (signed_char_Array_0[1][0])))) + signed_char_Array_0[1][1]))) : 1)) && (BOOL_unsigned_char_Array_0[0][0] ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1][0]))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (! BOOL_unsigned_char_Array_0[0][1])))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L103] EXPR (((((last_1_unsigned_char_Array_0_1_ >= (~ last_1_unsigned_char_Array_0_1_)) ? (float_Array_0[2] == ((float) (float_Array_0[1] + float_Array_0[0]))) : 1) && (BOOL_unsigned_char_Array_0[1][1] ? (BOOL_unsigned_char_Array_0[1][1] ? (signed_short_int_Array_0[0] == ((signed short int) (signed_char_Array_0[0][1] + signed_char_Array_0[0][1]))) : (signed_short_int_Array_0[0] == ((signed short int) (signed_char_Array_0[0][1] + signed_char_Array_0[0][1])))) : (signed_short_int_Array_0[0] == ((signed short int) signed_char_Array_0[0][1])))) && (BOOL_unsigned_char_Array_0[1][1] ? (signed_char_Array_0[0][1] == ((signed char) ((signed_char_Array_0[0][0] + ((((10) < (signed_char_Array_0[1][0])) ? (10) : (signed_char_Array_0[1][0])))) + signed_char_Array_0[1][1]))) : 1)) && (BOOL_unsigned_char_Array_0[0][0] ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1][0]))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (! BOOL_unsigned_char_Array_0[0][1]))))) && ((BOOL_unsigned_char_Array_0[0][1] && ((float_Array_0[2] * float_Array_0[0]) >= float_Array_0[1])) ? (unsigned_char_Array_0[1] == ((unsigned char) (2 + ((unsigned_char_Array_0[2] - unsigned_char_Array_0[0]) + 32)))) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[2]))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L103] EXPR (((((last_1_unsigned_char_Array_0_1_ >= (~ last_1_unsigned_char_Array_0_1_)) ? (float_Array_0[2] == ((float) (float_Array_0[1] + float_Array_0[0]))) : 1) && (BOOL_unsigned_char_Array_0[1][1] ? (BOOL_unsigned_char_Array_0[1][1] ? (signed_short_int_Array_0[0] == ((signed short int) (signed_char_Array_0[0][1] + signed_char_Array_0[0][1]))) : (signed_short_int_Array_0[0] == ((signed short int) (signed_char_Array_0[0][1] + signed_char_Array_0[0][1])))) : (signed_short_int_Array_0[0] == ((signed short int) signed_char_Array_0[0][1])))) && (BOOL_unsigned_char_Array_0[1][1] ? (signed_char_Array_0[0][1] == ((signed char) ((signed_char_Array_0[0][0] + ((((10) < (signed_char_Array_0[1][0])) ? (10) : (signed_char_Array_0[1][0])))) + signed_char_Array_0[1][1]))) : 1)) && (BOOL_unsigned_char_Array_0[0][0] ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1][0]))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (! BOOL_unsigned_char_Array_0[0][1]))))) && ((BOOL_unsigned_char_Array_0[0][1] && ((float_Array_0[2] * float_Array_0[0]) >= float_Array_0[1])) ? (unsigned_char_Array_0[1] == ((unsigned char) (2 + ((unsigned_char_Array_0[2] - unsigned_char_Array_0[0]) + 32)))) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[2]))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L103-L104] return (((((last_1_unsigned_char_Array_0_1_ >= (~ last_1_unsigned_char_Array_0_1_)) ? (float_Array_0[2] == ((float) (float_Array_0[1] + float_Array_0[0]))) : 1) && (BOOL_unsigned_char_Array_0[1][1] ? (BOOL_unsigned_char_Array_0[1][1] ? (signed_short_int_Array_0[0] == ((signed short int) (signed_char_Array_0[0][1] + signed_char_Array_0[0][1]))) : (signed_short_int_Array_0[0] == ((signed short int) (signed_char_Array_0[0][1] + signed_char_Array_0[0][1])))) : (signed_short_int_Array_0[0] == ((signed short int) signed_char_Array_0[0][1])))) && (BOOL_unsigned_char_Array_0[1][1] ? (signed_char_Array_0[0][1] == ((signed char) ((signed_char_Array_0[0][0] + ((((10) < (signed_char_Array_0[1][0])) ? (10) : (signed_char_Array_0[1][0])))) + signed_char_Array_0[1][1]))) : 1)) && (BOOL_unsigned_char_Array_0[0][0] ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1][0]))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (! BOOL_unsigned_char_Array_0[0][1]))))) && ((BOOL_unsigned_char_Array_0[0][1] && ((float_Array_0[2] * float_Array_0[0]) >= float_Array_0[1])) ? (unsigned_char_Array_0[1] == ((unsigned char) (2 + ((unsigned_char_Array_0[2] - unsigned_char_Array_0[0]) + 32)))) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[2]))) ; [L113] RET, EXPR property() [L113] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_char_Array_0_1_=5, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 101 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.5s, OverallIterations: 3, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 313 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 293 mSDsluCounter, 1340 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1070 mSDsCounter, 33 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 643 IncrementalHoareTripleChecker+Invalid, 676 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 33 mSolverCounterUnsat, 270 mSDtfsCounter, 643 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 400 GetRequests, 367 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=107occurred in iteration=2, InterpolantAutomatonStates: 25, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 100 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 572 NumberOfCodeBlocks, 572 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 568 ConstructedInterpolants, 0 QuantifiedInterpolants, 2580 SizeOfPredicates, 6 NumberOfNonLiveVariables, 474 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 4 InterpolantComputations, 1 PerfectInterpolantSequences, 2274/2448 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-08 19:24:00,039 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c574f9-22c4-4928-a1a3-f19996331f0d/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c574f9-22c4-4928-a1a3-f19996331f0d/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c574f9-22c4-4928-a1a3-f19996331f0d/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c574f9-22c4-4928-a1a3-f19996331f0d/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c574f9-22c4-4928-a1a3-f19996331f0d/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-35.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c574f9-22c4-4928-a1a3-f19996331f0d/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c574f9-22c4-4928-a1a3-f19996331f0d/bin/uautomizer-verify-jihMAELWvX --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 10175ba88404a095227b7e35859de06b4a92973be853e9a8f08e99d638bebdbe --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 19:24:02,498 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 19:24:02,605 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c574f9-22c4-4928-a1a3-f19996331f0d/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 19:24:02,613 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 19:24:02,614 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 19:24:02,655 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 19:24:02,656 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 19:24:02,656 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 19:24:02,657 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 19:24:02,661 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 19:24:02,662 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 19:24:02,662 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 19:24:02,663 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 19:24:02,663 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 19:24:02,663 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 19:24:02,664 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 19:24:02,664 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 19:24:02,664 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 19:24:02,665 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 19:24:02,665 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 19:24:02,665 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 19:24:02,667 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 19:24:02,668 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 19:24:02,668 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 19:24:02,668 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 19:24:02,669 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 19:24:02,669 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 19:24:02,669 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 19:24:02,669 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 19:24:02,670 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 19:24:02,670 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 19:24:02,671 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 19:24:02,672 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 19:24:02,672 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 19:24:02,672 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:24:02,673 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 19:24:02,673 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 19:24:02,673 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 19:24:02,674 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-08 19:24:02,674 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 19:24:02,675 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 19:24:02,675 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 19:24:02,675 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 19:24:02,675 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 19:24:02,676 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c574f9-22c4-4928-a1a3-f19996331f0d/bin/uautomizer-verify-jihMAELWvX/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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_worker_vcloud-master_on_vcloud-master/run_dir_38c574f9-22c4-4928-a1a3-f19996331f0d/bin/uautomizer-verify-jihMAELWvX Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 10175ba88404a095227b7e35859de06b4a92973be853e9a8f08e99d638bebdbe [2024-11-08 19:24:03,031 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 19:24:03,057 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 19:24:03,060 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 19:24:03,061 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 19:24:03,062 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 19:24:03,063 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c574f9-22c4-4928-a1a3-f19996331f0d/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-35.i Unable to find full path for "g++" [2024-11-08 19:24:05,152 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 19:24:05,396 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 19:24:05,396 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c574f9-22c4-4928-a1a3-f19996331f0d/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-35.i [2024-11-08 19:24:05,408 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c574f9-22c4-4928-a1a3-f19996331f0d/bin/uautomizer-verify-jihMAELWvX/data/f1a596bfd/c373f5365b1d44fba1c9ccd120367513/FLAG960e0ce36 [2024-11-08 19:24:05,734 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c574f9-22c4-4928-a1a3-f19996331f0d/bin/uautomizer-verify-jihMAELWvX/data/f1a596bfd/c373f5365b1d44fba1c9ccd120367513 [2024-11-08 19:24:05,737 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 19:24:05,738 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 19:24:05,739 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 19:24:05,740 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 19:24:05,745 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 19:24:05,746 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:24:05" (1/1) ... [2024-11-08 19:24:05,747 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a2fec29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:24:05, skipping insertion in model container [2024-11-08 19:24:05,748 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:24:05" (1/1) ... [2024-11-08 19:24:05,776 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 19:24:05,972 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c574f9-22c4-4928-a1a3-f19996331f0d/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-35.i[916,929] [2024-11-08 19:24:06,094 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:24:06,120 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 19:24:06,138 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c574f9-22c4-4928-a1a3-f19996331f0d/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-35.i[916,929] [2024-11-08 19:24:06,221 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:24:06,256 INFO L204 MainTranslator]: Completed translation [2024-11-08 19:24:06,257 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:24:06 WrapperNode [2024-11-08 19:24:06,257 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 19:24:06,258 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 19:24:06,258 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 19:24:06,259 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 19:24:06,266 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:24:06" (1/1) ... [2024-11-08 19:24:06,291 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:24:06" (1/1) ... [2024-11-08 19:24:06,349 INFO L138 Inliner]: procedures = 33, calls = 152, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 415 [2024-11-08 19:24:06,355 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 19:24:06,356 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 19:24:06,356 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 19:24:06,356 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 19:24:06,370 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:24:06" (1/1) ... [2024-11-08 19:24:06,370 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:24:06" (1/1) ... [2024-11-08 19:24:06,386 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:24:06" (1/1) ... [2024-11-08 19:24:06,429 INFO L175 MemorySlicer]: Split 118 memory accesses to 6 slices as follows [2, 31, 25, 33, 7, 20]. 28 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 4, 3, 4, 1, 3]. The 19 writes are split as follows [0, 5, 3, 4, 3, 4]. [2024-11-08 19:24:06,433 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:24:06" (1/1) ... [2024-11-08 19:24:06,433 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:24:06" (1/1) ... [2024-11-08 19:24:06,466 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:24:06" (1/1) ... [2024-11-08 19:24:06,475 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:24:06" (1/1) ... [2024-11-08 19:24:06,482 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:24:06" (1/1) ... [2024-11-08 19:24:06,487 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:24:06" (1/1) ... [2024-11-08 19:24:06,500 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 19:24:06,501 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 19:24:06,501 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 19:24:06,502 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 19:24:06,502 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:24:06" (1/1) ... [2024-11-08 19:24:06,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:24:06,533 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c574f9-22c4-4928-a1a3-f19996331f0d/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 19:24:06,551 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c574f9-22c4-4928-a1a3-f19996331f0d/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 19:24:06,562 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c574f9-22c4-4928-a1a3-f19996331f0d/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 19:24:06,595 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 19:24:06,595 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-08 19:24:06,596 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-08 19:24:06,596 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-08 19:24:06,596 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-08 19:24:06,598 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-11-08 19:24:06,598 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-11-08 19:24:06,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-11-08 19:24:06,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-11-08 19:24:06,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-11-08 19:24:06,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-11-08 19:24:06,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-11-08 19:24:06,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2024-11-08 19:24:06,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 19:24:06,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-08 19:24:06,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-08 19:24:06,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-08 19:24:06,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-08 19:24:06,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-11-08 19:24:06,601 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-08 19:24:06,602 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-08 19:24:06,603 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-11-08 19:24:06,603 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-11-08 19:24:06,603 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-11-08 19:24:06,603 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2024-11-08 19:24:06,604 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-08 19:24:06,604 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-08 19:24:06,604 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-11-08 19:24:06,604 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-11-08 19:24:06,605 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2024-11-08 19:24:06,605 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2024-11-08 19:24:06,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-08 19:24:06,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-08 19:24:06,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-11-08 19:24:06,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-11-08 19:24:06,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2024-11-08 19:24:06,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2024-11-08 19:24:06,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-11-08 19:24:06,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-11-08 19:24:06,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-11-08 19:24:06,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-11-08 19:24:06,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-11-08 19:24:06,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2024-11-08 19:24:06,608 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 19:24:06,608 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 19:24:06,608 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 19:24:06,608 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 19:24:06,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-08 19:24:06,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-08 19:24:06,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-08 19:24:06,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-08 19:24:06,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-11-08 19:24:06,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-11-08 19:24:06,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-08 19:24:06,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-08 19:24:06,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-11-08 19:24:06,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-11-08 19:24:06,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2024-11-08 19:24:06,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2024-11-08 19:24:06,813 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 19:24:06,816 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 19:24:07,963 INFO L? ?]: Removed 83 outVars from TransFormulas that were not future-live. [2024-11-08 19:24:07,963 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 19:24:07,982 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 19:24:07,982 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 19:24:07,983 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:24:07 BoogieIcfgContainer [2024-11-08 19:24:07,983 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 19:24:07,987 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 19:24:07,988 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 19:24:07,991 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 19:24:07,991 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 07:24:05" (1/3) ... [2024-11-08 19:24:07,992 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b1b969 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:24:07, skipping insertion in model container [2024-11-08 19:24:07,993 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:24:06" (2/3) ... [2024-11-08 19:24:07,994 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b1b969 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:24:07, skipping insertion in model container [2024-11-08 19:24:07,995 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:24:07" (3/3) ... [2024-11-08 19:24:07,996 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-35.i [2024-11-08 19:24:08,016 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 19:24:08,016 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 19:24:08,083 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 19:24:08,090 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@34af12de, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 19:24:08,091 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 19:24:08,096 INFO L276 IsEmpty]: Start isEmpty. Operand has 101 states, 80 states have (on average 1.375) internal successors, (110), 81 states have internal predecessors, (110), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 19:24:08,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-08 19:24:08,111 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:24:08,112 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:24:08,113 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:24:08,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:24:08,118 INFO L85 PathProgramCache]: Analyzing trace with hash 775566824, now seen corresponding path program 1 times [2024-11-08 19:24:08,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 19:24:08,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [56634395] [2024-11-08 19:24:08,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:24:08,133 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 19:24:08,133 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c574f9-22c4-4928-a1a3-f19996331f0d/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 19:24:08,136 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c574f9-22c4-4928-a1a3-f19996331f0d/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 19:24:08,138 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c574f9-22c4-4928-a1a3-f19996331f0d/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-08 19:24:08,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:08,655 INFO L255 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 19:24:08,673 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:24:08,732 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 314 proven. 0 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2024-11-08 19:24:08,736 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 19:24:08,737 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 19:24:08,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [56634395] [2024-11-08 19:24:08,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [56634395] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:24:08,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:24:08,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 19:24:08,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83404113] [2024-11-08 19:24:08,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:24:08,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 19:24:08,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 19:24:08,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 19:24:08,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 19:24:08,784 INFO L87 Difference]: Start difference. First operand has 101 states, 80 states have (on average 1.375) internal successors, (110), 81 states have internal predecessors, (110), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-08 19:24:08,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:24:08,818 INFO L93 Difference]: Finished difference Result 195 states and 304 transitions. [2024-11-08 19:24:08,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 19:24:08,820 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 143 [2024-11-08 19:24:08,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:24:08,828 INFO L225 Difference]: With dead ends: 195 [2024-11-08 19:24:08,829 INFO L226 Difference]: Without dead ends: 97 [2024-11-08 19:24:08,832 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 19:24:08,836 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 19:24:08,850 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 19:24:08,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-08 19:24:08,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2024-11-08 19:24:08,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 77 states have (on average 1.3246753246753247) internal successors, (102), 77 states have internal predecessors, (102), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 19:24:08,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 138 transitions. [2024-11-08 19:24:08,912 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 138 transitions. Word has length 143 [2024-11-08 19:24:08,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:24:08,912 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 138 transitions. [2024-11-08 19:24:08,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-08 19:24:08,913 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 138 transitions. [2024-11-08 19:24:08,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-08 19:24:08,918 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:24:08,918 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:24:08,926 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c574f9-22c4-4928-a1a3-f19996331f0d/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-08 19:24:09,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c574f9-22c4-4928-a1a3-f19996331f0d/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 19:24:09,119 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:24:09,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:24:09,121 INFO L85 PathProgramCache]: Analyzing trace with hash -1748773240, now seen corresponding path program 1 times [2024-11-08 19:24:09,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 19:24:09,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [490476965] [2024-11-08 19:24:09,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:24:09,123 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 19:24:09,123 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c574f9-22c4-4928-a1a3-f19996331f0d/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 19:24:09,127 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c574f9-22c4-4928-a1a3-f19996331f0d/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 19:24:09,128 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c574f9-22c4-4928-a1a3-f19996331f0d/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-08 19:24:09,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:09,701 INFO L255 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-08 19:24:09,716 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:24:09,797 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-11-08 19:24:10,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 19 [2024-11-08 19:24:11,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 60 [2024-11-08 19:24:11,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 19:24:11,513 INFO L378 Elim1Store]: Elim1 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 74 [2024-11-08 19:24:11,560 INFO L378 Elim1Store]: Elim1 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 20 [2024-11-08 19:24:11,668 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 19:24:11,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 17 [2024-11-08 19:24:11,704 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 201 proven. 42 refuted. 0 times theorem prover too weak. 369 trivial. 0 not checked. [2024-11-08 19:24:11,705 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 19:24:12,415 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 9 proven. 42 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-11-08 19:24:12,416 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 19:24:12,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [490476965] [2024-11-08 19:24:12,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [490476965] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 19:24:12,416 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 19:24:12,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2024-11-08 19:24:12,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070596501] [2024-11-08 19:24:12,417 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 19:24:12,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-08 19:24:12,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 19:24:12,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-08 19:24:12,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2024-11-08 19:24:12,421 INFO L87 Difference]: Start difference. First operand 97 states and 138 transitions. Second operand has 15 states, 13 states have (on average 7.615384615384615) internal successors, (99), 15 states have internal predecessors, (99), 6 states have call successors, (34), 3 states have call predecessors, (34), 5 states have return successors, (34), 4 states have call predecessors, (34), 6 states have call successors, (34) [2024-11-08 19:24:15,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:24:15,047 INFO L93 Difference]: Finished difference Result 307 states and 427 transitions. [2024-11-08 19:24:15,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-08 19:24:15,049 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 7.615384615384615) internal successors, (99), 15 states have internal predecessors, (99), 6 states have call successors, (34), 3 states have call predecessors, (34), 5 states have return successors, (34), 4 states have call predecessors, (34), 6 states have call successors, (34) Word has length 143 [2024-11-08 19:24:15,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:24:15,056 INFO L225 Difference]: With dead ends: 307 [2024-11-08 19:24:15,056 INFO L226 Difference]: Without dead ends: 213 [2024-11-08 19:24:15,057 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 271 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=284, Invalid=838, Unknown=0, NotChecked=0, Total=1122 [2024-11-08 19:24:15,058 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 257 mSDsluCounter, 585 mSDsCounter, 0 mSdLazyCounter, 419 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 718 SdHoareTripleChecker+Invalid, 479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-08 19:24:15,059 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 718 Invalid, 479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 419 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-08 19:24:15,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2024-11-08 19:24:15,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 194. [2024-11-08 19:24:15,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 152 states have (on average 1.3026315789473684) internal successors, (198), 153 states have internal predecessors, (198), 36 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-08 19:24:15,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 270 transitions. [2024-11-08 19:24:15,123 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 270 transitions. Word has length 143 [2024-11-08 19:24:15,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:24:15,124 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 270 transitions. [2024-11-08 19:24:15,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 7.615384615384615) internal successors, (99), 15 states have internal predecessors, (99), 6 states have call successors, (34), 3 states have call predecessors, (34), 5 states have return successors, (34), 4 states have call predecessors, (34), 6 states have call successors, (34) [2024-11-08 19:24:15,124 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 270 transitions. [2024-11-08 19:24:15,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-08 19:24:15,131 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:24:15,131 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:24:15,142 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c574f9-22c4-4928-a1a3-f19996331f0d/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-08 19:24:15,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c574f9-22c4-4928-a1a3-f19996331f0d/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 19:24:15,332 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:24:15,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:24:15,333 INFO L85 PathProgramCache]: Analyzing trace with hash 857250314, now seen corresponding path program 1 times [2024-11-08 19:24:15,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 19:24:15,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [76210400] [2024-11-08 19:24:15,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:24:15,334 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 19:24:15,334 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c574f9-22c4-4928-a1a3-f19996331f0d/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 19:24:15,338 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c574f9-22c4-4928-a1a3-f19996331f0d/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 19:24:15,339 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c574f9-22c4-4928-a1a3-f19996331f0d/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-08 19:24:15,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:24:15,903 INFO L255 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-08 19:24:15,912 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:24:16,450 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-08 19:24:17,280 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 32 [2024-11-08 19:24:22,108 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 19:24:22,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 200 treesize of output 107 [2024-11-08 19:24:24,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2024-11-08 19:24:24,475 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 19:24:24,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 335 treesize of output 131 [2024-11-08 19:24:27,071 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 292 proven. 72 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2024-11-08 19:24:27,071 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 19:24:40,567 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int#2| |c_~#float_Array_0~0.base|))) (let ((.cse2 (let ((.cse6 (select .cse5 (bvadd (_ bv4 32) |c_~#float_Array_0~0.offset|)))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6)))) (.cse1 (let ((.cse4 (select .cse5 |c_~#float_Array_0~0.offset|))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))) (let ((.cse3 (fp.add c_currentRoundingMode .cse2 .cse1))) (and (forall ((|v_skolemized_q#valueAsBitvector_24| (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_24|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_24|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_24|)))) (or (fp.geq (fp.mul c_currentRoundingMode .cse0 .cse1) .cse2) (not (= .cse0 .cse3))))) (or (not (= (_ bv0 8) ((_ extract 7 0) (select (select |c_#memory_int#1| |c_~#BOOL_unsigned_char_Array_0~0.base|) (bvadd (_ bv1 32) |c_~#BOOL_unsigned_char_Array_0~0.offset|))))) (forall ((|v_skolemized_q#valueAsBitvector_24| (_ BitVec 32))) (not (= (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_24|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_24|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_24|)) .cse3)))))))) is different from false [2024-11-08 19:24:53,387 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 19:24:53,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [76210400] [2024-11-08 19:24:53,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [76210400] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 19:24:53,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1415445345] [2024-11-08 19:24:53,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:24:53,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 19:24:53,388 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c574f9-22c4-4928-a1a3-f19996331f0d/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 19:24:53,390 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c574f9-22c4-4928-a1a3-f19996331f0d/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 19:24:53,392 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c574f9-22c4-4928-a1a3-f19996331f0d/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-08 19:25:02,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:25:02,056 INFO L255 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-08 19:25:02,068 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:25:13,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 32 [2024-11-08 19:26:02,174 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 19:26:02,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 200 treesize of output 107 [2024-11-08 19:26:17,981 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 292 proven. 72 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2024-11-08 19:26:17,982 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 19:27:40,121 WARN L249 Executor]: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c574f9-22c4-4928-a1a3-f19996331f0d/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2024-11-08 19:27:40,121 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c574f9-22c4-4928-a1a3-f19996331f0d/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 101 [2024-11-08 19:27:40,123 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-11-08 19:27:40,150 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c574f9-22c4-4928-a1a3-f19996331f0d/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-08 19:27:40,332 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c574f9-22c4-4928-a1a3-f19996331f0d/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-08 19:27:40,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c574f9-22c4-4928-a1a3-f19996331f0d/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c574f9-22c4-4928-a1a3-f19996331f0d/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 19:27:40,524 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c574f9-22c4-4928-a1a3-f19996331f0d/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:281) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.checkSat(ManagedScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:85) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:912) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:786) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:374) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:323) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:553) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:416) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:395) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:267) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:324) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:180) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:159) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:426) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:273) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 46 more [2024-11-08 19:27:40,528 INFO L158 Benchmark]: Toolchain (without parser) took 214789.57ms. Allocated memory was 62.9MB in the beginning and 136.3MB in the end (delta: 73.4MB). Free memory was 38.4MB in the beginning and 35.4MB in the end (delta: 2.9MB). Peak memory consumption was 77.6MB. Max. memory is 16.1GB. [2024-11-08 19:27:40,528 INFO L158 Benchmark]: CDTParser took 0.57ms. Allocated memory is still 62.9MB. Free memory was 38.8MB in the beginning and 38.7MB in the end (delta: 81.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 19:27:40,529 INFO L158 Benchmark]: CACSL2BoogieTranslator took 517.92ms. Allocated memory was 62.9MB in the beginning and 77.6MB in the end (delta: 14.7MB). Free memory was 38.2MB in the beginning and 49.1MB in the end (delta: -10.9MB). Peak memory consumption was 13.0MB. Max. memory is 16.1GB. [2024-11-08 19:27:40,529 INFO L158 Benchmark]: Boogie Procedure Inliner took 97.53ms. Allocated memory is still 77.6MB. Free memory was 49.1MB in the beginning and 45.6MB in the end (delta: 3.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 19:27:40,529 INFO L158 Benchmark]: Boogie Preprocessor took 144.46ms. Allocated memory is still 77.6MB. Free memory was 45.6MB in the beginning and 40.2MB in the end (delta: 5.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-08 19:27:40,530 INFO L158 Benchmark]: RCFGBuilder took 1481.80ms. Allocated memory is still 77.6MB. Free memory was 40.2MB in the beginning and 43.4MB in the end (delta: -3.3MB). Peak memory consumption was 15.6MB. Max. memory is 16.1GB. [2024-11-08 19:27:40,530 INFO L158 Benchmark]: TraceAbstraction took 212539.73ms. Allocated memory was 77.6MB in the beginning and 136.3MB in the end (delta: 58.7MB). Free memory was 42.7MB in the beginning and 35.4MB in the end (delta: 7.2MB). Peak memory consumption was 65.8MB. Max. memory is 16.1GB. [2024-11-08 19:27:40,532 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.57ms. Allocated memory is still 62.9MB. Free memory was 38.8MB in the beginning and 38.7MB in the end (delta: 81.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 517.92ms. Allocated memory was 62.9MB in the beginning and 77.6MB in the end (delta: 14.7MB). Free memory was 38.2MB in the beginning and 49.1MB in the end (delta: -10.9MB). Peak memory consumption was 13.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 97.53ms. Allocated memory is still 77.6MB. Free memory was 49.1MB in the beginning and 45.6MB in the end (delta: 3.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 144.46ms. Allocated memory is still 77.6MB. Free memory was 45.6MB in the beginning and 40.2MB in the end (delta: 5.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1481.80ms. Allocated memory is still 77.6MB. Free memory was 40.2MB in the beginning and 43.4MB in the end (delta: -3.3MB). Peak memory consumption was 15.6MB. Max. memory is 16.1GB. * TraceAbstraction took 212539.73ms. Allocated memory was 77.6MB in the beginning and 136.3MB in the end (delta: 58.7MB). Free memory was 42.7MB in the beginning and 35.4MB in the end (delta: 7.2MB). Peak memory consumption was 65.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c574f9-22c4-4928-a1a3-f19996331f0d/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c574f9-22c4-4928-a1a3-f19996331f0d/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38c574f9-22c4-4928-a1a3-f19996331f0d/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory")