./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-57.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_055507da-aad0-4fa1-82ba-2c1f076d7d62/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_055507da-aad0-4fa1-82ba-2c1f076d7d62/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_055507da-aad0-4fa1-82ba-2c1f076d7d62/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_055507da-aad0-4fa1-82ba-2c1f076d7d62/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-57.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_055507da-aad0-4fa1-82ba-2c1f076d7d62/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_055507da-aad0-4fa1-82ba-2c1f076d7d62/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 3739a27a9c8740637c1508dfeaeb16861a9cb046f0a58f7010c764edaa57cdf6 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 16:38:17,226 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 16:38:17,313 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_055507da-aad0-4fa1-82ba-2c1f076d7d62/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 16:38:17,322 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 16:38:17,323 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 16:38:17,357 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 16:38:17,360 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 16:38:17,360 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 16:38:17,361 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 16:38:17,363 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 16:38:17,365 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 16:38:17,365 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 16:38:17,366 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 16:38:17,366 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 16:38:17,368 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 16:38:17,368 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 16:38:17,372 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 16:38:17,372 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 16:38:17,373 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 16:38:17,373 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 16:38:17,373 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 16:38:17,374 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 16:38:17,374 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 16:38:17,374 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 16:38:17,374 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 16:38:17,375 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 16:38:17,375 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 16:38:17,375 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 16:38:17,375 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 16:38:17,375 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 16:38:17,376 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 16:38:17,376 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 16:38:17,376 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 16:38:17,376 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 16:38:17,377 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 16:38:17,377 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 16:38:17,378 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 16:38:17,378 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 16:38:17,378 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 16:38:17,378 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 16:38:17,379 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 16:38:17,379 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 16:38:17,380 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_055507da-aad0-4fa1-82ba-2c1f076d7d62/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_055507da-aad0-4fa1-82ba-2c1f076d7d62/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 -> 3739a27a9c8740637c1508dfeaeb16861a9cb046f0a58f7010c764edaa57cdf6 [2024-11-08 16:38:17,655 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 16:38:17,676 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 16:38:17,681 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 16:38:17,682 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 16:38:17,683 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 16:38:17,684 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_055507da-aad0-4fa1-82ba-2c1f076d7d62/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-57.i Unable to find full path for "g++" [2024-11-08 16:38:19,701 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 16:38:19,891 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 16:38:19,892 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_055507da-aad0-4fa1-82ba-2c1f076d7d62/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-57.i [2024-11-08 16:38:19,904 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_055507da-aad0-4fa1-82ba-2c1f076d7d62/bin/uautomizer-verify-jihMAELWvX/data/4c689705d/57cb33f88dbd4b68b0663b6af69c386a/FLAG770277860 [2024-11-08 16:38:19,923 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_055507da-aad0-4fa1-82ba-2c1f076d7d62/bin/uautomizer-verify-jihMAELWvX/data/4c689705d/57cb33f88dbd4b68b0663b6af69c386a [2024-11-08 16:38:19,925 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 16:38:19,927 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 16:38:19,928 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 16:38:19,928 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 16:38:19,934 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 16:38:19,935 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 04:38:19" (1/1) ... [2024-11-08 16:38:19,936 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6866a9b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:38:19, skipping insertion in model container [2024-11-08 16:38:19,937 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 04:38:19" (1/1) ... [2024-11-08 16:38:19,971 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 16:38:20,146 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_055507da-aad0-4fa1-82ba-2c1f076d7d62/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-57.i[917,930] [2024-11-08 16:38:20,211 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 16:38:20,225 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 16:38:20,238 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_055507da-aad0-4fa1-82ba-2c1f076d7d62/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-57.i[917,930] [2024-11-08 16:38:20,296 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 16:38:20,327 INFO L204 MainTranslator]: Completed translation [2024-11-08 16:38:20,327 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:38:20 WrapperNode [2024-11-08 16:38:20,328 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 16:38:20,328 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 16:38:20,329 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 16:38:20,329 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 16:38:20,335 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:38:20" (1/1) ... [2024-11-08 16:38:20,346 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:38:20" (1/1) ... [2024-11-08 16:38:20,398 INFO L138 Inliner]: procedures = 30, calls = 140, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 426 [2024-11-08 16:38:20,398 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 16:38:20,402 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 16:38:20,402 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 16:38:20,402 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 16:38:20,418 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:38:20" (1/1) ... [2024-11-08 16:38:20,418 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:38:20" (1/1) ... [2024-11-08 16:38:20,423 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:38:20" (1/1) ... [2024-11-08 16:38:20,431 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-08 16:38:20,431 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:38:20" (1/1) ... [2024-11-08 16:38:20,431 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:38:20" (1/1) ... [2024-11-08 16:38:20,462 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:38:20" (1/1) ... [2024-11-08 16:38:20,470 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:38:20" (1/1) ... [2024-11-08 16:38:20,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:38:20" (1/1) ... [2024-11-08 16:38:20,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:38:20" (1/1) ... [2024-11-08 16:38:20,480 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 16:38:20,481 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 16:38:20,481 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 16:38:20,481 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 16:38:20,482 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:38:20" (1/1) ... [2024-11-08 16:38:20,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 16:38:20,503 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_055507da-aad0-4fa1-82ba-2c1f076d7d62/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:38:20,527 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_055507da-aad0-4fa1-82ba-2c1f076d7d62/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:38:20,531 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_055507da-aad0-4fa1-82ba-2c1f076d7d62/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:38:20,566 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 16:38:20,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-08 16:38:20,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-08 16:38:20,568 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-08 16:38:20,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-08 16:38:20,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-08 16:38:20,569 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-08 16:38:20,571 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 16:38:20,571 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 16:38:20,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-08 16:38:20,571 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 16:38:20,572 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 16:38:20,738 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 16:38:20,740 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 16:38:21,555 INFO L? ?]: Removed 94 outVars from TransFormulas that were not future-live. [2024-11-08 16:38:21,556 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 16:38:21,577 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 16:38:21,578 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 16:38:21,579 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:38:21 BoogieIcfgContainer [2024-11-08 16:38:21,579 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 16:38:21,582 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 16:38:21,584 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 16:38:21,588 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 16:38:21,588 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 04:38:19" (1/3) ... [2024-11-08 16:38:21,589 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c4e55c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 04:38:21, skipping insertion in model container [2024-11-08 16:38:21,590 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:38:20" (2/3) ... [2024-11-08 16:38:21,590 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c4e55c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 04:38:21, skipping insertion in model container [2024-11-08 16:38:21,591 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:38:21" (3/3) ... [2024-11-08 16:38:21,592 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-57.i [2024-11-08 16:38:21,611 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 16:38:21,612 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 16:38:21,675 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 16:38:21,682 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;@4f626038, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 16:38:21,682 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 16:38:21,687 INFO L276 IsEmpty]: Start isEmpty. Operand has 97 states, 76 states have (on average 1.394736842105263) internal successors, (106), 77 states have internal predecessors, (106), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 16:38:21,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-08 16:38:21,706 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:38:21,707 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:38:21,708 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:38:21,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:38:21,712 INFO L85 PathProgramCache]: Analyzing trace with hash 1270902032, now seen corresponding path program 1 times [2024-11-08 16:38:21,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:38:21,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797340858] [2024-11-08 16:38:21,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:38:21,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:38:21,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:22,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:38:22,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:22,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:38:22,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:22,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:38:22,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:22,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:38:22,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:22,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:38:22,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:22,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:38:22,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:22,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:38:22,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:22,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:38:22,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:22,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 16:38:22,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:22,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:38:22,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:22,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:38:22,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:22,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:38:22,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:22,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:38:22,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:22,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:38:22,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:22,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 16:38:22,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:22,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 16:38:22,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:22,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 16:38:22,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:22,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 16:38:22,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:22,317 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 16:38:22,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:38:22,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797340858] [2024-11-08 16:38:22,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797340858] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:38:22,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:38:22,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 16:38:22,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073487423] [2024-11-08 16:38:22,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:38:22,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 16:38:22,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:38:22,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 16:38:22,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 16:38:22,370 INFO L87 Difference]: Start difference. First operand has 97 states, 76 states have (on average 1.394736842105263) internal successors, (106), 77 states have internal predecessors, (106), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-08 16:38:22,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:38:22,411 INFO L93 Difference]: Finished difference Result 187 states and 296 transitions. [2024-11-08 16:38:22,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 16:38:22,413 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 134 [2024-11-08 16:38:22,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:38:22,422 INFO L225 Difference]: With dead ends: 187 [2024-11-08 16:38:22,422 INFO L226 Difference]: Without dead ends: 93 [2024-11-08 16:38:22,428 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 16:38:22,432 INFO L432 NwaCegarLoop]: 135 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, 135 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:38:22,433 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 16:38:22,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-08 16:38:22,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-11-08 16:38:22,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 73 states have (on average 1.356164383561644) internal successors, (99), 73 states have internal predecessors, (99), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 16:38:22,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 135 transitions. [2024-11-08 16:38:22,490 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 135 transitions. Word has length 134 [2024-11-08 16:38:22,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:38:22,492 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 135 transitions. [2024-11-08 16:38:22,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-08 16:38:22,493 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 135 transitions. [2024-11-08 16:38:22,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-08 16:38:22,496 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:38:22,496 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:38:22,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 16:38:22,497 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:38:22,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:38:22,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1526426700, now seen corresponding path program 1 times [2024-11-08 16:38:22,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:38:22,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860764392] [2024-11-08 16:38:22,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:38:22,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:38:22,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:23,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:38:23,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:23,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:38:23,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:23,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:38:23,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:23,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:38:23,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:23,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:38:23,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:23,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:38:23,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:23,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:38:23,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:23,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:38:23,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:23,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 16:38:23,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:23,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:38:23,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:23,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:38:23,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:23,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:38:23,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:23,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:38:23,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:23,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:38:23,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:23,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 16:38:23,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:23,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 16:38:23,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:23,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 16:38:23,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:23,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 16:38:23,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:23,912 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 16:38:23,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:38:23,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860764392] [2024-11-08 16:38:23,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860764392] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:38:23,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:38:23,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 16:38:23,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554196774] [2024-11-08 16:38:23,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:38:23,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 16:38:23,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:38:23,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 16:38:23,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 16:38:23,924 INFO L87 Difference]: Start difference. First operand 93 states and 135 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 16:38:24,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:38:24,413 INFO L93 Difference]: Finished difference Result 274 states and 400 transitions. [2024-11-08 16:38:24,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 16:38:24,413 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 134 [2024-11-08 16:38:24,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:38:24,416 INFO L225 Difference]: With dead ends: 274 [2024-11-08 16:38:24,416 INFO L226 Difference]: Without dead ends: 184 [2024-11-08 16:38:24,417 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 16:38:24,418 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 93 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 16:38:24,419 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 302 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 16:38:24,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2024-11-08 16:38:24,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 153. [2024-11-08 16:38:24,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 114 states have (on average 1.3070175438596492) internal successors, (149), 114 states have internal predecessors, (149), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-08 16:38:24,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 221 transitions. [2024-11-08 16:38:24,450 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 221 transitions. Word has length 134 [2024-11-08 16:38:24,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:38:24,451 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 221 transitions. [2024-11-08 16:38:24,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 16:38:24,452 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 221 transitions. [2024-11-08 16:38:24,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-08 16:38:24,454 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:38:24,454 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:38:24,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 16:38:24,454 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:38:24,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:38:24,455 INFO L85 PathProgramCache]: Analyzing trace with hash -543294967, now seen corresponding path program 1 times [2024-11-08 16:38:24,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:38:24,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822767719] [2024-11-08 16:38:24,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:38:24,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:38:24,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:24,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:38:24,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:24,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:38:24,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:24,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:38:24,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:24,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:38:24,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:24,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:38:24,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:24,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:38:24,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:24,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:38:24,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:24,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:38:24,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:24,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 16:38:24,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:24,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:38:24,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:24,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:38:24,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:24,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:38:24,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:24,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:38:24,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:24,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:38:24,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:24,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 16:38:24,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:24,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 16:38:24,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:24,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 16:38:24,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:24,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 16:38:24,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:24,694 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 16:38:24,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:38:24,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822767719] [2024-11-08 16:38:24,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822767719] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:38:24,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:38:24,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 16:38:24,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995161054] [2024-11-08 16:38:24,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:38:24,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 16:38:24,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:38:24,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 16:38:24,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 16:38:24,698 INFO L87 Difference]: Start difference. First operand 153 states and 221 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 16:38:24,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:38:24,737 INFO L93 Difference]: Finished difference Result 246 states and 357 transitions. [2024-11-08 16:38:24,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 16:38:24,737 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 141 [2024-11-08 16:38:24,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:38:24,739 INFO L225 Difference]: With dead ends: 246 [2024-11-08 16:38:24,740 INFO L226 Difference]: Without dead ends: 156 [2024-11-08 16:38:24,741 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 16:38:24,742 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 1 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:38:24,742 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 387 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 16:38:24,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-11-08 16:38:24,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 155. [2024-11-08 16:38:24,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 116 states have (on average 1.3017241379310345) internal successors, (151), 116 states have internal predecessors, (151), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-08 16:38:24,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 223 transitions. [2024-11-08 16:38:24,781 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 223 transitions. Word has length 141 [2024-11-08 16:38:24,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:38:24,782 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 223 transitions. [2024-11-08 16:38:24,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 16:38:24,782 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 223 transitions. [2024-11-08 16:38:24,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-08 16:38:24,790 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:38:24,790 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:38:24,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 16:38:24,790 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:38:24,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:38:24,791 INFO L85 PathProgramCache]: Analyzing trace with hash -541447925, now seen corresponding path program 1 times [2024-11-08 16:38:24,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:38:24,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917979093] [2024-11-08 16:38:24,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:38:24,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:38:24,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:26,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:38:26,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:26,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:38:26,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:26,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:38:26,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:26,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:38:26,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:26,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:38:26,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:26,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:38:26,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:26,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:38:26,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:26,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:38:26,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:26,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 16:38:26,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:26,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:38:26,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:26,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:38:26,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:26,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:38:26,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:26,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:38:26,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:26,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:38:26,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:26,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 16:38:26,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:26,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 16:38:26,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:26,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 16:38:26,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:26,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 16:38:26,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:26,498 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 16:38:26,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:38:26,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917979093] [2024-11-08 16:38:26,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917979093] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:38:26,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:38:26,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 16:38:26,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180755661] [2024-11-08 16:38:26,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:38:26,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 16:38:26,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:38:26,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 16:38:26,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-08 16:38:26,502 INFO L87 Difference]: Start difference. First operand 155 states and 223 transitions. Second operand has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 16:38:27,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:38:27,337 INFO L93 Difference]: Finished difference Result 311 states and 451 transitions. [2024-11-08 16:38:27,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 16:38:27,338 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 141 [2024-11-08 16:38:27,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:38:27,340 INFO L225 Difference]: With dead ends: 311 [2024-11-08 16:38:27,340 INFO L226 Difference]: Without dead ends: 219 [2024-11-08 16:38:27,341 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2024-11-08 16:38:27,342 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 275 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 16:38:27,343 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 432 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 16:38:27,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2024-11-08 16:38:27,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 190. [2024-11-08 16:38:27,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 151 states have (on average 1.3509933774834437) internal successors, (204), 151 states have internal predecessors, (204), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-08 16:38:27,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 276 transitions. [2024-11-08 16:38:27,395 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 276 transitions. Word has length 141 [2024-11-08 16:38:27,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:38:27,396 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 276 transitions. [2024-11-08 16:38:27,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 16:38:27,396 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 276 transitions. [2024-11-08 16:38:27,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-08 16:38:27,406 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:38:27,406 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:38:27,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 16:38:27,407 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:38:27,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:38:27,407 INFO L85 PathProgramCache]: Analyzing trace with hash -283282487, now seen corresponding path program 1 times [2024-11-08 16:38:27,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:38:27,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024851505] [2024-11-08 16:38:27,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:38:27,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:38:27,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:29,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:38:29,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:29,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:38:29,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:29,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:38:29,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:29,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:38:29,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:29,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:38:29,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:29,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:38:29,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:29,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:38:29,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:29,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:38:29,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:29,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 16:38:29,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:29,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:38:29,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:29,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:38:29,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:29,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:38:29,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:29,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:38:29,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:29,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:38:29,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:29,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 16:38:29,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:29,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 16:38:29,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:29,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 16:38:29,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:29,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 16:38:29,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:29,331 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 16:38:29,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:38:29,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024851505] [2024-11-08 16:38:29,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024851505] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:38:29,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:38:29,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 16:38:29,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647024869] [2024-11-08 16:38:29,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:38:29,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 16:38:29,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:38:29,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 16:38:29,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-08 16:38:29,336 INFO L87 Difference]: Start difference. First operand 190 states and 276 transitions. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 16:38:30,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:38:30,402 INFO L93 Difference]: Finished difference Result 343 states and 499 transitions. [2024-11-08 16:38:30,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 16:38:30,402 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 141 [2024-11-08 16:38:30,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:38:30,404 INFO L225 Difference]: With dead ends: 343 [2024-11-08 16:38:30,404 INFO L226 Difference]: Without dead ends: 230 [2024-11-08 16:38:30,405 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2024-11-08 16:38:30,406 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 208 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 551 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-08 16:38:30,407 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 527 Invalid, 627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 551 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-08 16:38:30,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2024-11-08 16:38:30,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 180. [2024-11-08 16:38:30,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 141 states have (on average 1.3475177304964538) internal successors, (190), 141 states have internal predecessors, (190), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-08 16:38:30,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 262 transitions. [2024-11-08 16:38:30,438 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 262 transitions. Word has length 141 [2024-11-08 16:38:30,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:38:30,439 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 262 transitions. [2024-11-08 16:38:30,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 16:38:30,439 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 262 transitions. [2024-11-08 16:38:30,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-08 16:38:30,441 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:38:30,442 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:38:30,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 16:38:30,442 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:38:30,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:38:30,443 INFO L85 PathProgramCache]: Analyzing trace with hash 467333461, now seen corresponding path program 1 times [2024-11-08 16:38:30,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:38:30,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350894598] [2024-11-08 16:38:30,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:38:30,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:38:30,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:30,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:38:30,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:30,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:38:30,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:30,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:38:30,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:30,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:38:30,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:30,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:38:30,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:30,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:38:30,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:30,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:38:30,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:30,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:38:30,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:30,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 16:38:30,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:30,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:38:30,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:30,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:38:30,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:31,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:38:31,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:31,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:38:31,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:31,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:38:31,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:31,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 16:38:31,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:31,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 16:38:31,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:31,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 16:38:31,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:31,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 16:38:31,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:31,021 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 16:38:31,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:38:31,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350894598] [2024-11-08 16:38:31,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350894598] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:38:31,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:38:31,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 16:38:31,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833299551] [2024-11-08 16:38:31,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:38:31,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 16:38:31,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:38:31,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 16:38:31,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 16:38:31,025 INFO L87 Difference]: Start difference. First operand 180 states and 262 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 16:38:31,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:38:31,438 INFO L93 Difference]: Finished difference Result 336 states and 489 transitions. [2024-11-08 16:38:31,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 16:38:31,439 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 144 [2024-11-08 16:38:31,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:38:31,440 INFO L225 Difference]: With dead ends: 336 [2024-11-08 16:38:31,440 INFO L226 Difference]: Without dead ends: 223 [2024-11-08 16:38:31,441 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-08 16:38:31,442 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 38 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 16:38:31,444 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 370 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 16:38:31,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2024-11-08 16:38:31,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 197. [2024-11-08 16:38:31,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 158 states have (on average 1.360759493670886) internal successors, (215), 158 states have internal predecessors, (215), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-08 16:38:31,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 287 transitions. [2024-11-08 16:38:31,475 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 287 transitions. Word has length 144 [2024-11-08 16:38:31,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:38:31,476 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 287 transitions. [2024-11-08 16:38:31,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 16:38:31,476 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 287 transitions. [2024-11-08 16:38:31,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-08 16:38:31,478 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:38:31,478 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:38:31,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 16:38:31,479 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:38:31,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:38:31,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1168398039, now seen corresponding path program 1 times [2024-11-08 16:38:31,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:38:31,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665519944] [2024-11-08 16:38:31,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:38:31,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:38:31,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:34,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:38:34,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:34,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:38:34,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:34,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:38:34,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:34,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:38:34,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:34,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:38:34,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:34,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:38:34,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:34,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:38:34,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:34,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:38:34,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:34,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 16:38:34,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:34,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:38:34,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:34,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:38:34,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:34,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:38:34,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:34,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:38:34,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:34,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:38:34,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:34,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 16:38:34,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:34,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 16:38:34,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:34,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 16:38:34,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:34,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 16:38:34,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:34,908 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 16:38:34,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:38:34,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665519944] [2024-11-08 16:38:34,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665519944] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:38:34,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:38:34,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-08 16:38:34,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104093785] [2024-11-08 16:38:34,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:38:34,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 16:38:34,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:38:34,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 16:38:34,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-11-08 16:38:34,914 INFO L87 Difference]: Start difference. First operand 197 states and 287 transitions. Second operand has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2024-11-08 16:38:35,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:38:35,990 INFO L93 Difference]: Finished difference Result 395 states and 575 transitions. [2024-11-08 16:38:35,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 16:38:35,991 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 144 [2024-11-08 16:38:35,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:38:35,994 INFO L225 Difference]: With dead ends: 395 [2024-11-08 16:38:35,994 INFO L226 Difference]: Without dead ends: 268 [2024-11-08 16:38:35,995 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2024-11-08 16:38:35,995 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 178 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 16:38:35,996 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 377 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 16:38:35,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2024-11-08 16:38:36,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 242. [2024-11-08 16:38:36,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 203 states have (on average 1.3891625615763548) internal successors, (282), 203 states have internal predecessors, (282), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-08 16:38:36,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 354 transitions. [2024-11-08 16:38:36,044 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 354 transitions. Word has length 144 [2024-11-08 16:38:36,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:38:36,045 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 354 transitions. [2024-11-08 16:38:36,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2024-11-08 16:38:36,045 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 354 transitions. [2024-11-08 16:38:36,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-08 16:38:36,048 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:38:36,048 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:38:36,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 16:38:36,049 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:38:36,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:38:36,049 INFO L85 PathProgramCache]: Analyzing trace with hash 256553373, now seen corresponding path program 1 times [2024-11-08 16:38:36,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:38:36,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158831557] [2024-11-08 16:38:36,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:38:36,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:38:36,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:36,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:38:36,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:36,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:38:36,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:36,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:38:36,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:36,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:38:36,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:36,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:38:36,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:36,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:38:36,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:36,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:38:36,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:36,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:38:36,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:36,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 16:38:36,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:36,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:38:36,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:36,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:38:36,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:36,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:38:36,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:36,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:38:36,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:36,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:38:36,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:36,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 16:38:36,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:36,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 16:38:36,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:36,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 16:38:36,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:36,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 16:38:36,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:36,211 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 16:38:36,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:38:36,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158831557] [2024-11-08 16:38:36,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158831557] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:38:36,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:38:36,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 16:38:36,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397885735] [2024-11-08 16:38:36,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:38:36,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 16:38:36,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:38:36,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 16:38:36,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:38:36,214 INFO L87 Difference]: Start difference. First operand 242 states and 354 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 16:38:36,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:38:36,258 INFO L93 Difference]: Finished difference Result 420 states and 618 transitions. [2024-11-08 16:38:36,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 16:38:36,259 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 145 [2024-11-08 16:38:36,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:38:36,262 INFO L225 Difference]: With dead ends: 420 [2024-11-08 16:38:36,262 INFO L226 Difference]: Without dead ends: 245 [2024-11-08 16:38:36,264 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 38 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:38:36,265 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 0 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:38:36,265 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 262 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 16:38:36,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2024-11-08 16:38:36,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 245. [2024-11-08 16:38:36,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 206 states have (on average 1.383495145631068) internal successors, (285), 206 states have internal predecessors, (285), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-08 16:38:36,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 357 transitions. [2024-11-08 16:38:36,313 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 357 transitions. Word has length 145 [2024-11-08 16:38:36,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:38:36,314 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 357 transitions. [2024-11-08 16:38:36,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 16:38:36,314 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 357 transitions. [2024-11-08 16:38:36,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-08 16:38:36,322 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:38:36,322 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:38:36,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 16:38:36,323 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:38:36,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:38:36,323 INFO L85 PathProgramCache]: Analyzing trace with hash 2061991707, now seen corresponding path program 1 times [2024-11-08 16:38:36,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:38:36,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628551569] [2024-11-08 16:38:36,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:38:36,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:38:36,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:36,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:38:36,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:36,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:38:36,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:36,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:38:36,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:36,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:38:36,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:36,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:38:36,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:36,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:38:36,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:36,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:38:36,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:36,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:38:36,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:36,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 16:38:36,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:36,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:38:36,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:36,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:38:36,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:36,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:38:36,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:36,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:38:36,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:36,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:38:36,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:36,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 16:38:36,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:36,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 16:38:36,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:36,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 16:38:36,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:36,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 16:38:36,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:36,827 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 16:38:36,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:38:36,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628551569] [2024-11-08 16:38:36,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628551569] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:38:36,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:38:36,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 16:38:36,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390797413] [2024-11-08 16:38:36,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:38:36,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 16:38:36,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:38:36,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 16:38:36,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 16:38:36,831 INFO L87 Difference]: Start difference. First operand 245 states and 357 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 16:38:37,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:38:37,274 INFO L93 Difference]: Finished difference Result 478 states and 696 transitions. [2024-11-08 16:38:37,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 16:38:37,275 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 145 [2024-11-08 16:38:37,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:38:37,278 INFO L225 Difference]: With dead ends: 478 [2024-11-08 16:38:37,278 INFO L226 Difference]: Without dead ends: 313 [2024-11-08 16:38:37,279 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-08 16:38:37,279 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 43 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 16:38:37,280 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 420 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 16:38:37,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2024-11-08 16:38:37,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 286. [2024-11-08 16:38:37,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 247 states have (on average 1.3967611336032388) internal successors, (345), 247 states have internal predecessors, (345), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-08 16:38:37,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 417 transitions. [2024-11-08 16:38:37,327 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 417 transitions. Word has length 145 [2024-11-08 16:38:37,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:38:37,329 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 417 transitions. [2024-11-08 16:38:37,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 16:38:37,329 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 417 transitions. [2024-11-08 16:38:37,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-08 16:38:37,331 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:38:37,331 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:38:37,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 16:38:37,331 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:38:37,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:38:37,332 INFO L85 PathProgramCache]: Analyzing trace with hash -633217577, now seen corresponding path program 1 times [2024-11-08 16:38:37,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:38:37,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615552826] [2024-11-08 16:38:37,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:38:37,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:38:37,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:37,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:38:37,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:37,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:38:37,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:37,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:38:37,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:37,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:38:37,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:37,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:38:37,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:37,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:38:37,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:37,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:38:37,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:37,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:38:37,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:37,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 16:38:37,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:37,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:38:37,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:37,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:38:37,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:37,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:38:37,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:37,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:38:37,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:37,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:38:37,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:37,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 16:38:37,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:37,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 16:38:37,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:37,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 16:38:37,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:37,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 16:38:37,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:37,736 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 16:38:37,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:38:37,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615552826] [2024-11-08 16:38:37,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615552826] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:38:37,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:38:37,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 16:38:37,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180385260] [2024-11-08 16:38:37,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:38:37,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 16:38:37,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:38:37,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 16:38:37,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 16:38:37,739 INFO L87 Difference]: Start difference. First operand 286 states and 417 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 16:38:38,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:38:38,173 INFO L93 Difference]: Finished difference Result 500 states and 726 transitions. [2024-11-08 16:38:38,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 16:38:38,174 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 145 [2024-11-08 16:38:38,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:38:38,175 INFO L225 Difference]: With dead ends: 500 [2024-11-08 16:38:38,175 INFO L226 Difference]: Without dead ends: 300 [2024-11-08 16:38:38,176 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-08 16:38:38,177 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 48 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 16:38:38,178 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 435 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 16:38:38,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2024-11-08 16:38:38,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 273. [2024-11-08 16:38:38,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 234 states have (on average 1.3803418803418803) internal successors, (323), 234 states have internal predecessors, (323), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-08 16:38:38,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 395 transitions. [2024-11-08 16:38:38,221 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 395 transitions. Word has length 145 [2024-11-08 16:38:38,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:38:38,222 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 395 transitions. [2024-11-08 16:38:38,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 16:38:38,222 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 395 transitions. [2024-11-08 16:38:38,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-08 16:38:38,224 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:38:38,224 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:38:38,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 16:38:38,225 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:38:38,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:38:38,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1075390657, now seen corresponding path program 1 times [2024-11-08 16:38:38,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:38:38,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734763903] [2024-11-08 16:38:38,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:38:38,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:38:38,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:38,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:38:38,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:38,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:38:38,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:38,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:38:38,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:38,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:38:38,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:38,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:38:38,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:38,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:38:38,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:38,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:38:38,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:38,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:38:38,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:38,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 16:38:38,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:38,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:38:38,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:38,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:38:38,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:38,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:38:38,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:38,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:38:38,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:38,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:38:38,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:38,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 16:38:38,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:38,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 16:38:38,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:38,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 16:38:38,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:38,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 16:38:38,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:38,375 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 16:38:38,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:38:38,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734763903] [2024-11-08 16:38:38,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734763903] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:38:38,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:38:38,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 16:38:38,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670357528] [2024-11-08 16:38:38,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:38:38,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 16:38:38,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:38:38,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 16:38:38,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:38:38,378 INFO L87 Difference]: Start difference. First operand 273 states and 395 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 16:38:38,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:38:38,426 INFO L93 Difference]: Finished difference Result 461 states and 668 transitions. [2024-11-08 16:38:38,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 16:38:38,427 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 147 [2024-11-08 16:38:38,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:38:38,429 INFO L225 Difference]: With dead ends: 461 [2024-11-08 16:38:38,429 INFO L226 Difference]: Without dead ends: 274 [2024-11-08 16:38:38,429 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 38 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:38:38,430 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 0 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:38:38,431 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 261 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 16:38:38,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2024-11-08 16:38:38,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 274. [2024-11-08 16:38:38,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 235 states have (on average 1.3787234042553191) internal successors, (324), 235 states have internal predecessors, (324), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-08 16:38:38,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 396 transitions. [2024-11-08 16:38:38,465 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 396 transitions. Word has length 147 [2024-11-08 16:38:38,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:38:38,466 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 396 transitions. [2024-11-08 16:38:38,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 16:38:38,466 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 396 transitions. [2024-11-08 16:38:38,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-08 16:38:38,468 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:38:38,468 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:38:38,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 16:38:38,468 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:38:38,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:38:38,469 INFO L85 PathProgramCache]: Analyzing trace with hash 1333556095, now seen corresponding path program 1 times [2024-11-08 16:38:38,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:38:38,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530769762] [2024-11-08 16:38:38,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:38:38,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:38:38,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:38,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:38:38,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:38,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:38:38,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:38,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:38:38,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:38,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:38:38,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:38,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:38:38,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:38,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:38:38,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:38,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:38:38,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:38,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:38:38,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:38,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 16:38:38,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:38,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:38:38,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:38,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:38:38,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:38,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:38:38,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:38,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:38:38,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:38,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:38:38,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:38,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 16:38:38,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:38,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 16:38:38,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:38,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 16:38:38,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:38,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 16:38:38,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:38,763 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 16:38:38,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:38:38,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530769762] [2024-11-08 16:38:38,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530769762] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:38:38,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:38:38,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 16:38:38,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575989286] [2024-11-08 16:38:38,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:38:38,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 16:38:38,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:38:38,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 16:38:38,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 16:38:38,769 INFO L87 Difference]: Start difference. First operand 274 states and 396 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 16:38:38,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:38:38,834 INFO L93 Difference]: Finished difference Result 466 states and 673 transitions. [2024-11-08 16:38:38,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 16:38:38,835 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 147 [2024-11-08 16:38:38,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:38:38,836 INFO L225 Difference]: With dead ends: 466 [2024-11-08 16:38:38,837 INFO L226 Difference]: Without dead ends: 278 [2024-11-08 16:38:38,837 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 16:38:38,838 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 0 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 644 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:38:38,838 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 644 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 16:38:38,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2024-11-08 16:38:38,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 275. [2024-11-08 16:38:38,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 236 states have (on average 1.3771186440677967) internal successors, (325), 236 states have internal predecessors, (325), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-08 16:38:38,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 397 transitions. [2024-11-08 16:38:38,869 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 397 transitions. Word has length 147 [2024-11-08 16:38:38,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:38:38,870 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 397 transitions. [2024-11-08 16:38:38,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 16:38:38,870 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 397 transitions. [2024-11-08 16:38:38,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-08 16:38:38,872 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:38:38,872 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:38:38,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-08 16:38:38,873 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:38:38,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:38:38,873 INFO L85 PathProgramCache]: Analyzing trace with hash -593797957, now seen corresponding path program 1 times [2024-11-08 16:38:38,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:38:38,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693019249] [2024-11-08 16:38:38,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:38:38,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:38:39,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:39,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:38:39,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:39,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:38:39,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:39,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:38:39,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:39,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:38:39,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:39,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:38:39,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:39,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:38:39,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:39,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:38:39,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:39,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:38:39,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:39,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 16:38:39,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:39,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:38:39,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:39,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:38:39,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:39,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:38:39,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:39,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 16:38:39,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:39,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 16:38:39,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:39,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 16:38:39,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:39,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 16:38:39,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:39,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 16:38:39,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:39,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 16:38:39,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:39,965 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 16:38:39,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:38:39,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693019249] [2024-11-08 16:38:39,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693019249] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:38:39,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:38:39,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 16:38:39,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208148814] [2024-11-08 16:38:39,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:38:39,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 16:38:39,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:38:39,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 16:38:39,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-11-08 16:38:39,967 INFO L87 Difference]: Start difference. First operand 275 states and 397 transitions. Second operand has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 16:38:40,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:38:40,460 INFO L93 Difference]: Finished difference Result 640 states and 926 transitions. [2024-11-08 16:38:40,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 16:38:40,460 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 147 [2024-11-08 16:38:40,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:38:40,463 INFO L225 Difference]: With dead ends: 640 [2024-11-08 16:38:40,463 INFO L226 Difference]: Without dead ends: 451 [2024-11-08 16:38:40,463 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2024-11-08 16:38:40,464 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 300 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 16:38:40,464 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 251 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 16:38:40,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2024-11-08 16:38:40,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 435. [2024-11-08 16:38:40,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 435 states, 396 states have (on average 1.4166666666666667) internal successors, (561), 396 states have internal predecessors, (561), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-08 16:38:40,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 633 transitions. [2024-11-08 16:38:40,502 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 633 transitions. Word has length 147 [2024-11-08 16:38:40,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:38:40,502 INFO L471 AbstractCegarLoop]: Abstraction has 435 states and 633 transitions. [2024-11-08 16:38:40,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 16:38:40,503 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 633 transitions. [2024-11-08 16:38:40,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-08 16:38:40,504 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:38:40,505 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:38:40,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-08 16:38:40,505 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:38:40,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:38:40,505 INFO L85 PathProgramCache]: Analyzing trace with hash -1273856327, now seen corresponding path program 1 times [2024-11-08 16:38:40,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:38:40,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075106417] [2024-11-08 16:38:40,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:38:40,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:38:40,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 16:38:40,853 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 16:38:40,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 16:38:41,082 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 16:38:41,083 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 16:38:41,084 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 16:38:41,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-08 16:38:41,089 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:38:41,259 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 16:38:41,263 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 04:38:41 BoogieIcfgContainer [2024-11-08 16:38:41,263 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 16:38:41,263 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 16:38:41,264 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 16:38:41,264 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 16:38:41,264 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:38:21" (3/4) ... [2024-11-08 16:38:41,267 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 16:38:41,268 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 16:38:41,269 INFO L158 Benchmark]: Toolchain (without parser) took 21342.20ms. Allocated memory was 100.7MB in the beginning and 379.6MB in the end (delta: 278.9MB). Free memory was 55.5MB in the beginning and 170.6MB in the end (delta: -115.1MB). Peak memory consumption was 165.3MB. Max. memory is 16.1GB. [2024-11-08 16:38:41,269 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 100.7MB. Free memory is still 56.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 16:38:41,269 INFO L158 Benchmark]: CACSL2BoogieTranslator took 399.76ms. Allocated memory was 100.7MB in the beginning and 142.6MB in the end (delta: 41.9MB). Free memory was 55.5MB in the beginning and 113.5MB in the end (delta: -58.1MB). Peak memory consumption was 23.2MB. Max. memory is 16.1GB. [2024-11-08 16:38:41,270 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.79ms. Allocated memory is still 142.6MB. Free memory was 113.5MB in the beginning and 109.7MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 16:38:41,270 INFO L158 Benchmark]: Boogie Preprocessor took 78.32ms. Allocated memory is still 142.6MB. Free memory was 109.7MB in the beginning and 106.6MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 16:38:41,270 INFO L158 Benchmark]: RCFGBuilder took 1098.27ms. Allocated memory is still 142.6MB. Free memory was 106.6MB in the beginning and 74.1MB in the end (delta: 32.6MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-11-08 16:38:41,271 INFO L158 Benchmark]: TraceAbstraction took 19681.42ms. Allocated memory was 142.6MB in the beginning and 379.6MB in the end (delta: 237.0MB). Free memory was 73.6MB in the beginning and 170.6MB in the end (delta: -97.0MB). Peak memory consumption was 140.0MB. Max. memory is 16.1GB. [2024-11-08 16:38:41,271 INFO L158 Benchmark]: Witness Printer took 4.92ms. Allocated memory is still 379.6MB. Free memory is still 170.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 16:38:41,273 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.27ms. Allocated memory is still 100.7MB. Free memory is still 56.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 399.76ms. Allocated memory was 100.7MB in the beginning and 142.6MB in the end (delta: 41.9MB). Free memory was 55.5MB in the beginning and 113.5MB in the end (delta: -58.1MB). Peak memory consumption was 23.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 69.79ms. Allocated memory is still 142.6MB. Free memory was 113.5MB in the beginning and 109.7MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 78.32ms. Allocated memory is still 142.6MB. Free memory was 109.7MB in the beginning and 106.6MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1098.27ms. Allocated memory is still 142.6MB. Free memory was 106.6MB in the beginning and 74.1MB in the end (delta: 32.6MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 19681.42ms. Allocated memory was 142.6MB in the beginning and 379.6MB in the end (delta: 237.0MB). Free memory was 73.6MB in the beginning and 170.6MB in the end (delta: -97.0MB). Peak memory consumption was 140.0MB. Max. memory is 16.1GB. * Witness Printer took 4.92ms. Allocated memory is still 379.6MB. Free memory is still 170.6MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 132. Possible FailurePath: [L37] unsigned char isInitial = 0; [L38-L52] struct WrapperStruct00 WrapperStruct00 = { 1, 0, 0, 1, 64, 4, -4, 32, 32, -64, 50, 16, 63.5 }; [L53] signed long int* WrapperStruct00_var_1_1_Pointer = &(WrapperStruct00.var_1_1); [L54] unsigned char* WrapperStruct00_var_1_4_Pointer = &(WrapperStruct00.var_1_4); [L55] unsigned char* WrapperStruct00_var_1_5_Pointer = &(WrapperStruct00.var_1_5); [L56] unsigned char* WrapperStruct00_var_1_6_Pointer = &(WrapperStruct00.var_1_6); [L57] signed char* WrapperStruct00_var_1_9_Pointer = &(WrapperStruct00.var_1_9); [L58] signed char* WrapperStruct00_var_1_10_Pointer = &(WrapperStruct00.var_1_10); [L59] signed char* WrapperStruct00_var_1_11_Pointer = &(WrapperStruct00.var_1_11); [L60] signed char* WrapperStruct00_var_1_12_Pointer = &(WrapperStruct00.var_1_12); [L61] signed char* WrapperStruct00_var_1_13_Pointer = &(WrapperStruct00.var_1_13); [L62] signed char* WrapperStruct00_var_1_14_Pointer = &(WrapperStruct00.var_1_14); [L63] signed char* WrapperStruct00_var_1_15_Pointer = &(WrapperStruct00.var_1_15); [L64] signed char* WrapperStruct00_var_1_16_Pointer = &(WrapperStruct00.var_1_16); [L65] float* WrapperStruct00_var_1_17_Pointer = &(WrapperStruct00.var_1_17); [L66] signed char last_1_WrapperStruct00_var_1_9 = 64; [L67] signed char last_1_WrapperStruct00_var_1_14 = -64; VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=0, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L136] isInitial = 1 [L137] FCALL initially() [L138] COND TRUE 1 [L139] CALL updateLastVariables() [L128] EXPR WrapperStruct00.var_1_9 [L128] last_1_WrapperStruct00_var_1_9 = WrapperStruct00.var_1_9 [L129] EXPR WrapperStruct00.var_1_14 [L129] last_1_WrapperStruct00_var_1_14 = WrapperStruct00.var_1_14 [L139] RET updateLastVariables() [L140] CALL updateVariables() [L99] WrapperStruct00.var_1_4 = __VERIFIER_nondet_uchar() [L100] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L100] CALL assume_abort_if_not(WrapperStruct00.var_1_4 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L100] RET assume_abort_if_not(WrapperStruct00.var_1_4 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L101] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L101] CALL assume_abort_if_not(WrapperStruct00.var_1_4 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L101] RET assume_abort_if_not(WrapperStruct00.var_1_4 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L102] WrapperStruct00.var_1_5 = __VERIFIER_nondet_uchar() [L103] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L103] CALL assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L103] RET assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L104] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L104] CALL assume_abort_if_not(WrapperStruct00.var_1_5 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L104] RET assume_abort_if_not(WrapperStruct00.var_1_5 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L105] WrapperStruct00.var_1_6 = __VERIFIER_nondet_uchar() [L106] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L106] CALL assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L106] RET assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L107] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L107] CALL assume_abort_if_not(WrapperStruct00.var_1_6 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L107] RET assume_abort_if_not(WrapperStruct00.var_1_6 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L108] WrapperStruct00.var_1_10 = __VERIFIER_nondet_char() [L109] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L109] CALL assume_abort_if_not(WrapperStruct00.var_1_10 >= -127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L109] RET assume_abort_if_not(WrapperStruct00.var_1_10 >= -127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L110] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L110] CALL assume_abort_if_not(WrapperStruct00.var_1_10 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L110] RET assume_abort_if_not(WrapperStruct00.var_1_10 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L111] WrapperStruct00.var_1_11 = __VERIFIER_nondet_char() [L112] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L112] CALL assume_abort_if_not(WrapperStruct00.var_1_11 >= -127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L112] RET assume_abort_if_not(WrapperStruct00.var_1_11 >= -127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L113] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L113] CALL assume_abort_if_not(WrapperStruct00.var_1_11 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L113] RET assume_abort_if_not(WrapperStruct00.var_1_11 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L114] WrapperStruct00.var_1_12 = __VERIFIER_nondet_char() [L115] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L115] CALL assume_abort_if_not(WrapperStruct00.var_1_12 >= -1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L115] RET assume_abort_if_not(WrapperStruct00.var_1_12 >= -1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L116] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L116] CALL assume_abort_if_not(WrapperStruct00.var_1_12 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L116] RET assume_abort_if_not(WrapperStruct00.var_1_12 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L117] WrapperStruct00.var_1_13 = __VERIFIER_nondet_char() [L118] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L118] CALL assume_abort_if_not(WrapperStruct00.var_1_13 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L118] RET assume_abort_if_not(WrapperStruct00.var_1_13 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L119] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L119] CALL assume_abort_if_not(WrapperStruct00.var_1_13 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L119] RET assume_abort_if_not(WrapperStruct00.var_1_13 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L120] WrapperStruct00.var_1_15 = __VERIFIER_nondet_char() [L121] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L121] CALL assume_abort_if_not(WrapperStruct00.var_1_15 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L121] RET assume_abort_if_not(WrapperStruct00.var_1_15 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L122] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L122] CALL assume_abort_if_not(WrapperStruct00.var_1_15 <= 64) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L122] RET assume_abort_if_not(WrapperStruct00.var_1_15 <= 64) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L123] WrapperStruct00.var_1_16 = __VERIFIER_nondet_char() [L124] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L124] CALL assume_abort_if_not(WrapperStruct00.var_1_16 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L124] RET assume_abort_if_not(WrapperStruct00.var_1_16 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L125] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L125] CALL assume_abort_if_not(WrapperStruct00.var_1_16 <= 63) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L125] RET assume_abort_if_not(WrapperStruct00.var_1_16 <= 63) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L140] RET updateVariables() [L141] CALL step() [L71] EXPR \read(*WrapperStruct00_var_1_6_Pointer) [L71] unsigned char stepLocal_0 = (*(WrapperStruct00_var_1_6_Pointer)); [L72] COND TRUE ! (last_1_WrapperStruct00_var_1_14 >= last_1_WrapperStruct00_var_1_9) [L73] EXPR \read(*WrapperStruct00_var_1_4_Pointer) [L73] EXPR (*(WrapperStruct00_var_1_4_Pointer)) || (*(WrapperStruct00_var_1_5_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64, stepLocal_0=-255] [L73] COND TRUE ((*(WrapperStruct00_var_1_4_Pointer)) || (*(WrapperStruct00_var_1_5_Pointer))) && stepLocal_0 [L74] (*(WrapperStruct00_var_1_1_Pointer)) = ((((last_1_WrapperStruct00_var_1_9) < (last_1_WrapperStruct00_var_1_14)) ? (last_1_WrapperStruct00_var_1_9) : (last_1_WrapperStruct00_var_1_14))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L81] EXPR \read(*WrapperStruct00_var_1_15_Pointer) [L81] EXPR \read(*WrapperStruct00_var_1_16_Pointer) [L81] EXPR \read(*WrapperStruct00_var_1_13_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L81] EXPR ((64) > ((*(WrapperStruct00_var_1_13_Pointer)))) ? (64) : ((*(WrapperStruct00_var_1_13_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L81] signed long int stepLocal_3 = ((*(WrapperStruct00_var_1_15_Pointer)) + (*(WrapperStruct00_var_1_16_Pointer))) - ((((64) > ((*(WrapperStruct00_var_1_13_Pointer)))) ? (64) : ((*(WrapperStruct00_var_1_13_Pointer))))); [L82] EXPR \read(*WrapperStruct00_var_1_12_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64, stepLocal_3=0] [L82] COND TRUE (*(WrapperStruct00_var_1_12_Pointer)) < stepLocal_3 [L83] EXPR \read(*WrapperStruct00_var_1_16_Pointer) [L83] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L83] (*(WrapperStruct00_var_1_14_Pointer)) = ((64 - (*(WrapperStruct00_var_1_16_Pointer))) - (*(WrapperStruct00_var_1_13_Pointer))) [L87] (*(WrapperStruct00_var_1_17_Pointer)) = 128.91f [L88] EXPR \read(*WrapperStruct00_var_1_14_Pointer) [L88] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L88] unsigned char stepLocal_2 = (*(WrapperStruct00_var_1_14_Pointer)) == (*(WrapperStruct00_var_1_1_Pointer)); [L89] EXPR \read(*WrapperStruct00_var_1_5_Pointer) [L89] unsigned char stepLocal_1 = (*(WrapperStruct00_var_1_5_Pointer)); [L90] stepLocal_1 && (*(WrapperStruct00_var_1_4_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64, stepLocal_2=0] [L90] COND FALSE !(stepLocal_1 && (*(WrapperStruct00_var_1_4_Pointer))) [L95] EXPR \read(*WrapperStruct00_var_1_12_Pointer) [L95] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L95] (*(WrapperStruct00_var_1_9_Pointer)) = ((*(WrapperStruct00_var_1_12_Pointer)) - (*(WrapperStruct00_var_1_13_Pointer))) [L141] RET step() [L142] CALL, EXPR property() [L132] EXPR (! (last_1_WrapperStruct00_var_1_14 >= last_1_WrapperStruct00_var_1_9)) ? ((((*(WrapperStruct00_var_1_4_Pointer)) || (*(WrapperStruct00_var_1_5_Pointer))) && (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) ((((last_1_WrapperStruct00_var_1_9) < (last_1_WrapperStruct00_var_1_14)) ? (last_1_WrapperStruct00_var_1_9) : (last_1_WrapperStruct00_var_1_14))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) last_1_WrapperStruct00_var_1_14))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) last_1_WrapperStruct00_var_1_14)) [L132] EXPR \read(*WrapperStruct00_var_1_4_Pointer) [L132] EXPR (*(WrapperStruct00_var_1_4_Pointer)) || (*(WrapperStruct00_var_1_5_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L132] EXPR ((*(WrapperStruct00_var_1_4_Pointer)) || (*(WrapperStruct00_var_1_5_Pointer))) && (*(WrapperStruct00_var_1_6_Pointer)) [L132] EXPR \read(*WrapperStruct00_var_1_6_Pointer) [L132] EXPR ((*(WrapperStruct00_var_1_4_Pointer)) || (*(WrapperStruct00_var_1_5_Pointer))) && (*(WrapperStruct00_var_1_6_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L132] EXPR (((*(WrapperStruct00_var_1_4_Pointer)) || (*(WrapperStruct00_var_1_5_Pointer))) && (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) ((((last_1_WrapperStruct00_var_1_9) < (last_1_WrapperStruct00_var_1_14)) ? (last_1_WrapperStruct00_var_1_9) : (last_1_WrapperStruct00_var_1_14))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) last_1_WrapperStruct00_var_1_14)) [L132] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L132] EXPR (((*(WrapperStruct00_var_1_4_Pointer)) || (*(WrapperStruct00_var_1_5_Pointer))) && (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) ((((last_1_WrapperStruct00_var_1_9) < (last_1_WrapperStruct00_var_1_14)) ? (last_1_WrapperStruct00_var_1_9) : (last_1_WrapperStruct00_var_1_14))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) last_1_WrapperStruct00_var_1_14)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L132] EXPR (! (last_1_WrapperStruct00_var_1_14 >= last_1_WrapperStruct00_var_1_9)) ? ((((*(WrapperStruct00_var_1_4_Pointer)) || (*(WrapperStruct00_var_1_5_Pointer))) && (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) ((((last_1_WrapperStruct00_var_1_9) < (last_1_WrapperStruct00_var_1_14)) ? (last_1_WrapperStruct00_var_1_9) : (last_1_WrapperStruct00_var_1_14))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) last_1_WrapperStruct00_var_1_14))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) last_1_WrapperStruct00_var_1_14)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L132] EXPR ((! (last_1_WrapperStruct00_var_1_14 >= last_1_WrapperStruct00_var_1_9)) ? ((((*(WrapperStruct00_var_1_4_Pointer)) || (*(WrapperStruct00_var_1_5_Pointer))) && (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) ((((last_1_WrapperStruct00_var_1_9) < (last_1_WrapperStruct00_var_1_14)) ? (last_1_WrapperStruct00_var_1_9) : (last_1_WrapperStruct00_var_1_14))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) last_1_WrapperStruct00_var_1_14))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) last_1_WrapperStruct00_var_1_14))) && (((*(WrapperStruct00_var_1_5_Pointer)) && (*(WrapperStruct00_var_1_4_Pointer))) ? (((*(WrapperStruct00_var_1_6_Pointer)) || ((*(WrapperStruct00_var_1_14_Pointer)) == (*(WrapperStruct00_var_1_1_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((signed char) (((((*(WrapperStruct00_var_1_10_Pointer))) < ((*(WrapperStruct00_var_1_11_Pointer)))) ? ((*(WrapperStruct00_var_1_10_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer))))))) : 1) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_12_Pointer)) - (*(WrapperStruct00_var_1_13_Pointer)))))) [L132] EXPR \read(*WrapperStruct00_var_1_5_Pointer) [L132] EXPR (*(WrapperStruct00_var_1_5_Pointer)) && (*(WrapperStruct00_var_1_4_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L132] EXPR ((*(WrapperStruct00_var_1_5_Pointer)) && (*(WrapperStruct00_var_1_4_Pointer))) ? (((*(WrapperStruct00_var_1_6_Pointer)) || ((*(WrapperStruct00_var_1_14_Pointer)) == (*(WrapperStruct00_var_1_1_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((signed char) (((((*(WrapperStruct00_var_1_10_Pointer))) < ((*(WrapperStruct00_var_1_11_Pointer)))) ? ((*(WrapperStruct00_var_1_10_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer))))))) : 1) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_12_Pointer)) - (*(WrapperStruct00_var_1_13_Pointer))))) [L132] EXPR \read(*WrapperStruct00_var_1_9_Pointer) [L132] EXPR \read(*WrapperStruct00_var_1_12_Pointer) [L132] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L132] EXPR ((*(WrapperStruct00_var_1_5_Pointer)) && (*(WrapperStruct00_var_1_4_Pointer))) ? (((*(WrapperStruct00_var_1_6_Pointer)) || ((*(WrapperStruct00_var_1_14_Pointer)) == (*(WrapperStruct00_var_1_1_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((signed char) (((((*(WrapperStruct00_var_1_10_Pointer))) < ((*(WrapperStruct00_var_1_11_Pointer)))) ? ((*(WrapperStruct00_var_1_10_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer))))))) : 1) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_12_Pointer)) - (*(WrapperStruct00_var_1_13_Pointer))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L132] EXPR ((! (last_1_WrapperStruct00_var_1_14 >= last_1_WrapperStruct00_var_1_9)) ? ((((*(WrapperStruct00_var_1_4_Pointer)) || (*(WrapperStruct00_var_1_5_Pointer))) && (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) ((((last_1_WrapperStruct00_var_1_9) < (last_1_WrapperStruct00_var_1_14)) ? (last_1_WrapperStruct00_var_1_9) : (last_1_WrapperStruct00_var_1_14))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) last_1_WrapperStruct00_var_1_14))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) last_1_WrapperStruct00_var_1_14))) && (((*(WrapperStruct00_var_1_5_Pointer)) && (*(WrapperStruct00_var_1_4_Pointer))) ? (((*(WrapperStruct00_var_1_6_Pointer)) || ((*(WrapperStruct00_var_1_14_Pointer)) == (*(WrapperStruct00_var_1_1_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((signed char) (((((*(WrapperStruct00_var_1_10_Pointer))) < ((*(WrapperStruct00_var_1_11_Pointer)))) ? ((*(WrapperStruct00_var_1_10_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer))))))) : 1) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_12_Pointer)) - (*(WrapperStruct00_var_1_13_Pointer)))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L132] EXPR (((! (last_1_WrapperStruct00_var_1_14 >= last_1_WrapperStruct00_var_1_9)) ? ((((*(WrapperStruct00_var_1_4_Pointer)) || (*(WrapperStruct00_var_1_5_Pointer))) && (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) ((((last_1_WrapperStruct00_var_1_9) < (last_1_WrapperStruct00_var_1_14)) ? (last_1_WrapperStruct00_var_1_9) : (last_1_WrapperStruct00_var_1_14))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) last_1_WrapperStruct00_var_1_14))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) last_1_WrapperStruct00_var_1_14))) && (((*(WrapperStruct00_var_1_5_Pointer)) && (*(WrapperStruct00_var_1_4_Pointer))) ? (((*(WrapperStruct00_var_1_6_Pointer)) || ((*(WrapperStruct00_var_1_14_Pointer)) == (*(WrapperStruct00_var_1_1_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((signed char) (((((*(WrapperStruct00_var_1_10_Pointer))) < ((*(WrapperStruct00_var_1_11_Pointer)))) ? ((*(WrapperStruct00_var_1_10_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer))))))) : 1) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_12_Pointer)) - (*(WrapperStruct00_var_1_13_Pointer))))))) && (((*(WrapperStruct00_var_1_12_Pointer)) < (((*(WrapperStruct00_var_1_15_Pointer)) + (*(WrapperStruct00_var_1_16_Pointer))) - ((((64) > ((*(WrapperStruct00_var_1_13_Pointer)))) ? (64) : ((*(WrapperStruct00_var_1_13_Pointer))))))) ? ((*(WrapperStruct00_var_1_14_Pointer)) == ((signed char) ((64 - (*(WrapperStruct00_var_1_16_Pointer))) - (*(WrapperStruct00_var_1_13_Pointer))))) : ((*(WrapperStruct00_var_1_14_Pointer)) == ((signed char) (((((*(WrapperStruct00_var_1_10_Pointer))) < ((*(WrapperStruct00_var_1_11_Pointer)))) ? ((*(WrapperStruct00_var_1_10_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer)))))))) [L132] EXPR \read(*WrapperStruct00_var_1_12_Pointer) [L132] EXPR \read(*WrapperStruct00_var_1_15_Pointer) [L132] EXPR \read(*WrapperStruct00_var_1_16_Pointer) [L132] EXPR \read(*WrapperStruct00_var_1_13_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L132] EXPR ((64) > ((*(WrapperStruct00_var_1_13_Pointer)))) ? (64) : ((*(WrapperStruct00_var_1_13_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L132] EXPR ((*(WrapperStruct00_var_1_12_Pointer)) < (((*(WrapperStruct00_var_1_15_Pointer)) + (*(WrapperStruct00_var_1_16_Pointer))) - ((((64) > ((*(WrapperStruct00_var_1_13_Pointer)))) ? (64) : ((*(WrapperStruct00_var_1_13_Pointer))))))) ? ((*(WrapperStruct00_var_1_14_Pointer)) == ((signed char) ((64 - (*(WrapperStruct00_var_1_16_Pointer))) - (*(WrapperStruct00_var_1_13_Pointer))))) : ((*(WrapperStruct00_var_1_14_Pointer)) == ((signed char) (((((*(WrapperStruct00_var_1_10_Pointer))) < ((*(WrapperStruct00_var_1_11_Pointer)))) ? ((*(WrapperStruct00_var_1_10_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer))))))) [L132] EXPR \read(*WrapperStruct00_var_1_14_Pointer) [L132] EXPR \read(*WrapperStruct00_var_1_16_Pointer) [L132] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L132] EXPR ((*(WrapperStruct00_var_1_12_Pointer)) < (((*(WrapperStruct00_var_1_15_Pointer)) + (*(WrapperStruct00_var_1_16_Pointer))) - ((((64) > ((*(WrapperStruct00_var_1_13_Pointer)))) ? (64) : ((*(WrapperStruct00_var_1_13_Pointer))))))) ? ((*(WrapperStruct00_var_1_14_Pointer)) == ((signed char) ((64 - (*(WrapperStruct00_var_1_16_Pointer))) - (*(WrapperStruct00_var_1_13_Pointer))))) : ((*(WrapperStruct00_var_1_14_Pointer)) == ((signed char) (((((*(WrapperStruct00_var_1_10_Pointer))) < ((*(WrapperStruct00_var_1_11_Pointer)))) ? ((*(WrapperStruct00_var_1_10_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer))))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L132] EXPR (((! (last_1_WrapperStruct00_var_1_14 >= last_1_WrapperStruct00_var_1_9)) ? ((((*(WrapperStruct00_var_1_4_Pointer)) || (*(WrapperStruct00_var_1_5_Pointer))) && (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) ((((last_1_WrapperStruct00_var_1_9) < (last_1_WrapperStruct00_var_1_14)) ? (last_1_WrapperStruct00_var_1_9) : (last_1_WrapperStruct00_var_1_14))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) last_1_WrapperStruct00_var_1_14))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) last_1_WrapperStruct00_var_1_14))) && (((*(WrapperStruct00_var_1_5_Pointer)) && (*(WrapperStruct00_var_1_4_Pointer))) ? (((*(WrapperStruct00_var_1_6_Pointer)) || ((*(WrapperStruct00_var_1_14_Pointer)) == (*(WrapperStruct00_var_1_1_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((signed char) (((((*(WrapperStruct00_var_1_10_Pointer))) < ((*(WrapperStruct00_var_1_11_Pointer)))) ? ((*(WrapperStruct00_var_1_10_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer))))))) : 1) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_12_Pointer)) - (*(WrapperStruct00_var_1_13_Pointer))))))) && (((*(WrapperStruct00_var_1_12_Pointer)) < (((*(WrapperStruct00_var_1_15_Pointer)) + (*(WrapperStruct00_var_1_16_Pointer))) - ((((64) > ((*(WrapperStruct00_var_1_13_Pointer)))) ? (64) : ((*(WrapperStruct00_var_1_13_Pointer))))))) ? ((*(WrapperStruct00_var_1_14_Pointer)) == ((signed char) ((64 - (*(WrapperStruct00_var_1_16_Pointer))) - (*(WrapperStruct00_var_1_13_Pointer))))) : ((*(WrapperStruct00_var_1_14_Pointer)) == ((signed char) (((((*(WrapperStruct00_var_1_10_Pointer))) < ((*(WrapperStruct00_var_1_11_Pointer)))) ? ((*(WrapperStruct00_var_1_10_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer)))))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L132] EXPR ((((! (last_1_WrapperStruct00_var_1_14 >= last_1_WrapperStruct00_var_1_9)) ? ((((*(WrapperStruct00_var_1_4_Pointer)) || (*(WrapperStruct00_var_1_5_Pointer))) && (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) ((((last_1_WrapperStruct00_var_1_9) < (last_1_WrapperStruct00_var_1_14)) ? (last_1_WrapperStruct00_var_1_9) : (last_1_WrapperStruct00_var_1_14))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) last_1_WrapperStruct00_var_1_14))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) last_1_WrapperStruct00_var_1_14))) && (((*(WrapperStruct00_var_1_5_Pointer)) && (*(WrapperStruct00_var_1_4_Pointer))) ? (((*(WrapperStruct00_var_1_6_Pointer)) || ((*(WrapperStruct00_var_1_14_Pointer)) == (*(WrapperStruct00_var_1_1_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((signed char) (((((*(WrapperStruct00_var_1_10_Pointer))) < ((*(WrapperStruct00_var_1_11_Pointer)))) ? ((*(WrapperStruct00_var_1_10_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer))))))) : 1) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_12_Pointer)) - (*(WrapperStruct00_var_1_13_Pointer))))))) && (((*(WrapperStruct00_var_1_12_Pointer)) < (((*(WrapperStruct00_var_1_15_Pointer)) + (*(WrapperStruct00_var_1_16_Pointer))) - ((((64) > ((*(WrapperStruct00_var_1_13_Pointer)))) ? (64) : ((*(WrapperStruct00_var_1_13_Pointer))))))) ? ((*(WrapperStruct00_var_1_14_Pointer)) == ((signed char) ((64 - (*(WrapperStruct00_var_1_16_Pointer))) - (*(WrapperStruct00_var_1_13_Pointer))))) : ((*(WrapperStruct00_var_1_14_Pointer)) == ((signed char) (((((*(WrapperStruct00_var_1_10_Pointer))) < ((*(WrapperStruct00_var_1_11_Pointer)))) ? ((*(WrapperStruct00_var_1_10_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer))))))))) && ((*(WrapperStruct00_var_1_17_Pointer)) == ((float) 128.91f)) [L132] EXPR \read(*WrapperStruct00_var_1_17_Pointer) [L132] EXPR ((((! (last_1_WrapperStruct00_var_1_14 >= last_1_WrapperStruct00_var_1_9)) ? ((((*(WrapperStruct00_var_1_4_Pointer)) || (*(WrapperStruct00_var_1_5_Pointer))) && (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) ((((last_1_WrapperStruct00_var_1_9) < (last_1_WrapperStruct00_var_1_14)) ? (last_1_WrapperStruct00_var_1_9) : (last_1_WrapperStruct00_var_1_14))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) last_1_WrapperStruct00_var_1_14))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) last_1_WrapperStruct00_var_1_14))) && (((*(WrapperStruct00_var_1_5_Pointer)) && (*(WrapperStruct00_var_1_4_Pointer))) ? (((*(WrapperStruct00_var_1_6_Pointer)) || ((*(WrapperStruct00_var_1_14_Pointer)) == (*(WrapperStruct00_var_1_1_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((signed char) (((((*(WrapperStruct00_var_1_10_Pointer))) < ((*(WrapperStruct00_var_1_11_Pointer)))) ? ((*(WrapperStruct00_var_1_10_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer))))))) : 1) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_12_Pointer)) - (*(WrapperStruct00_var_1_13_Pointer))))))) && (((*(WrapperStruct00_var_1_12_Pointer)) < (((*(WrapperStruct00_var_1_15_Pointer)) + (*(WrapperStruct00_var_1_16_Pointer))) - ((((64) > ((*(WrapperStruct00_var_1_13_Pointer)))) ? (64) : ((*(WrapperStruct00_var_1_13_Pointer))))))) ? ((*(WrapperStruct00_var_1_14_Pointer)) == ((signed char) ((64 - (*(WrapperStruct00_var_1_16_Pointer))) - (*(WrapperStruct00_var_1_13_Pointer))))) : ((*(WrapperStruct00_var_1_14_Pointer)) == ((signed char) (((((*(WrapperStruct00_var_1_10_Pointer))) < ((*(WrapperStruct00_var_1_11_Pointer)))) ? ((*(WrapperStruct00_var_1_10_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer))))))))) && ((*(WrapperStruct00_var_1_17_Pointer)) == ((float) 128.91f)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L132-L133] return ((((! (last_1_WrapperStruct00_var_1_14 >= last_1_WrapperStruct00_var_1_9)) ? ((((*(WrapperStruct00_var_1_4_Pointer)) || (*(WrapperStruct00_var_1_5_Pointer))) && (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) ((((last_1_WrapperStruct00_var_1_9) < (last_1_WrapperStruct00_var_1_14)) ? (last_1_WrapperStruct00_var_1_9) : (last_1_WrapperStruct00_var_1_14))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) last_1_WrapperStruct00_var_1_14))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) last_1_WrapperStruct00_var_1_14))) && (((*(WrapperStruct00_var_1_5_Pointer)) && (*(WrapperStruct00_var_1_4_Pointer))) ? (((*(WrapperStruct00_var_1_6_Pointer)) || ((*(WrapperStruct00_var_1_14_Pointer)) == (*(WrapperStruct00_var_1_1_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((signed char) (((((*(WrapperStruct00_var_1_10_Pointer))) < ((*(WrapperStruct00_var_1_11_Pointer)))) ? ((*(WrapperStruct00_var_1_10_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer))))))) : 1) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_12_Pointer)) - (*(WrapperStruct00_var_1_13_Pointer))))))) && (((*(WrapperStruct00_var_1_12_Pointer)) < (((*(WrapperStruct00_var_1_15_Pointer)) + (*(WrapperStruct00_var_1_16_Pointer))) - ((((64) > ((*(WrapperStruct00_var_1_13_Pointer)))) ? (64) : ((*(WrapperStruct00_var_1_13_Pointer))))))) ? ((*(WrapperStruct00_var_1_14_Pointer)) == ((signed char) ((64 - (*(WrapperStruct00_var_1_16_Pointer))) - (*(WrapperStruct00_var_1_13_Pointer))))) : ((*(WrapperStruct00_var_1_14_Pointer)) == ((signed char) (((((*(WrapperStruct00_var_1_10_Pointer))) < ((*(WrapperStruct00_var_1_11_Pointer)))) ? ((*(WrapperStruct00_var_1_10_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer))))))))) && ((*(WrapperStruct00_var_1_17_Pointer)) == ((float) 128.91f)) ; [L142] RET, EXPR property() [L142] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L19] reach_error() VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 97 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 19.4s, OverallIterations: 14, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 5.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1184 SdHoareTripleChecker+Valid, 4.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1184 mSDsluCounter, 4803 SdHoareTripleChecker+Invalid, 3.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3262 mSDsCounter, 162 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2286 IncrementalHoareTripleChecker+Invalid, 2448 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 162 mSolverCounterUnsat, 1541 mSDtfsCounter, 2286 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 588 GetRequests, 518 SyntacticMatches, 3 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=435occurred in iteration=13, InterpolantAutomatonStates: 66, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 13 MinimizatonAttempts, 236 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 10.9s InterpolantComputationTime, 2002 NumberOfCodeBlocks, 2002 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 1842 ConstructedInterpolants, 0 QuantifiedInterpolants, 9630 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 7956/7956 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:38:41,310 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_055507da-aad0-4fa1-82ba-2c1f076d7d62/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-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_055507da-aad0-4fa1-82ba-2c1f076d7d62/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_055507da-aad0-4fa1-82ba-2c1f076d7d62/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_055507da-aad0-4fa1-82ba-2c1f076d7d62/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_055507da-aad0-4fa1-82ba-2c1f076d7d62/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-57.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_055507da-aad0-4fa1-82ba-2c1f076d7d62/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_055507da-aad0-4fa1-82ba-2c1f076d7d62/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 3739a27a9c8740637c1508dfeaeb16861a9cb046f0a58f7010c764edaa57cdf6 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 16:38:44,043 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 16:38:44,169 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_055507da-aad0-4fa1-82ba-2c1f076d7d62/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 16:38:44,176 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 16:38:44,178 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 16:38:44,216 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 16:38:44,218 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 16:38:44,219 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 16:38:44,220 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 16:38:44,221 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 16:38:44,222 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 16:38:44,222 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 16:38:44,223 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 16:38:44,224 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 16:38:44,226 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 16:38:44,226 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 16:38:44,227 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 16:38:44,227 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 16:38:44,227 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 16:38:44,232 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 16:38:44,232 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 16:38:44,233 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 16:38:44,233 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 16:38:44,233 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 16:38:44,234 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 16:38:44,234 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 16:38:44,234 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 16:38:44,235 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 16:38:44,235 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 16:38:44,235 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 16:38:44,236 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 16:38:44,238 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 16:38:44,238 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 16:38:44,238 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 16:38:44,239 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 16:38:44,239 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 16:38:44,240 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 16:38:44,240 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 16:38:44,240 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-08 16:38:44,241 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 16:38:44,241 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 16:38:44,242 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 16:38:44,243 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 16:38:44,243 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 16:38:44,243 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_055507da-aad0-4fa1-82ba-2c1f076d7d62/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_055507da-aad0-4fa1-82ba-2c1f076d7d62/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 -> 3739a27a9c8740637c1508dfeaeb16861a9cb046f0a58f7010c764edaa57cdf6 [2024-11-08 16:38:44,652 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 16:38:44,685 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 16:38:44,688 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 16:38:44,690 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 16:38:44,690 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 16:38:44,692 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_055507da-aad0-4fa1-82ba-2c1f076d7d62/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-57.i Unable to find full path for "g++" [2024-11-08 16:38:46,697 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 16:38:46,981 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 16:38:46,983 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_055507da-aad0-4fa1-82ba-2c1f076d7d62/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-57.i [2024-11-08 16:38:46,993 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_055507da-aad0-4fa1-82ba-2c1f076d7d62/bin/uautomizer-verify-jihMAELWvX/data/df128b891/c98dd8eeaaef46f48e031e49c3fe03c4/FLAG47d2d6ba5 [2024-11-08 16:38:47,017 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_055507da-aad0-4fa1-82ba-2c1f076d7d62/bin/uautomizer-verify-jihMAELWvX/data/df128b891/c98dd8eeaaef46f48e031e49c3fe03c4 [2024-11-08 16:38:47,019 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 16:38:47,021 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 16:38:47,022 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 16:38:47,022 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 16:38:47,029 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 16:38:47,030 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 04:38:47" (1/1) ... [2024-11-08 16:38:47,034 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60e1c6a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:38:47, skipping insertion in model container [2024-11-08 16:38:47,034 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 04:38:47" (1/1) ... [2024-11-08 16:38:47,068 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 16:38:47,336 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_055507da-aad0-4fa1-82ba-2c1f076d7d62/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-57.i[917,930] [2024-11-08 16:38:47,475 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 16:38:47,497 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 16:38:47,515 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_055507da-aad0-4fa1-82ba-2c1f076d7d62/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-57.i[917,930] [2024-11-08 16:38:47,576 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 16:38:47,618 INFO L204 MainTranslator]: Completed translation [2024-11-08 16:38:47,619 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:38:47 WrapperNode [2024-11-08 16:38:47,619 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 16:38:47,621 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 16:38:47,622 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 16:38:47,622 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 16:38:47,631 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:38:47" (1/1) ... [2024-11-08 16:38:47,656 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:38:47" (1/1) ... [2024-11-08 16:38:47,709 INFO L138 Inliner]: procedures = 34, calls = 140, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 419 [2024-11-08 16:38:47,713 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 16:38:47,714 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 16:38:47,714 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 16:38:47,714 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 16:38:47,728 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:38:47" (1/1) ... [2024-11-08 16:38:47,729 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:38:47" (1/1) ... [2024-11-08 16:38:47,737 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:38:47" (1/1) ... [2024-11-08 16:38:47,780 INFO L175 MemorySlicer]: Split 111 memory accesses to 2 slices as follows [2, 109]. 98 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 31 writes are split as follows [0, 31]. [2024-11-08 16:38:47,781 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:38:47" (1/1) ... [2024-11-08 16:38:47,781 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:38:47" (1/1) ... [2024-11-08 16:38:47,811 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:38:47" (1/1) ... [2024-11-08 16:38:47,822 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:38:47" (1/1) ... [2024-11-08 16:38:47,825 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:38:47" (1/1) ... [2024-11-08 16:38:47,828 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:38:47" (1/1) ... [2024-11-08 16:38:47,837 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 16:38:47,838 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 16:38:47,838 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 16:38:47,839 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 16:38:47,839 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:38:47" (1/1) ... [2024-11-08 16:38:47,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 16:38:47,861 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_055507da-aad0-4fa1-82ba-2c1f076d7d62/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:38:47,876 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_055507da-aad0-4fa1-82ba-2c1f076d7d62/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:38:47,883 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_055507da-aad0-4fa1-82ba-2c1f076d7d62/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:38:47,914 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 16:38:47,914 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-08 16:38:47,915 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-08 16:38:47,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 16:38:47,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-08 16:38:47,916 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-08 16:38:47,916 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-08 16:38:47,916 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-08 16:38:47,916 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-08 16:38:47,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2024-11-08 16:38:47,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2024-11-08 16:38:47,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-08 16:38:47,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-08 16:38:47,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2024-11-08 16:38:47,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2024-11-08 16:38:47,918 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 16:38:47,918 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 16:38:47,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2024-11-08 16:38:47,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2024-11-08 16:38:47,918 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 16:38:47,918 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 16:38:47,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-08 16:38:47,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-08 16:38:47,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-08 16:38:47,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-08 16:38:48,120 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 16:38:48,122 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 16:38:48,957 INFO L? ?]: Removed 94 outVars from TransFormulas that were not future-live. [2024-11-08 16:38:48,957 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 16:38:48,978 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 16:38:48,980 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 16:38:48,980 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:38:48 BoogieIcfgContainer [2024-11-08 16:38:48,981 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 16:38:48,983 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 16:38:48,984 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 16:38:48,987 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 16:38:48,988 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 04:38:47" (1/3) ... [2024-11-08 16:38:48,989 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d8d7093 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 04:38:48, skipping insertion in model container [2024-11-08 16:38:48,990 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:38:47" (2/3) ... [2024-11-08 16:38:48,990 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d8d7093 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 04:38:48, skipping insertion in model container [2024-11-08 16:38:48,990 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:38:48" (3/3) ... [2024-11-08 16:38:48,992 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-57.i [2024-11-08 16:38:49,011 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 16:38:49,012 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 16:38:49,088 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 16:38:49,093 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;@631ab9aa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 16:38:49,094 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 16:38:49,098 INFO L276 IsEmpty]: Start isEmpty. Operand has 97 states, 76 states have (on average 1.394736842105263) internal successors, (106), 77 states have internal predecessors, (106), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 16:38:49,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-08 16:38:49,112 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:38:49,113 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:38:49,114 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:38:49,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:38:49,119 INFO L85 PathProgramCache]: Analyzing trace with hash -851259868, now seen corresponding path program 1 times [2024-11-08 16:38:49,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:38:49,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2051061584] [2024-11-08 16:38:49,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:38:49,135 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:38:49,135 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_055507da-aad0-4fa1-82ba-2c1f076d7d62/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:38:49,136 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_055507da-aad0-4fa1-82ba-2c1f076d7d62/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:38:49,138 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_055507da-aad0-4fa1-82ba-2c1f076d7d62/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:38:49,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:49,461 INFO L255 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 16:38:49,471 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:38:49,513 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 322 proven. 0 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2024-11-08 16:38:49,514 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:38:49,515 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:38:49,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2051061584] [2024-11-08 16:38:49,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2051061584] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:38:49,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:38:49,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 16:38:49,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248459492] [2024-11-08 16:38:49,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:38:49,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 16:38:49,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:38:49,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 16:38:49,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 16:38:49,560 INFO L87 Difference]: Start difference. First operand has 97 states, 76 states have (on average 1.394736842105263) internal successors, (106), 77 states have internal predecessors, (106), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-08 16:38:49,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:38:49,612 INFO L93 Difference]: Finished difference Result 187 states and 296 transitions. [2024-11-08 16:38:49,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 16:38:49,614 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 134 [2024-11-08 16:38:49,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:38:49,624 INFO L225 Difference]: With dead ends: 187 [2024-11-08 16:38:49,625 INFO L226 Difference]: Without dead ends: 93 [2024-11-08 16:38:49,629 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 133 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:38:49,635 INFO L432 NwaCegarLoop]: 135 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, 135 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:38:49,637 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 16:38:49,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-08 16:38:49,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-11-08 16:38:49,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 73 states have (on average 1.356164383561644) internal successors, (99), 73 states have internal predecessors, (99), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 16:38:49,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 135 transitions. [2024-11-08 16:38:49,692 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 135 transitions. Word has length 134 [2024-11-08 16:38:49,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:38:49,696 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 135 transitions. [2024-11-08 16:38:49,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-08 16:38:49,696 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 135 transitions. [2024-11-08 16:38:49,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-08 16:38:49,703 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:38:49,703 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:38:49,711 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_055507da-aad0-4fa1-82ba-2c1f076d7d62/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)] Forceful destruction successful, exit code 0 [2024-11-08 16:38:49,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_055507da-aad0-4fa1-82ba-2c1f076d7d62/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:38:49,905 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:38:49,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:38:49,905 INFO L85 PathProgramCache]: Analyzing trace with hash 646378696, now seen corresponding path program 1 times [2024-11-08 16:38:49,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:38:49,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2092791187] [2024-11-08 16:38:49,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:38:49,908 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:38:49,908 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_055507da-aad0-4fa1-82ba-2c1f076d7d62/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:38:49,910 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_055507da-aad0-4fa1-82ba-2c1f076d7d62/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:38:49,911 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_055507da-aad0-4fa1-82ba-2c1f076d7d62/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:38:50,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:50,326 INFO L255 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-08 16:38:50,340 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:38:50,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 78 [2024-11-08 16:38:50,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 105 [2024-11-08 16:38:51,605 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 16:38:51,605 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:38:51,605 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:38:51,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2092791187] [2024-11-08 16:38:51,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2092791187] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:38:51,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:38:51,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 16:38:51,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046233529] [2024-11-08 16:38:51,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:38:51,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 16:38:51,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:38:51,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 16:38:51,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 16:38:51,611 INFO L87 Difference]: Start difference. First operand 93 states and 135 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 16:38:53,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:38:53,373 INFO L93 Difference]: Finished difference Result 274 states and 400 transitions. [2024-11-08 16:38:53,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 16:38:53,375 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 134 [2024-11-08 16:38:53,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:38:53,378 INFO L225 Difference]: With dead ends: 274 [2024-11-08 16:38:53,378 INFO L226 Difference]: Without dead ends: 184 [2024-11-08 16:38:53,383 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 16:38:53,385 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 65 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-08 16:38:53,385 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 320 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-08 16:38:53,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2024-11-08 16:38:53,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 153. [2024-11-08 16:38:53,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 114 states have (on average 1.3070175438596492) internal successors, (149), 114 states have internal predecessors, (149), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-08 16:38:53,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 221 transitions. [2024-11-08 16:38:53,441 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 221 transitions. Word has length 134 [2024-11-08 16:38:53,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:38:53,443 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 221 transitions. [2024-11-08 16:38:53,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 16:38:53,443 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 221 transitions. [2024-11-08 16:38:53,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-08 16:38:53,448 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:38:53,449 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:38:53,458 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_055507da-aad0-4fa1-82ba-2c1f076d7d62/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:38:53,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_055507da-aad0-4fa1-82ba-2c1f076d7d62/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:38:53,650 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:38:53,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:38:53,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1688788159, now seen corresponding path program 1 times [2024-11-08 16:38:53,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:38:53,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1818396708] [2024-11-08 16:38:53,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:38:53,654 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:38:53,654 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_055507da-aad0-4fa1-82ba-2c1f076d7d62/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:38:53,657 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_055507da-aad0-4fa1-82ba-2c1f076d7d62/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:38:53,660 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_055507da-aad0-4fa1-82ba-2c1f076d7d62/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:38:54,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:38:54,080 INFO L255 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-08 16:38:54,098 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:38:54,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-11-08 16:38:55,615 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2024-11-08 16:38:56,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 28 [2024-11-08 16:38:57,632 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 28 [2024-11-08 16:38:58,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 36 [2024-11-08 16:38:59,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 39 [2024-11-08 16:39:00,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 47 [2024-11-08 16:39:01,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 53 [2024-11-08 16:39:02,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 56 [2024-11-08 16:39:03,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 70 [2024-11-08 16:39:03,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 120 [2024-11-08 16:39:04,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 49 [2024-11-08 16:39:05,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 150 treesize of output 129 [2024-11-08 16:39:05,605 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:39:05,605 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 150 treesize of output 129 [2024-11-08 16:39:06,155 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:39:06,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 158 treesize of output 102 [2024-11-08 16:39:06,250 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 345 proven. 170 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-11-08 16:39:06,250 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 16:39:10,876 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:39:10,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1818396708] [2024-11-08 16:39:10,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1818396708] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 16:39:10,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [805281797] [2024-11-08 16:39:10,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:39:10,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:39:10,878 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_055507da-aad0-4fa1-82ba-2c1f076d7d62/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:39:10,880 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_055507da-aad0-4fa1-82ba-2c1f076d7d62/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 16:39:10,881 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_055507da-aad0-4fa1-82ba-2c1f076d7d62/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-08 16:39:11,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:39:11,080 INFO L255 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-08 16:39:11,085 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:39:12,712 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2024-11-08 16:39:12,923 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 16:39:12,924 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:39:12,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [805281797] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:39:12,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 16:39:12,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [18] total 22 [2024-11-08 16:39:12,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39223956] [2024-11-08 16:39:12,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:39:12,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 16:39:12,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:39:12,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 16:39:12,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=689, Unknown=0, NotChecked=0, Total=812 [2024-11-08 16:39:12,927 INFO L87 Difference]: Start difference. First operand 153 states and 221 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 16:39:13,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:39:13,787 INFO L93 Difference]: Finished difference Result 281 states and 408 transitions. [2024-11-08 16:39:13,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 16:39:13,788 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 141 [2024-11-08 16:39:13,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:39:13,790 INFO L225 Difference]: With dead ends: 281 [2024-11-08 16:39:13,790 INFO L226 Difference]: Without dead ends: 191 [2024-11-08 16:39:13,792 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 281 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 309 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=135, Invalid=795, Unknown=0, NotChecked=0, Total=930 [2024-11-08 16:39:13,793 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 159 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 16:39:13,793 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 277 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 16:39:13,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-11-08 16:39:13,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 160. [2024-11-08 16:39:13,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 121 states have (on average 1.3140495867768596) internal successors, (159), 121 states have internal predecessors, (159), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-08 16:39:13,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 231 transitions. [2024-11-08 16:39:13,818 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 231 transitions. Word has length 141 [2024-11-08 16:39:13,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:39:13,819 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 231 transitions. [2024-11-08 16:39:13,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 16:39:13,820 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 231 transitions. [2024-11-08 16:39:13,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-08 16:39:13,822 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:39:13,822 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:39:13,843 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_055507da-aad0-4fa1-82ba-2c1f076d7d62/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-08 16:39:14,028 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_055507da-aad0-4fa1-82ba-2c1f076d7d62/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-08 16:39:14,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_055507da-aad0-4fa1-82ba-2c1f076d7d62/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_055507da-aad0-4fa1-82ba-2c1f076d7d62/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:39:14,223 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:39:14,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:39:14,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1326315459, now seen corresponding path program 1 times [2024-11-08 16:39:14,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:39:14,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1227275477] [2024-11-08 16:39:14,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:39:14,225 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:39:14,226 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_055507da-aad0-4fa1-82ba-2c1f076d7d62/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:39:14,229 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_055507da-aad0-4fa1-82ba-2c1f076d7d62/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:39:14,230 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_055507da-aad0-4fa1-82ba-2c1f076d7d62/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 (6)] Waiting until timeout for monitored process [2024-11-08 16:39:14,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:39:14,576 INFO L255 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-08 16:39:14,588 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:39:14,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-08 16:39:15,556 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2024-11-08 16:39:16,299 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2024-11-08 16:39:17,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 35 [2024-11-08 16:39:17,812 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 43 [2024-11-08 16:39:18,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2024-11-08 16:39:19,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 57 [2024-11-08 16:39:20,464 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 65 [2024-11-08 16:39:21,609 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 68 [2024-11-08 16:39:23,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 77 [2024-11-08 16:39:23,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 135 [2024-11-08 16:39:23,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 61 [2024-11-08 16:39:24,389 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 162 treesize of output 132 [2024-11-08 16:39:24,861 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:39:24,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 162 treesize of output 132 [2024-11-08 16:39:25,270 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 377 proven. 170 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-11-08 16:39:25,270 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 16:39:30,442 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:39:30,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1227275477] [2024-11-08 16:39:30,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1227275477] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 16:39:30,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [852890332] [2024-11-08 16:39:30,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:39:30,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:39:30,443 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_055507da-aad0-4fa1-82ba-2c1f076d7d62/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:39:30,446 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_055507da-aad0-4fa1-82ba-2c1f076d7d62/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 16:39:30,449 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_055507da-aad0-4fa1-82ba-2c1f076d7d62/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-08 16:39:30,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:39:30,679 INFO L255 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-08 16:39:30,689 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:39:35,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 32 [2024-11-08 16:39:35,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2024-11-08 16:39:35,311 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2024-11-08 16:39:35,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 16:39:35,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 30 [2024-11-08 16:39:36,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 16:39:36,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 30 [2024-11-08 16:39:36,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 30 [2024-11-08 16:39:36,551 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 171 treesize of output 139 [2024-11-08 16:39:37,117 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-11-08 16:39:37,117 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 16:39:44,094 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:39:44,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 2004942 treesize of output 1927466