./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-84.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_d9026e80-6c1b-4a5f-838c-91eb4af9f534/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9026e80-6c1b-4a5f-838c-91eb4af9f534/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_d9026e80-6c1b-4a5f-838c-91eb4af9f534/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9026e80-6c1b-4a5f-838c-91eb4af9f534/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-84.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9026e80-6c1b-4a5f-838c-91eb4af9f534/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_d9026e80-6c1b-4a5f-838c-91eb4af9f534/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 925e9b76051eff442eff54c72fd139be6e9d1af6b77433b45103df887e08e16e --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 16:45:33,506 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 16:45:33,574 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9026e80-6c1b-4a5f-838c-91eb4af9f534/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 16:45:33,578 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 16:45:33,579 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 16:45:33,614 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 16:45:33,615 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 16:45:33,616 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 16:45:33,617 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 16:45:33,618 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 16:45:33,619 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 16:45:33,619 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 16:45:33,620 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 16:45:33,620 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 16:45:33,621 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 16:45:33,621 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 16:45:33,621 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 16:45:33,622 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 16:45:33,622 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 16:45:33,622 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 16:45:33,622 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 16:45:33,623 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 16:45:33,623 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 16:45:33,624 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 16:45:33,624 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 16:45:33,625 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 16:45:33,625 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 16:45:33,625 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 16:45:33,626 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 16:45:33,626 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 16:45:33,627 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 16:45:33,627 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 16:45:33,628 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 16:45:33,628 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 16:45:33,628 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 16:45:33,629 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 16:45:33,629 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 16:45:33,630 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 16:45:33,630 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 16:45:33,630 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 16:45:33,631 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 16:45:33,631 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 16:45:33,634 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_d9026e80-6c1b-4a5f-838c-91eb4af9f534/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_d9026e80-6c1b-4a5f-838c-91eb4af9f534/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 -> 925e9b76051eff442eff54c72fd139be6e9d1af6b77433b45103df887e08e16e [2024-11-08 16:45:33,945 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 16:45:33,981 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 16:45:33,984 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 16:45:33,986 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 16:45:33,986 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 16:45:33,988 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9026e80-6c1b-4a5f-838c-91eb4af9f534/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-84.i Unable to find full path for "g++" [2024-11-08 16:45:36,110 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 16:45:36,394 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 16:45:36,395 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9026e80-6c1b-4a5f-838c-91eb4af9f534/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-84.i [2024-11-08 16:45:36,410 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9026e80-6c1b-4a5f-838c-91eb4af9f534/bin/uautomizer-verify-jihMAELWvX/data/1e3128338/4bd9ad0d93dd4167b86ce582093ccedd/FLAG4684aa3ee [2024-11-08 16:45:36,733 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9026e80-6c1b-4a5f-838c-91eb4af9f534/bin/uautomizer-verify-jihMAELWvX/data/1e3128338/4bd9ad0d93dd4167b86ce582093ccedd [2024-11-08 16:45:36,736 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 16:45:36,737 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 16:45:36,739 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 16:45:36,739 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 16:45:36,749 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 16:45:36,750 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 04:45:36" (1/1) ... [2024-11-08 16:45:36,751 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d19c57a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:45:36, skipping insertion in model container [2024-11-08 16:45:36,752 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 04:45:36" (1/1) ... [2024-11-08 16:45:36,803 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 16:45:37,083 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_d9026e80-6c1b-4a5f-838c-91eb4af9f534/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-84.i[919,932] [2024-11-08 16:45:37,208 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 16:45:37,227 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 16:45:37,245 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_d9026e80-6c1b-4a5f-838c-91eb4af9f534/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-84.i[919,932] [2024-11-08 16:45:37,298 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 16:45:37,332 INFO L204 MainTranslator]: Completed translation [2024-11-08 16:45:37,333 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:45:37 WrapperNode [2024-11-08 16:45:37,333 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 16:45:37,334 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 16:45:37,335 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 16:45:37,336 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 16:45:37,345 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:45:37" (1/1) ... [2024-11-08 16:45:37,362 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:45:37" (1/1) ... [2024-11-08 16:45:37,417 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 178 [2024-11-08 16:45:37,418 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 16:45:37,419 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 16:45:37,419 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 16:45:37,419 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 16:45:37,431 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:45:37" (1/1) ... [2024-11-08 16:45:37,431 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:45:37" (1/1) ... [2024-11-08 16:45:37,435 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:45:37" (1/1) ... [2024-11-08 16:45:37,455 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 16:45:37,455 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:45:37" (1/1) ... [2024-11-08 16:45:37,455 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:45:37" (1/1) ... [2024-11-08 16:45:37,465 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:45:37" (1/1) ... [2024-11-08 16:45:37,469 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:45:37" (1/1) ... [2024-11-08 16:45:37,473 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:45:37" (1/1) ... [2024-11-08 16:45:37,475 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:45:37" (1/1) ... [2024-11-08 16:45:37,480 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 16:45:37,481 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 16:45:37,481 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 16:45:37,481 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 16:45:37,482 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:45:37" (1/1) ... [2024-11-08 16:45:37,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 16:45:37,511 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9026e80-6c1b-4a5f-838c-91eb4af9f534/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:45:37,536 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9026e80-6c1b-4a5f-838c-91eb4af9f534/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 16:45:37,543 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9026e80-6c1b-4a5f-838c-91eb4af9f534/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 16:45:37,577 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 16:45:37,577 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 16:45:37,579 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 16:45:37,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 16:45:37,579 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 16:45:37,579 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 16:45:37,693 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 16:45:37,696 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 16:45:38,277 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-11-08 16:45:38,278 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 16:45:38,295 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 16:45:38,295 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 16:45:38,296 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:45:38 BoogieIcfgContainer [2024-11-08 16:45:38,296 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 16:45:38,299 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 16:45:38,300 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 16:45:38,304 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 16:45:38,304 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 04:45:36" (1/3) ... [2024-11-08 16:45:38,305 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e92261a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 04:45:38, skipping insertion in model container [2024-11-08 16:45:38,305 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:45:37" (2/3) ... [2024-11-08 16:45:38,306 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e92261a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 04:45:38, skipping insertion in model container [2024-11-08 16:45:38,306 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:45:38" (3/3) ... [2024-11-08 16:45:38,308 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-84.i [2024-11-08 16:45:38,331 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 16:45:38,332 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 16:45:38,420 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 16:45:38,427 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;@60329c6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 16:45:38,428 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 16:45:38,440 INFO L276 IsEmpty]: Start isEmpty. Operand has 78 states, 53 states have (on average 1.4339622641509433) internal successors, (76), 54 states have internal predecessors, (76), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-08 16:45:38,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-08 16:45:38,464 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:45:38,465 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:45:38,466 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:45:38,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:45:38,475 INFO L85 PathProgramCache]: Analyzing trace with hash -869714480, now seen corresponding path program 1 times [2024-11-08 16:45:38,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:45:38,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405049630] [2024-11-08 16:45:38,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:45:38,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:45:38,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:38,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:45:38,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:38,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 16:45:38,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:38,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 16:45:38,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:38,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 16:45:38,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:38,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 16:45:38,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:38,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 16:45:38,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:38,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 16:45:38,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:38,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 16:45:38,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:38,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 16:45:38,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:38,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 16:45:38,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:38,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:45:38,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:38,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-08 16:45:38,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:38,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 16:45:38,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:38,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-08 16:45:38,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:38,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 16:45:38,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:38,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 16:45:38,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:38,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-08 16:45:38,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:38,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-08 16:45:38,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:38,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-08 16:45:38,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:38,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-08 16:45:38,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:38,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 16:45:38,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:38,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 16:45:39,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:39,010 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-08 16:45:39,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:45:39,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405049630] [2024-11-08 16:45:39,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405049630] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:45:39,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:45:39,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 16:45:39,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104237350] [2024-11-08 16:45:39,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:45:39,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 16:45:39,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:45:39,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 16:45:39,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 16:45:39,064 INFO L87 Difference]: Start difference. First operand has 78 states, 53 states have (on average 1.4339622641509433) internal successors, (76), 54 states have internal predecessors, (76), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-08 16:45:39,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:45:39,103 INFO L93 Difference]: Finished difference Result 149 states and 256 transitions. [2024-11-08 16:45:39,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 16:45:39,106 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) Word has length 142 [2024-11-08 16:45:39,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:45:39,119 INFO L225 Difference]: With dead ends: 149 [2024-11-08 16:45:39,119 INFO L226 Difference]: Without dead ends: 74 [2024-11-08 16:45:39,124 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 68 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 16:45:39,128 INFO L432 NwaCegarLoop]: 113 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, 113 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 16:45:39,129 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 16:45:39,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-08 16:45:39,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2024-11-08 16:45:39,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 50 states have (on average 1.38) internal successors, (69), 50 states have internal predecessors, (69), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-08 16:45:39,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 113 transitions. [2024-11-08 16:45:39,187 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 113 transitions. Word has length 142 [2024-11-08 16:45:39,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:45:39,188 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 113 transitions. [2024-11-08 16:45:39,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-08 16:45:39,188 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 113 transitions. [2024-11-08 16:45:39,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-08 16:45:39,193 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:45:39,193 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:45:39,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 16:45:39,194 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:45:39,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:45:39,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1867739024, now seen corresponding path program 1 times [2024-11-08 16:45:39,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:45:39,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881869156] [2024-11-08 16:45:39,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:45:39,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:45:39,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:39,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:45:39,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:39,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 16:45:39,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:39,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 16:45:39,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:39,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 16:45:39,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:39,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 16:45:39,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:39,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 16:45:39,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:39,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 16:45:39,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:39,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 16:45:39,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:39,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 16:45:39,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:39,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 16:45:39,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:39,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:45:39,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:39,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-08 16:45:39,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:39,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 16:45:39,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:39,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-08 16:45:39,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:39,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 16:45:39,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:39,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 16:45:39,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:39,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-08 16:45:39,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:39,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-08 16:45:39,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:39,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-08 16:45:39,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:39,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-08 16:45:39,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:39,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 16:45:39,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:39,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 16:45:39,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:39,890 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-08 16:45:39,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:45:39,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881869156] [2024-11-08 16:45:39,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881869156] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:45:39,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:45:39,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 16:45:39,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115714353] [2024-11-08 16:45:39,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:45:39,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 16:45:39,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:45:39,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 16:45:39,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:45:39,898 INFO L87 Difference]: Start difference. First operand 74 states and 113 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-08 16:45:39,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:45:39,949 INFO L93 Difference]: Finished difference Result 145 states and 223 transitions. [2024-11-08 16:45:39,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 16:45:39,951 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 142 [2024-11-08 16:45:39,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:45:39,954 INFO L225 Difference]: With dead ends: 145 [2024-11-08 16:45:39,954 INFO L226 Difference]: Without dead ends: 74 [2024-11-08 16:45:39,955 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:45:39,956 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 110 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:45:39,960 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 109 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 16:45:39,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-08 16:45:39,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2024-11-08 16:45:39,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 50 states have (on average 1.36) internal successors, (68), 50 states have internal predecessors, (68), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-08 16:45:39,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 112 transitions. [2024-11-08 16:45:39,982 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 112 transitions. Word has length 142 [2024-11-08 16:45:39,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:45:39,987 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 112 transitions. [2024-11-08 16:45:39,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-08 16:45:39,988 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 112 transitions. [2024-11-08 16:45:39,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-08 16:45:39,992 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:45:39,993 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:45:39,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 16:45:39,994 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:45:39,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:45:39,995 INFO L85 PathProgramCache]: Analyzing trace with hash -1726163694, now seen corresponding path program 1 times [2024-11-08 16:45:39,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:45:39,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680633008] [2024-11-08 16:45:39,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:45:39,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:45:40,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:44,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:45:44,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:44,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 16:45:44,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:44,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 16:45:44,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:44,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 16:45:44,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:44,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 16:45:44,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:44,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 16:45:44,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:44,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 16:45:44,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:44,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 16:45:44,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:44,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 16:45:44,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:44,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 16:45:44,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:44,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:45:44,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:44,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-08 16:45:44,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:44,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 16:45:44,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:44,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-08 16:45:44,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:44,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 16:45:44,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:44,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 16:45:44,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:44,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-08 16:45:44,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:44,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-08 16:45:44,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:44,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-08 16:45:44,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:44,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-08 16:45:44,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:44,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 16:45:44,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:44,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 16:45:44,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:44,924 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-08 16:45:44,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:45:44,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680633008] [2024-11-08 16:45:44,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680633008] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:45:44,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:45:44,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 16:45:44,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343602138] [2024-11-08 16:45:44,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:45:44,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 16:45:44,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:45:44,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 16:45:44,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 16:45:44,931 INFO L87 Difference]: Start difference. First operand 74 states and 112 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-08 16:45:46,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:45:46,173 INFO L93 Difference]: Finished difference Result 179 states and 266 transitions. [2024-11-08 16:45:46,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 16:45:46,174 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 142 [2024-11-08 16:45:46,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:45:46,176 INFO L225 Difference]: With dead ends: 179 [2024-11-08 16:45:46,176 INFO L226 Difference]: Without dead ends: 108 [2024-11-08 16:45:46,177 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-08 16:45:46,178 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 69 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 16:45:46,179 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 285 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 16:45:46,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-08 16:45:46,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 105. [2024-11-08 16:45:46,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 76 states have (on average 1.3421052631578947) internal successors, (102), 77 states have internal predecessors, (102), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-08 16:45:46,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 154 transitions. [2024-11-08 16:45:46,200 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 154 transitions. Word has length 142 [2024-11-08 16:45:46,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:45:46,201 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 154 transitions. [2024-11-08 16:45:46,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-08 16:45:46,201 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 154 transitions. [2024-11-08 16:45:46,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-08 16:45:46,203 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:45:46,204 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:45:46,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 16:45:46,204 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:45:46,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:45:46,205 INFO L85 PathProgramCache]: Analyzing trace with hash 914257881, now seen corresponding path program 1 times [2024-11-08 16:45:46,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:45:46,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728019502] [2024-11-08 16:45:46,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:45:46,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:45:46,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:53,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:45:53,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:53,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 16:45:53,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:53,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 16:45:53,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:53,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 16:45:53,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:53,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 16:45:53,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:53,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 16:45:53,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:53,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 16:45:53,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:53,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 16:45:53,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:53,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 16:45:53,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:53,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 16:45:53,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:53,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:45:53,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:53,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-08 16:45:53,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:53,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 16:45:53,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:53,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-08 16:45:53,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:53,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 16:45:53,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:53,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 16:45:53,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:53,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-08 16:45:53,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:53,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-08 16:45:53,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:53,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-08 16:45:53,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:53,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-08 16:45:53,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:53,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 16:45:53,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:53,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 16:45:53,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:53,863 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-08 16:45:53,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:45:53,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728019502] [2024-11-08 16:45:53,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728019502] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:45:53,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:45:53,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 16:45:53,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469158640] [2024-11-08 16:45:53,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:45:53,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 16:45:53,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:45:53,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 16:45:53,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-08 16:45:53,866 INFO L87 Difference]: Start difference. First operand 105 states and 154 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-08 16:45:54,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:45:54,533 INFO L93 Difference]: Finished difference Result 215 states and 311 transitions. [2024-11-08 16:45:54,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 16:45:54,534 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 143 [2024-11-08 16:45:54,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:45:54,537 INFO L225 Difference]: With dead ends: 215 [2024-11-08 16:45:54,537 INFO L226 Difference]: Without dead ends: 113 [2024-11-08 16:45:54,541 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-08 16:45:54,543 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 67 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 16:45:54,543 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 223 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 16:45:54,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-08 16:45:54,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2024-11-08 16:45:54,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 82 states have (on average 1.3048780487804879) internal successors, (107), 83 states have internal predecessors, (107), 26 states have call successors, (26), 4 states have call predecessors, (26), 4 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-08 16:45:54,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 159 transitions. [2024-11-08 16:45:54,584 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 159 transitions. Word has length 143 [2024-11-08 16:45:54,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:45:54,585 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 159 transitions. [2024-11-08 16:45:54,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-08 16:45:54,585 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 159 transitions. [2024-11-08 16:45:54,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-08 16:45:54,591 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:45:54,592 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:45:54,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 16:45:54,592 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:45:54,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:45:54,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1195098771, now seen corresponding path program 1 times [2024-11-08 16:45:54,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:45:54,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974973748] [2024-11-08 16:45:54,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:45:54,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:45:54,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:57,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:45:57,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:57,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 16:45:57,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:57,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 16:45:57,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:57,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 16:45:57,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:57,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 16:45:57,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:57,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 16:45:57,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:57,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 16:45:57,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:57,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 16:45:57,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:57,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 16:45:57,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:57,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 16:45:57,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:57,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:45:57,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:57,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-08 16:45:57,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:57,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 16:45:57,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:57,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-08 16:45:57,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:57,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 16:45:57,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:57,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 16:45:57,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:57,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-08 16:45:57,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:57,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-08 16:45:57,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:57,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-08 16:45:57,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:57,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-08 16:45:57,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:57,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 16:45:57,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:57,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 16:45:57,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:45:57,966 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-08 16:45:57,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:45:57,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974973748] [2024-11-08 16:45:57,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974973748] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:45:57,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:45:57,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 16:45:57,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520354867] [2024-11-08 16:45:57,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:45:57,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 16:45:57,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:45:57,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 16:45:57,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-08 16:45:57,969 INFO L87 Difference]: Start difference. First operand 113 states and 159 transitions. Second operand has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-08 16:45:59,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:45:59,458 INFO L93 Difference]: Finished difference Result 318 states and 446 transitions. [2024-11-08 16:45:59,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 16:45:59,459 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 144 [2024-11-08 16:45:59,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:45:59,461 INFO L225 Difference]: With dead ends: 318 [2024-11-08 16:45:59,462 INFO L226 Difference]: Without dead ends: 208 [2024-11-08 16:45:59,462 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-11-08 16:45:59,464 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 60 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-08 16:45:59,465 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 528 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-08 16:45:59,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2024-11-08 16:45:59,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 140. [2024-11-08 16:45:59,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 109 states have (on average 1.3394495412844036) internal successors, (146), 110 states have internal predecessors, (146), 26 states have call successors, (26), 4 states have call predecessors, (26), 4 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-08 16:45:59,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 198 transitions. [2024-11-08 16:45:59,508 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 198 transitions. Word has length 144 [2024-11-08 16:45:59,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:45:59,512 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 198 transitions. [2024-11-08 16:45:59,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-08 16:45:59,512 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 198 transitions. [2024-11-08 16:45:59,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-08 16:45:59,514 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:45:59,515 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:45:59,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 16:45:59,516 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:45:59,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:45:59,517 INFO L85 PathProgramCache]: Analyzing trace with hash -1453264209, now seen corresponding path program 1 times [2024-11-08 16:45:59,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:45:59,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771033199] [2024-11-08 16:45:59,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:45:59,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:45:59,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:02,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:46:02,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:02,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 16:46:02,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:02,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 16:46:02,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:02,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 16:46:02,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:02,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 16:46:02,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:02,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 16:46:02,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:02,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 16:46:02,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:02,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 16:46:02,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:02,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 16:46:02,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:02,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 16:46:02,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:02,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:46:02,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:02,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-08 16:46:02,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:02,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 16:46:02,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:02,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-08 16:46:02,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:02,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 16:46:02,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:02,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 16:46:02,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:02,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-08 16:46:02,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:02,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-08 16:46:02,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:02,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-08 16:46:02,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:02,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-08 16:46:02,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:02,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 16:46:02,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:02,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 16:46:02,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:02,716 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-08 16:46:02,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:46:02,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771033199] [2024-11-08 16:46:02,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771033199] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:46:02,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:46:02,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 16:46:02,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541491702] [2024-11-08 16:46:02,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:46:02,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 16:46:02,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:46:02,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 16:46:02,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-08 16:46:02,720 INFO L87 Difference]: Start difference. First operand 140 states and 198 transitions. Second operand has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-08 16:46:03,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:46:03,386 INFO L93 Difference]: Finished difference Result 322 states and 453 transitions. [2024-11-08 16:46:03,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 16:46:03,387 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 144 [2024-11-08 16:46:03,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:46:03,389 INFO L225 Difference]: With dead ends: 322 [2024-11-08 16:46:03,390 INFO L226 Difference]: Without dead ends: 185 [2024-11-08 16:46:03,391 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-08 16:46:03,392 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 58 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 16:46:03,392 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 386 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 16:46:03,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2024-11-08 16:46:03,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 140. [2024-11-08 16:46:03,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 109 states have (on average 1.3394495412844036) internal successors, (146), 110 states have internal predecessors, (146), 26 states have call successors, (26), 4 states have call predecessors, (26), 4 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-08 16:46:03,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 198 transitions. [2024-11-08 16:46:03,416 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 198 transitions. Word has length 144 [2024-11-08 16:46:03,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:46:03,416 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 198 transitions. [2024-11-08 16:46:03,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-08 16:46:03,417 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 198 transitions. [2024-11-08 16:46:03,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-08 16:46:03,419 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:46:03,419 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:46:03,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 16:46:03,420 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:46:03,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:46:03,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1904663793, now seen corresponding path program 1 times [2024-11-08 16:46:03,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:46:03,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89054940] [2024-11-08 16:46:03,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:46:03,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:46:03,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:03,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:46:03,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:03,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 16:46:03,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:03,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 16:46:03,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:03,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 16:46:03,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:03,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 16:46:03,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:03,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 16:46:03,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:03,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 16:46:03,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:03,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 16:46:03,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:03,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 16:46:03,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:03,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 16:46:03,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:03,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:46:03,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:03,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-08 16:46:03,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:03,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 16:46:03,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:03,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-08 16:46:03,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:03,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 16:46:03,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:03,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 16:46:03,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:03,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-08 16:46:03,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:03,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-08 16:46:03,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:03,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-08 16:46:03,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:03,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-08 16:46:03,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:03,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 16:46:03,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:03,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 16:46:03,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:03,561 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-08 16:46:03,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:46:03,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89054940] [2024-11-08 16:46:03,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89054940] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:46:03,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:46:03,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 16:46:03,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597986770] [2024-11-08 16:46:03,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:46:03,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 16:46:03,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:46:03,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 16:46:03,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:46:03,564 INFO L87 Difference]: Start difference. First operand 140 states and 198 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-08 16:46:03,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:46:03,694 INFO L93 Difference]: Finished difference Result 340 states and 477 transitions. [2024-11-08 16:46:03,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 16:46:03,695 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 145 [2024-11-08 16:46:03,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:46:03,697 INFO L225 Difference]: With dead ends: 340 [2024-11-08 16:46:03,697 INFO L226 Difference]: Without dead ends: 203 [2024-11-08 16:46:03,698 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:46:03,699 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 39 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 16:46:03,699 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 167 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 16:46:03,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2024-11-08 16:46:03,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 161. [2024-11-08 16:46:03,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 130 states have (on average 1.3461538461538463) internal successors, (175), 131 states have internal predecessors, (175), 26 states have call successors, (26), 4 states have call predecessors, (26), 4 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-08 16:46:03,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 227 transitions. [2024-11-08 16:46:03,724 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 227 transitions. Word has length 145 [2024-11-08 16:46:03,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:46:03,724 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 227 transitions. [2024-11-08 16:46:03,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-08 16:46:03,725 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 227 transitions. [2024-11-08 16:46:03,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-08 16:46:03,727 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:46:03,727 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:46:03,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 16:46:03,727 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:46:03,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:46:03,728 INFO L85 PathProgramCache]: Analyzing trace with hash 704965842, now seen corresponding path program 1 times [2024-11-08 16:46:03,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:46:03,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622987807] [2024-11-08 16:46:03,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:46:03,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:46:03,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:03,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:46:03,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:03,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 16:46:03,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:03,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 16:46:03,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:03,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 16:46:03,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:03,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 16:46:03,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:03,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 16:46:04,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:04,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 16:46:04,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:04,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 16:46:04,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:04,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 16:46:04,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:04,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 16:46:04,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:04,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:46:04,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:04,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-08 16:46:04,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:04,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 16:46:04,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:04,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-08 16:46:04,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:04,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 16:46:04,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:04,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 16:46:04,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:04,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-08 16:46:04,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:04,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-08 16:46:04,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:04,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-08 16:46:04,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:04,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-08 16:46:04,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:04,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 16:46:04,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:04,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 16:46:04,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:04,094 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-08 16:46:04,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:46:04,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622987807] [2024-11-08 16:46:04,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622987807] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:46:04,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:46:04,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 16:46:04,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589050728] [2024-11-08 16:46:04,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:46:04,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 16:46:04,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:46:04,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 16:46:04,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 16:46:04,097 INFO L87 Difference]: Start difference. First operand 161 states and 227 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-08 16:46:04,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:46:04,352 INFO L93 Difference]: Finished difference Result 447 states and 632 transitions. [2024-11-08 16:46:04,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 16:46:04,353 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 145 [2024-11-08 16:46:04,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:46:04,359 INFO L225 Difference]: With dead ends: 447 [2024-11-08 16:46:04,360 INFO L226 Difference]: Without dead ends: 289 [2024-11-08 16:46:04,363 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-08 16:46:04,364 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 84 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 16:46:04,364 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 371 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 16:46:04,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2024-11-08 16:46:04,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 209. [2024-11-08 16:46:04,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 153 states have (on average 1.3006535947712419) internal successors, (199), 154 states have internal predecessors, (199), 48 states have call successors, (48), 7 states have call predecessors, (48), 7 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-08 16:46:04,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 295 transitions. [2024-11-08 16:46:04,425 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 295 transitions. Word has length 145 [2024-11-08 16:46:04,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:46:04,427 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 295 transitions. [2024-11-08 16:46:04,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-08 16:46:04,428 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 295 transitions. [2024-11-08 16:46:04,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-08 16:46:04,430 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:46:04,430 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:46:04,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 16:46:04,431 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:46:04,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:46:04,431 INFO L85 PathProgramCache]: Analyzing trace with hash 813258724, now seen corresponding path program 1 times [2024-11-08 16:46:04,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:46:04,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277830800] [2024-11-08 16:46:04,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:46:04,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:46:04,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:04,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:46:04,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:04,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 16:46:04,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:04,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 16:46:04,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:04,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 16:46:04,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:04,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 16:46:04,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:04,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 16:46:04,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:04,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 16:46:04,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:04,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 16:46:04,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:04,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 16:46:04,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:04,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 16:46:04,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:04,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:46:04,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:04,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-08 16:46:04,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:04,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 16:46:04,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:04,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-08 16:46:04,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:04,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 16:46:04,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:04,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 16:46:04,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:04,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-08 16:46:04,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:04,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-08 16:46:04,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:04,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-08 16:46:04,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:04,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-08 16:46:04,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:04,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 16:46:04,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:04,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 16:46:04,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:04,580 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-08 16:46:04,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:46:04,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277830800] [2024-11-08 16:46:04,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277830800] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:46:04,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:46:04,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 16:46:04,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746641893] [2024-11-08 16:46:04,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:46:04,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 16:46:04,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:46:04,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 16:46:04,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:46:04,583 INFO L87 Difference]: Start difference. First operand 209 states and 295 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-08 16:46:04,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:46:04,728 INFO L93 Difference]: Finished difference Result 409 states and 570 transitions. [2024-11-08 16:46:04,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 16:46:04,729 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 145 [2024-11-08 16:46:04,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:46:04,732 INFO L225 Difference]: With dead ends: 409 [2024-11-08 16:46:04,732 INFO L226 Difference]: Without dead ends: 251 [2024-11-08 16:46:04,733 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:46:04,733 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 46 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 16:46:04,734 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 184 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 16:46:04,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2024-11-08 16:46:04,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 209. [2024-11-08 16:46:04,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 153 states have (on average 1.2875816993464053) internal successors, (197), 154 states have internal predecessors, (197), 48 states have call successors, (48), 7 states have call predecessors, (48), 7 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-08 16:46:04,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 293 transitions. [2024-11-08 16:46:04,768 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 293 transitions. Word has length 145 [2024-11-08 16:46:04,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:46:04,769 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 293 transitions. [2024-11-08 16:46:04,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-08 16:46:04,769 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 293 transitions. [2024-11-08 16:46:04,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-08 16:46:04,771 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:46:04,771 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:46:04,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 16:46:04,771 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:46:04,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:46:04,771 INFO L85 PathProgramCache]: Analyzing trace with hash 1727165384, now seen corresponding path program 1 times [2024-11-08 16:46:04,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:46:04,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64851034] [2024-11-08 16:46:04,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:46:04,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:46:04,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 16:46:04,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1269903312] [2024-11-08 16:46:04,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:46:04,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:46:04,869 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9026e80-6c1b-4a5f-838c-91eb4af9f534/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:46:04,871 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9026e80-6c1b-4a5f-838c-91eb4af9f534/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 16:46:04,877 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9026e80-6c1b-4a5f-838c-91eb4af9f534/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 16:46:05,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 16:46:05,070 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 16:46:05,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 16:46:05,339 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 16:46:05,340 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 16:46:05,341 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 16:46:05,368 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9026e80-6c1b-4a5f-838c-91eb4af9f534/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 16:46:05,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9026e80-6c1b-4a5f-838c-91eb4af9f534/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-08 16:46:05,551 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:46:05,666 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 16:46:05,670 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 04:46:05 BoogieIcfgContainer [2024-11-08 16:46:05,670 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 16:46:05,670 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 16:46:05,671 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 16:46:05,671 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 16:46:05,671 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:45:38" (3/4) ... [2024-11-08 16:46:05,674 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 16:46:05,675 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 16:46:05,676 INFO L158 Benchmark]: Toolchain (without parser) took 28938.73ms. Allocated memory was 169.9MB in the beginning and 358.6MB in the end (delta: 188.7MB). Free memory was 135.8MB in the beginning and 282.4MB in the end (delta: -146.6MB). Peak memory consumption was 45.1MB. Max. memory is 16.1GB. [2024-11-08 16:46:05,676 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 113.2MB. Free memory was 80.1MB in the beginning and 80.1MB in the end (delta: 27.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 16:46:05,677 INFO L158 Benchmark]: CACSL2BoogieTranslator took 594.52ms. Allocated memory is still 169.9MB. Free memory was 135.8MB in the beginning and 119.6MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-08 16:46:05,677 INFO L158 Benchmark]: Boogie Procedure Inliner took 83.81ms. Allocated memory is still 169.9MB. Free memory was 119.6MB in the beginning and 116.2MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 16:46:05,678 INFO L158 Benchmark]: Boogie Preprocessor took 61.22ms. Allocated memory is still 169.9MB. Free memory was 116.2MB in the beginning and 111.2MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 16:46:05,678 INFO L158 Benchmark]: RCFGBuilder took 815.52ms. Allocated memory is still 169.9MB. Free memory was 111.2MB in the beginning and 86.1MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-08 16:46:05,678 INFO L158 Benchmark]: TraceAbstraction took 27370.70ms. Allocated memory was 169.9MB in the beginning and 358.6MB in the end (delta: 188.7MB). Free memory was 85.5MB in the beginning and 282.4MB in the end (delta: -197.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 16:46:05,679 INFO L158 Benchmark]: Witness Printer took 5.16ms. Allocated memory is still 358.6MB. Free memory is still 282.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 16:46:05,680 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.34ms. Allocated memory is still 113.2MB. Free memory was 80.1MB in the beginning and 80.1MB in the end (delta: 27.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 594.52ms. Allocated memory is still 169.9MB. Free memory was 135.8MB in the beginning and 119.6MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 83.81ms. Allocated memory is still 169.9MB. Free memory was 119.6MB in the beginning and 116.2MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 61.22ms. Allocated memory is still 169.9MB. Free memory was 116.2MB in the beginning and 111.2MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 815.52ms. Allocated memory is still 169.9MB. Free memory was 111.2MB in the beginning and 86.1MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 27370.70ms. Allocated memory was 169.9MB in the beginning and 358.6MB in the end (delta: 188.7MB). Free memory was 85.5MB in the beginning and 282.4MB in the end (delta: -197.0MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 5.16ms. Allocated memory is still 358.6MB. Free memory is still 282.4MB. 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 someBinaryDOUBLEComparisonOperation at line 115. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = -10; [L23] signed char var_1_3 = -16; [L24] signed char var_1_4 = 50; [L25] signed char var_1_5 = 4; [L26] unsigned long int var_1_6 = 50; [L27] signed long int var_1_7 = -8; [L28] signed long int var_1_8 = -4; [L29] signed char var_1_9 = 50; [L30] unsigned char var_1_10 = 128; [L31] unsigned char var_1_11 = 5; [L32] unsigned long int var_1_12 = 10; [L33] signed char var_1_13 = 16; [L34] unsigned short int var_1_15 = 128; [L35] signed long int var_1_16 = 2; [L36] unsigned short int var_1_17 = 61498; [L37] unsigned long int var_1_18 = 1; [L38] unsigned char var_1_19 = 0; [L39] double var_1_20 = 4.9; [L40] double var_1_21 = 1.5; [L41] unsigned short int last_1_var_1_15 = 128; VAL [isInitial=0, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-16, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L119] isInitial = 1 [L120] FCALL initially() [L121] COND TRUE 1 [L122] CALL updateLastVariables() [L112] last_1_var_1_15 = var_1_15 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-16, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L122] RET updateLastVariables() [L123] CALL updateVariables() [L78] var_1_3 = __VERIFIER_nondet_char() [L79] CALL assume_abort_if_not(var_1_3 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-3, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-3, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L79] RET assume_abort_if_not(var_1_3 >= -63) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-3, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L80] CALL assume_abort_if_not(var_1_3 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-3, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-3, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L80] RET assume_abort_if_not(var_1_3 <= 63) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-3, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L81] var_1_4 = __VERIFIER_nondet_char() [L82] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-3, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-3, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L82] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-3, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L83] CALL assume_abort_if_not(var_1_4 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-3, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-3, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L83] RET assume_abort_if_not(var_1_4 <= 63) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-3, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L84] var_1_5 = __VERIFIER_nondet_char() [L85] CALL assume_abort_if_not(var_1_5 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-3, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-3, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L85] RET assume_abort_if_not(var_1_5 >= -127) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-3, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L86] CALL assume_abort_if_not(var_1_5 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-3, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-3, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L86] RET assume_abort_if_not(var_1_5 <= 126) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-3, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L87] var_1_7 = __VERIFIER_nondet_long() [L88] CALL assume_abort_if_not(var_1_7 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-3, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-3, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-4, var_1_9=50] [L88] RET assume_abort_if_not(var_1_7 >= -2147483648) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-3, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-4, var_1_9=50] [L89] CALL assume_abort_if_not(var_1_7 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-3, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-3, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-4, var_1_9=50] [L89] RET assume_abort_if_not(var_1_7 <= 2147483647) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-3, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-4, var_1_9=50] [L90] CALL assume_abort_if_not(var_1_7 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-3, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-3, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-4, var_1_9=50] [L90] RET assume_abort_if_not(var_1_7 != 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-3, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-4, var_1_9=50] [L91] var_1_8 = __VERIFIER_nondet_long() [L92] CALL assume_abort_if_not(var_1_8 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-3, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-3, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-2147483647, var_1_9=50] [L92] RET assume_abort_if_not(var_1_8 >= -2147483648) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-3, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-2147483647, var_1_9=50] [L93] CALL assume_abort_if_not(var_1_8 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-3, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-3, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-2147483647, var_1_9=50] [L93] RET assume_abort_if_not(var_1_8 <= 2147483647) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-3, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-2147483647, var_1_9=50] [L94] CALL assume_abort_if_not(var_1_8 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-3, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-3, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-2147483647, var_1_9=50] [L94] RET assume_abort_if_not(var_1_8 != 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-3, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-2147483647, var_1_9=50] [L95] var_1_10 = __VERIFIER_nondet_uchar() [L96] CALL assume_abort_if_not(var_1_10 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-3, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-3, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-2147483647, var_1_9=50] [L96] RET assume_abort_if_not(var_1_10 >= 127) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-3, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-2147483647, var_1_9=50] [L97] CALL assume_abort_if_not(var_1_10 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-3, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-3, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-2147483647, var_1_9=50] [L97] RET assume_abort_if_not(var_1_10 <= 255) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-3, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-2147483647, var_1_9=50] [L98] var_1_11 = __VERIFIER_nondet_uchar() [L99] CALL assume_abort_if_not(var_1_11 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-254, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-3, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-254, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-3, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-2147483647, var_1_9=50] [L99] RET assume_abort_if_not(var_1_11 >= 1) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-254, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-3, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-2147483647, var_1_9=50] [L100] CALL assume_abort_if_not(var_1_11 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-254, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-3, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-254, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-3, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-2147483647, var_1_9=50] [L100] RET assume_abort_if_not(var_1_11 <= 126) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-254, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-3, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-2147483647, var_1_9=50] [L101] CALL assume_abort_if_not(var_1_11 != 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-254, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-3, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-254, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-3, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-2147483647, var_1_9=50] [L101] RET assume_abort_if_not(var_1_11 != 127) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-254, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-3, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-2147483647, var_1_9=50] [L102] var_1_16 = __VERIFIER_nondet_long() [L103] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-254, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-3, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-254, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-3, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-2147483647, var_1_9=50] [L103] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-254, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-3, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-2147483647, var_1_9=50] [L104] CALL assume_abort_if_not(var_1_16 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-254, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-3, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-254, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-3, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-2147483647, var_1_9=50] [L104] RET assume_abort_if_not(var_1_16 <= 2147483647) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-254, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-3, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-2147483647, var_1_9=50] [L105] var_1_17 = __VERIFIER_nondet_ushort() [L106] CALL assume_abort_if_not(var_1_17 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-254, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=98304, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-3, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-254, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=98304, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-3, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-2147483647, var_1_9=50] [L106] RET assume_abort_if_not(var_1_17 >= 32767) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-254, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=98304, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-3, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-2147483647, var_1_9=50] [L107] CALL assume_abort_if_not(var_1_17 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-254, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=98304, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-3, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-254, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=98304, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-3, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-2147483647, var_1_9=50] [L107] RET assume_abort_if_not(var_1_17 <= 65534) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-254, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=98304, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-3, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-2147483647, var_1_9=50] [L108] var_1_21 = __VERIFIER_nondet_double() [L109] CALL assume_abort_if_not((var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-254, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=98304, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_3=-3, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-254, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=98304, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_3=-3, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-2147483647, var_1_9=50] [L109] RET assume_abort_if_not((var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-254, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=98304, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_3=-3, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-2147483647, var_1_9=50] [L123] RET updateVariables() [L124] CALL step() [L45] EXPR var_1_8 & var_1_4 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-254, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=98304, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_3=-3, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-2147483647, var_1_9=50] [L45] COND FALSE !(last_1_var_1_15 <= (var_1_8 & var_1_4)) [L50] var_1_9 = var_1_4 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-254, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=98304, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_3=-3, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-2147483647, var_1_9=0] [L52] EXPR (var_1_4 + var_1_9) & var_1_7 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-254, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=98304, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_3=-3, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-2147483647, var_1_9=0] [L52] COND TRUE ((var_1_4 + var_1_9) & var_1_7) <= (var_1_10 - ((((var_1_11) < (var_1_16)) ? (var_1_11) : (var_1_16)))) [L53] var_1_15 = (var_1_11 + 64) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-254, var_1_12=10, var_1_13=16, var_1_15=66, var_1_16=1, var_1_17=98304, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_3=-3, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-2147483647, var_1_9=0] [L57] COND FALSE !(-4 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-254, var_1_12=10, var_1_13=16, var_1_15=66, var_1_16=1, var_1_17=98304, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_3=-3, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-2147483647, var_1_9=0] [L62] var_1_18 = var_1_17 [L63] var_1_19 = 0 [L64] var_1_20 = var_1_21 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-254, var_1_12=10, var_1_13=16, var_1_15=66, var_1_16=1, var_1_17=98304, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-3, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-2147483647, var_1_9=0] [L65] COND FALSE !(\read(var_1_19)) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-254, var_1_12=10, var_1_13=16, var_1_15=66, var_1_16=1, var_1_17=98304, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-3, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-2147483647, var_1_9=0] [L68] COND FALSE !(var_1_3 <= var_1_1) [L71] var_1_12 = (((((var_1_11 + var_1_4)) < (var_1_10)) ? ((var_1_11 + var_1_4)) : (var_1_10))) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-254, var_1_12=2, var_1_13=16, var_1_15=66, var_1_16=1, var_1_17=98304, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-3, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-2147483647, var_1_9=0] [L73] COND TRUE (~ var_1_3) < var_1_18 [L74] var_1_13 = (((((var_1_4 + var_1_3)) > (-5)) ? ((var_1_4 + var_1_3)) : (-5))) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-254, var_1_12=2, var_1_13=-3, var_1_15=66, var_1_16=1, var_1_17=98304, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-3, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-2147483647, var_1_9=0] [L124] RET step() [L125] CALL, EXPR property() [L115] EXPR ((var_1_19 ? (var_1_1 == ((signed char) (((((var_1_3 + (1 - var_1_4))) < (var_1_5)) ? ((var_1_3 + (1 - var_1_4))) : (var_1_5))))) : 1) && ((-4 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) ? ((var_1_4 < -16) ? (var_1_6 == ((unsigned long int) ((((32u) < 0 ) ? -(32u) : (32u))))) : 1) : 1)) && ((last_1_var_1_15 <= (var_1_8 & var_1_4)) ? ((((- 8) / (var_1_10 - var_1_11)) >= var_1_3) ? (var_1_9 == ((signed char) var_1_3)) : 1) : (var_1_9 == ((signed char) var_1_4))) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-254, var_1_12=2, var_1_13=-3, var_1_15=66, var_1_16=1, var_1_17=98304, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-3, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-2147483647, var_1_9=0] [L115] EXPR var_1_8 & var_1_4 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-254, var_1_12=2, var_1_13=-3, var_1_15=66, var_1_16=1, var_1_17=98304, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-3, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-2147483647, var_1_9=0] [L115] EXPR ((var_1_19 ? (var_1_1 == ((signed char) (((((var_1_3 + (1 - var_1_4))) < (var_1_5)) ? ((var_1_3 + (1 - var_1_4))) : (var_1_5))))) : 1) && ((-4 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) ? ((var_1_4 < -16) ? (var_1_6 == ((unsigned long int) ((((32u) < 0 ) ? -(32u) : (32u))))) : 1) : 1)) && ((last_1_var_1_15 <= (var_1_8 & var_1_4)) ? ((((- 8) / (var_1_10 - var_1_11)) >= var_1_3) ? (var_1_9 == ((signed char) var_1_3)) : 1) : (var_1_9 == ((signed char) var_1_4))) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-254, var_1_12=2, var_1_13=-3, var_1_15=66, var_1_16=1, var_1_17=98304, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-3, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-2147483647, var_1_9=0] [L115] EXPR (((((var_1_19 ? (var_1_1 == ((signed char) (((((var_1_3 + (1 - var_1_4))) < (var_1_5)) ? ((var_1_3 + (1 - var_1_4))) : (var_1_5))))) : 1) && ((-4 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) ? ((var_1_4 < -16) ? (var_1_6 == ((unsigned long int) ((((32u) < 0 ) ? -(32u) : (32u))))) : 1) : 1)) && ((last_1_var_1_15 <= (var_1_8 & var_1_4)) ? ((((- 8) / (var_1_10 - var_1_11)) >= var_1_3) ? (var_1_9 == ((signed char) var_1_3)) : 1) : (var_1_9 == ((signed char) var_1_4)))) && ((var_1_3 <= var_1_1) ? (var_1_12 == ((unsigned long int) var_1_4)) : (var_1_12 == ((unsigned long int) (((((var_1_11 + var_1_4)) < (var_1_10)) ? ((var_1_11 + var_1_4)) : (var_1_10))))))) && (((~ var_1_3) < var_1_18) ? (var_1_13 == ((signed char) (((((var_1_4 + var_1_3)) > (-5)) ? ((var_1_4 + var_1_3)) : (-5))))) : 1)) && ((((var_1_4 + var_1_9) & var_1_7) <= (var_1_10 - ((((var_1_11) < (var_1_16)) ? (var_1_11) : (var_1_16))))) ? (var_1_15 == ((unsigned short int) (var_1_11 + 64))) : (var_1_15 == ((unsigned short int) ((((((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) > (var_1_11)) ? (((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) : (var_1_11)))))) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-254, var_1_12=2, var_1_13=-3, var_1_15=66, var_1_16=1, var_1_17=98304, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-3, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-2147483647, var_1_9=0] [L115] EXPR (var_1_4 + var_1_9) & var_1_7 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-254, var_1_12=2, var_1_13=-3, var_1_15=66, var_1_16=1, var_1_17=98304, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-3, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-2147483647, var_1_9=0] [L115] EXPR (((((var_1_19 ? (var_1_1 == ((signed char) (((((var_1_3 + (1 - var_1_4))) < (var_1_5)) ? ((var_1_3 + (1 - var_1_4))) : (var_1_5))))) : 1) && ((-4 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) ? ((var_1_4 < -16) ? (var_1_6 == ((unsigned long int) ((((32u) < 0 ) ? -(32u) : (32u))))) : 1) : 1)) && ((last_1_var_1_15 <= (var_1_8 & var_1_4)) ? ((((- 8) / (var_1_10 - var_1_11)) >= var_1_3) ? (var_1_9 == ((signed char) var_1_3)) : 1) : (var_1_9 == ((signed char) var_1_4)))) && ((var_1_3 <= var_1_1) ? (var_1_12 == ((unsigned long int) var_1_4)) : (var_1_12 == ((unsigned long int) (((((var_1_11 + var_1_4)) < (var_1_10)) ? ((var_1_11 + var_1_4)) : (var_1_10))))))) && (((~ var_1_3) < var_1_18) ? (var_1_13 == ((signed char) (((((var_1_4 + var_1_3)) > (-5)) ? ((var_1_4 + var_1_3)) : (-5))))) : 1)) && ((((var_1_4 + var_1_9) & var_1_7) <= (var_1_10 - ((((var_1_11) < (var_1_16)) ? (var_1_11) : (var_1_16))))) ? (var_1_15 == ((unsigned short int) (var_1_11 + 64))) : (var_1_15 == ((unsigned short int) ((((((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) > (var_1_11)) ? (((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) : (var_1_11)))))) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-254, var_1_12=2, var_1_13=-3, var_1_15=66, var_1_16=1, var_1_17=98304, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-3, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-2147483647, var_1_9=0] [L115-L116] return ((((((((var_1_19 ? (var_1_1 == ((signed char) (((((var_1_3 + (1 - var_1_4))) < (var_1_5)) ? ((var_1_3 + (1 - var_1_4))) : (var_1_5))))) : 1) && ((-4 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) ? ((var_1_4 < -16) ? (var_1_6 == ((unsigned long int) ((((32u) < 0 ) ? -(32u) : (32u))))) : 1) : 1)) && ((last_1_var_1_15 <= (var_1_8 & var_1_4)) ? ((((- 8) / (var_1_10 - var_1_11)) >= var_1_3) ? (var_1_9 == ((signed char) var_1_3)) : 1) : (var_1_9 == ((signed char) var_1_4)))) && ((var_1_3 <= var_1_1) ? (var_1_12 == ((unsigned long int) var_1_4)) : (var_1_12 == ((unsigned long int) (((((var_1_11 + var_1_4)) < (var_1_10)) ? ((var_1_11 + var_1_4)) : (var_1_10))))))) && (((~ var_1_3) < var_1_18) ? (var_1_13 == ((signed char) (((((var_1_4 + var_1_3)) > (-5)) ? ((var_1_4 + var_1_3)) : (-5))))) : 1)) && ((((var_1_4 + var_1_9) & var_1_7) <= (var_1_10 - ((((var_1_11) < (var_1_16)) ? (var_1_11) : (var_1_16))))) ? (var_1_15 == ((unsigned short int) (var_1_11 + 64))) : (var_1_15 == ((unsigned short int) ((((((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) > (var_1_11)) ? (((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) : (var_1_11))))))) && (var_1_18 == ((unsigned long int) var_1_17))) && (var_1_19 == ((unsigned char) 0))) && (var_1_20 == ((double) var_1_21)) ; [L125] RET, EXPR property() [L125] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-254, var_1_12=2, var_1_13=-3, var_1_15=66, var_1_16=1, var_1_17=98304, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-3, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-2147483647, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_15=128, var_1_10=-128, var_1_11=-254, var_1_12=2, var_1_13=-3, var_1_15=66, var_1_16=1, var_1_17=98304, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-3, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-2147483647, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 78 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 27.2s, OverallIterations: 10, TraceHistogramMax: 22, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 4.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 533 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 533 mSDsluCounter, 2366 SdHoareTripleChecker+Invalid, 2.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1457 mSDsCounter, 90 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 927 IncrementalHoareTripleChecker+Invalid, 1017 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 90 mSolverCounterUnsat, 909 mSDtfsCounter, 927 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 475 GetRequests, 439 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 5.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=209occurred in iteration=8, InterpolantAutomatonStates: 44, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 9 MinimizatonAttempts, 280 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 20.3s InterpolantComputationTime, 1584 NumberOfCodeBlocks, 1584 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1283 ConstructedInterpolants, 0 QuantifiedInterpolants, 5262 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 8316/8316 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 16:46:05,742 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9026e80-6c1b-4a5f-838c-91eb4af9f534/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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_d9026e80-6c1b-4a5f-838c-91eb4af9f534/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9026e80-6c1b-4a5f-838c-91eb4af9f534/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_d9026e80-6c1b-4a5f-838c-91eb4af9f534/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9026e80-6c1b-4a5f-838c-91eb4af9f534/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-84.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9026e80-6c1b-4a5f-838c-91eb4af9f534/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_d9026e80-6c1b-4a5f-838c-91eb4af9f534/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 925e9b76051eff442eff54c72fd139be6e9d1af6b77433b45103df887e08e16e --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 16:46:08,244 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 16:46:08,303 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9026e80-6c1b-4a5f-838c-91eb4af9f534/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 16:46:08,308 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 16:46:08,308 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 16:46:08,332 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 16:46:08,333 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 16:46:08,333 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 16:46:08,334 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 16:46:08,334 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 16:46:08,335 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 16:46:08,335 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 16:46:08,336 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 16:46:08,337 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 16:46:08,337 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 16:46:08,338 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 16:46:08,342 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 16:46:08,343 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 16:46:08,343 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 16:46:08,343 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 16:46:08,344 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 16:46:08,344 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 16:46:08,345 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 16:46:08,345 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 16:46:08,345 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 16:46:08,346 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 16:46:08,346 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 16:46:08,346 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 16:46:08,347 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 16:46:08,347 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 16:46:08,348 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 16:46:08,348 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 16:46:08,348 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 16:46:08,349 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 16:46:08,349 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 16:46:08,349 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 16:46:08,350 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 16:46:08,350 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 16:46:08,351 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-08 16:46:08,351 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 16:46:08,351 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 16:46:08,352 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 16:46:08,352 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 16:46:08,352 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 16:46:08,352 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_d9026e80-6c1b-4a5f-838c-91eb4af9f534/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_d9026e80-6c1b-4a5f-838c-91eb4af9f534/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 -> 925e9b76051eff442eff54c72fd139be6e9d1af6b77433b45103df887e08e16e [2024-11-08 16:46:08,769 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 16:46:08,798 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 16:46:08,801 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 16:46:08,803 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 16:46:08,803 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 16:46:08,805 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9026e80-6c1b-4a5f-838c-91eb4af9f534/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-84.i Unable to find full path for "g++" [2024-11-08 16:46:11,203 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 16:46:11,412 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 16:46:11,414 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9026e80-6c1b-4a5f-838c-91eb4af9f534/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-84.i [2024-11-08 16:46:11,426 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9026e80-6c1b-4a5f-838c-91eb4af9f534/bin/uautomizer-verify-jihMAELWvX/data/d59b59a40/5725f73928f0431cb97b2f56c338875b/FLAG25a5c35f1 [2024-11-08 16:46:11,443 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9026e80-6c1b-4a5f-838c-91eb4af9f534/bin/uautomizer-verify-jihMAELWvX/data/d59b59a40/5725f73928f0431cb97b2f56c338875b [2024-11-08 16:46:11,445 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 16:46:11,446 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 16:46:11,447 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 16:46:11,448 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 16:46:11,453 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 16:46:11,454 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 04:46:11" (1/1) ... [2024-11-08 16:46:11,455 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ef5aff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:46:11, skipping insertion in model container [2024-11-08 16:46:11,456 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 04:46:11" (1/1) ... [2024-11-08 16:46:11,494 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 16:46:11,708 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_d9026e80-6c1b-4a5f-838c-91eb4af9f534/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-84.i[919,932] [2024-11-08 16:46:11,773 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 16:46:11,789 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 16:46:11,806 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_d9026e80-6c1b-4a5f-838c-91eb4af9f534/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-84.i[919,932] [2024-11-08 16:46:11,875 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 16:46:11,907 INFO L204 MainTranslator]: Completed translation [2024-11-08 16:46:11,907 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:46:11 WrapperNode [2024-11-08 16:46:11,907 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 16:46:11,909 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 16:46:11,909 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 16:46:11,909 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 16:46:11,917 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:46:11" (1/1) ... [2024-11-08 16:46:11,933 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:46:11" (1/1) ... [2024-11-08 16:46:11,978 INFO L138 Inliner]: procedures = 27, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 126 [2024-11-08 16:46:11,982 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 16:46:11,983 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 16:46:11,983 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 16:46:11,983 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 16:46:11,997 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:46:11" (1/1) ... [2024-11-08 16:46:11,997 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:46:11" (1/1) ... [2024-11-08 16:46:12,002 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:46:11" (1/1) ... [2024-11-08 16:46:12,024 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 16:46:12,026 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:46:11" (1/1) ... [2024-11-08 16:46:12,027 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:46:11" (1/1) ... [2024-11-08 16:46:12,042 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:46:11" (1/1) ... [2024-11-08 16:46:12,051 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:46:11" (1/1) ... [2024-11-08 16:46:12,056 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:46:11" (1/1) ... [2024-11-08 16:46:12,058 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:46:11" (1/1) ... [2024-11-08 16:46:12,064 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 16:46:12,069 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 16:46:12,069 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 16:46:12,069 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 16:46:12,070 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:46:11" (1/1) ... [2024-11-08 16:46:12,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 16:46:12,089 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9026e80-6c1b-4a5f-838c-91eb4af9f534/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:46:12,105 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9026e80-6c1b-4a5f-838c-91eb4af9f534/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 16:46:12,109 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9026e80-6c1b-4a5f-838c-91eb4af9f534/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 16:46:12,142 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 16:46:12,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 16:46:12,143 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 16:46:12,143 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 16:46:12,144 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 16:46:12,145 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 16:46:12,269 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 16:46:12,273 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 16:46:13,005 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-08 16:46:13,005 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 16:46:13,023 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 16:46:13,024 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 16:46:13,024 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:46:13 BoogieIcfgContainer [2024-11-08 16:46:13,025 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 16:46:13,031 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 16:46:13,031 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 16:46:13,036 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 16:46:13,037 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 04:46:11" (1/3) ... [2024-11-08 16:46:13,038 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36f88be3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 04:46:13, skipping insertion in model container [2024-11-08 16:46:13,039 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:46:11" (2/3) ... [2024-11-08 16:46:13,040 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36f88be3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 04:46:13, skipping insertion in model container [2024-11-08 16:46:13,040 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:46:13" (3/3) ... [2024-11-08 16:46:13,042 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-84.i [2024-11-08 16:46:13,064 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 16:46:13,064 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 16:46:13,164 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 16:46:13,173 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;@1ae4f652, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 16:46:13,175 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 16:46:13,180 INFO L276 IsEmpty]: Start isEmpty. Operand has 60 states, 35 states have (on average 1.3714285714285714) internal successors, (48), 36 states have internal predecessors, (48), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-08 16:46:13,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-08 16:46:13,203 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:46:13,204 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:46:13,205 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:46:13,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:46:13,216 INFO L85 PathProgramCache]: Analyzing trace with hash -21124752, now seen corresponding path program 1 times [2024-11-08 16:46:13,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:46:13,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1985705076] [2024-11-08 16:46:13,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:46:13,239 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 16:46:13,240 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9026e80-6c1b-4a5f-838c-91eb4af9f534/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:46:13,243 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9026e80-6c1b-4a5f-838c-91eb4af9f534/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 16:46:13,246 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9026e80-6c1b-4a5f-838c-91eb4af9f534/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 16:46:13,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:13,600 INFO L255 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 16:46:13,610 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:46:13,686 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 458 proven. 0 refuted. 0 times theorem prover too weak. 466 trivial. 0 not checked. [2024-11-08 16:46:13,691 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:46:13,692 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:46:13,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1985705076] [2024-11-08 16:46:13,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1985705076] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:46:13,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:46:13,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 16:46:13,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177457526] [2024-11-08 16:46:13,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:46:13,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 16:46:13,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:46:13,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 16:46:13,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 16:46:13,742 INFO L87 Difference]: Start difference. First operand has 60 states, 35 states have (on average 1.3714285714285714) internal successors, (48), 36 states have internal predecessors, (48), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-08 16:46:13,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:46:13,793 INFO L93 Difference]: Finished difference Result 113 states and 200 transitions. [2024-11-08 16:46:13,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 16:46:13,797 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 136 [2024-11-08 16:46:13,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:46:13,808 INFO L225 Difference]: With dead ends: 113 [2024-11-08 16:46:13,809 INFO L226 Difference]: Without dead ends: 56 [2024-11-08 16:46:13,815 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 135 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 16:46:13,822 INFO L432 NwaCegarLoop]: 85 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, 85 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 16:46:13,825 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 16:46:13,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-08 16:46:13,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-11-08 16:46:13,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 32 states have (on average 1.28125) internal successors, (41), 32 states have internal predecessors, (41), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-08 16:46:13,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 85 transitions. [2024-11-08 16:46:13,899 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 85 transitions. Word has length 136 [2024-11-08 16:46:13,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:46:13,900 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 85 transitions. [2024-11-08 16:46:13,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-08 16:46:13,901 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 85 transitions. [2024-11-08 16:46:13,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-08 16:46:13,908 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:46:13,908 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:46:13,916 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9026e80-6c1b-4a5f-838c-91eb4af9f534/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 16:46:14,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9026e80-6c1b-4a5f-838c-91eb4af9f534/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 16:46:14,109 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:46:14,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:46:14,111 INFO L85 PathProgramCache]: Analyzing trace with hash -175754448, now seen corresponding path program 1 times [2024-11-08 16:46:14,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:46:14,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1814628400] [2024-11-08 16:46:14,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:46:14,113 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 16:46:14,114 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9026e80-6c1b-4a5f-838c-91eb4af9f534/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:46:14,117 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9026e80-6c1b-4a5f-838c-91eb4af9f534/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 16:46:14,119 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9026e80-6c1b-4a5f-838c-91eb4af9f534/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 16:46:14,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:14,399 INFO L255 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 16:46:14,414 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:46:14,520 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-08 16:46:14,520 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:46:14,521 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:46:14,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1814628400] [2024-11-08 16:46:14,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1814628400] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:46:14,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:46:14,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 16:46:14,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090144930] [2024-11-08 16:46:14,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:46:14,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 16:46:14,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:46:14,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 16:46:14,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:46:14,527 INFO L87 Difference]: Start difference. First operand 56 states and 85 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-08 16:46:14,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:46:14,636 INFO L93 Difference]: Finished difference Result 109 states and 167 transitions. [2024-11-08 16:46:14,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 16:46:14,644 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 136 [2024-11-08 16:46:14,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:46:14,647 INFO L225 Difference]: With dead ends: 109 [2024-11-08 16:46:14,647 INFO L226 Difference]: Without dead ends: 56 [2024-11-08 16:46:14,648 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:46:14,649 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 82 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 16:46:14,650 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 82 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 16:46:14,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-08 16:46:14,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-11-08 16:46:14,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 32 states have (on average 1.25) internal successors, (40), 32 states have internal predecessors, (40), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-08 16:46:14,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 84 transitions. [2024-11-08 16:46:14,674 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 84 transitions. Word has length 136 [2024-11-08 16:46:14,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:46:14,676 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 84 transitions. [2024-11-08 16:46:14,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-08 16:46:14,677 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 84 transitions. [2024-11-08 16:46:14,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-08 16:46:14,679 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:46:14,680 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:46:14,688 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9026e80-6c1b-4a5f-838c-91eb4af9f534/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 16:46:14,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9026e80-6c1b-4a5f-838c-91eb4af9f534/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 16:46:14,881 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:46:14,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:46:14,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1599252914, now seen corresponding path program 1 times [2024-11-08 16:46:14,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:46:14,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [983983580] [2024-11-08 16:46:14,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:46:14,885 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 16:46:14,886 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9026e80-6c1b-4a5f-838c-91eb4af9f534/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:46:14,889 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9026e80-6c1b-4a5f-838c-91eb4af9f534/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 16:46:14,892 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9026e80-6c1b-4a5f-838c-91eb4af9f534/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 16:46:15,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:46:15,116 INFO L255 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-08 16:46:15,132 INFO L278 TraceCheckSpWp]: Computing forward predicates...