./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-96.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10bed78d-be58-4612-93ef-123fdfa27175/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10bed78d-be58-4612-93ef-123fdfa27175/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_10bed78d-be58-4612-93ef-123fdfa27175/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10bed78d-be58-4612-93ef-123fdfa27175/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-96.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10bed78d-be58-4612-93ef-123fdfa27175/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_10bed78d-be58-4612-93ef-123fdfa27175/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 1db73f91281ca8f72a31510912e769553ee6f99227245c59e3181b8854c575b5 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 16:07:58,582 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 16:07:58,678 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10bed78d-be58-4612-93ef-123fdfa27175/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 16:07:58,684 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 16:07:58,685 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 16:07:58,735 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 16:07:58,738 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 16:07:58,739 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 16:07:58,740 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 16:07:58,743 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 16:07:58,743 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 16:07:58,743 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 16:07:58,744 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 16:07:58,745 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 16:07:58,748 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 16:07:58,748 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 16:07:58,749 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 16:07:58,749 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 16:07:58,750 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 16:07:58,750 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 16:07:58,750 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 16:07:58,755 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 16:07:58,755 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 16:07:58,755 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 16:07:58,756 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 16:07:58,756 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 16:07:58,756 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 16:07:58,756 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 16:07:58,757 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 16:07:58,757 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 16:07:58,757 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 16:07:58,759 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 16:07:58,759 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 16:07:58,760 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 16:07:58,761 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 16:07:58,761 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 16:07:58,762 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 16:07:58,762 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 16:07:58,763 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 16:07:58,763 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 16:07:58,763 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 16:07:58,764 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 16:07:58,764 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_10bed78d-be58-4612-93ef-123fdfa27175/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_10bed78d-be58-4612-93ef-123fdfa27175/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 -> 1db73f91281ca8f72a31510912e769553ee6f99227245c59e3181b8854c575b5 [2024-11-08 16:07:59,083 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 16:07:59,117 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 16:07:59,120 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 16:07:59,122 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 16:07:59,123 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 16:07:59,124 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10bed78d-be58-4612-93ef-123fdfa27175/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-96.i Unable to find full path for "g++" [2024-11-08 16:08:01,313 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 16:08:01,545 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 16:08:01,545 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10bed78d-be58-4612-93ef-123fdfa27175/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-96.i [2024-11-08 16:08:01,557 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10bed78d-be58-4612-93ef-123fdfa27175/bin/uautomizer-verify-jihMAELWvX/data/97e20e504/def9cb403d854c77ab2286092ab5a5a3/FLAG007f0e4f4 [2024-11-08 16:08:01,894 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10bed78d-be58-4612-93ef-123fdfa27175/bin/uautomizer-verify-jihMAELWvX/data/97e20e504/def9cb403d854c77ab2286092ab5a5a3 [2024-11-08 16:08:01,897 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 16:08:01,899 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 16:08:01,901 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 16:08:01,901 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 16:08:01,910 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 16:08:01,911 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 04:08:01" (1/1) ... [2024-11-08 16:08:01,915 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26cf2135 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:08:01, skipping insertion in model container [2024-11-08 16:08:01,916 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 04:08:01" (1/1) ... [2024-11-08 16:08:01,965 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 16:08:02,168 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_10bed78d-be58-4612-93ef-123fdfa27175/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-96.i[917,930] [2024-11-08 16:08:02,249 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 16:08:02,265 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 16:08:02,286 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_10bed78d-be58-4612-93ef-123fdfa27175/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-96.i[917,930] [2024-11-08 16:08:02,333 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 16:08:02,363 INFO L204 MainTranslator]: Completed translation [2024-11-08 16:08:02,364 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:08:02 WrapperNode [2024-11-08 16:08:02,364 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 16:08:02,365 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 16:08:02,366 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 16:08:02,366 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 16:08:02,374 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:08:02" (1/1) ... [2024-11-08 16:08:02,390 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:08:02" (1/1) ... [2024-11-08 16:08:02,447 INFO L138 Inliner]: procedures = 30, calls = 155, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 493 [2024-11-08 16:08:02,448 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 16:08:02,449 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 16:08:02,449 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 16:08:02,449 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 16:08:02,464 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:08:02" (1/1) ... [2024-11-08 16:08:02,464 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:08:02" (1/1) ... [2024-11-08 16:08:02,472 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:08:02" (1/1) ... [2024-11-08 16:08:02,481 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-08 16:08:02,481 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:08:02" (1/1) ... [2024-11-08 16:08:02,482 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:08:02" (1/1) ... [2024-11-08 16:08:02,503 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:08:02" (1/1) ... [2024-11-08 16:08:02,508 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:08:02" (1/1) ... [2024-11-08 16:08:02,512 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:08:02" (1/1) ... [2024-11-08 16:08:02,515 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:08:02" (1/1) ... [2024-11-08 16:08:02,526 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 16:08:02,527 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 16:08:02,527 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 16:08:02,527 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 16:08:02,528 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:08:02" (1/1) ... [2024-11-08 16:08:02,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 16:08:02,568 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10bed78d-be58-4612-93ef-123fdfa27175/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:08:02,589 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10bed78d-be58-4612-93ef-123fdfa27175/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:08:02,598 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10bed78d-be58-4612-93ef-123fdfa27175/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:08:02,638 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 16:08:02,639 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-08 16:08:02,639 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-08 16:08:02,639 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-08 16:08:02,639 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-08 16:08:02,639 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-08 16:08:02,640 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-08 16:08:02,640 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 16:08:02,640 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 16:08:02,640 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-08 16:08:02,640 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 16:08:02,641 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 16:08:02,820 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 16:08:02,822 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 16:08:03,753 INFO L? ?]: Removed 113 outVars from TransFormulas that were not future-live. [2024-11-08 16:08:03,753 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 16:08:03,771 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 16:08:03,772 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 16:08:03,772 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:08:03 BoogieIcfgContainer [2024-11-08 16:08:03,772 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 16:08:03,776 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 16:08:03,776 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 16:08:03,780 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 16:08:03,780 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 04:08:01" (1/3) ... [2024-11-08 16:08:03,781 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5078bb61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 04:08:03, skipping insertion in model container [2024-11-08 16:08:03,782 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:08:02" (2/3) ... [2024-11-08 16:08:03,782 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5078bb61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 04:08:03, skipping insertion in model container [2024-11-08 16:08:03,783 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:08:03" (3/3) ... [2024-11-08 16:08:03,784 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-96.i [2024-11-08 16:08:03,806 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 16:08:03,806 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 16:08:03,882 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 16:08:03,891 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;@222041d1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 16:08:03,891 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 16:08:03,897 INFO L276 IsEmpty]: Start isEmpty. Operand has 108 states, 89 states have (on average 1.4269662921348314) internal successors, (127), 90 states have internal predecessors, (127), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-08 16:08:03,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-08 16:08:03,913 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:08:03,914 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:03,915 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:08:03,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:08:03,922 INFO L85 PathProgramCache]: Analyzing trace with hash -1402862563, now seen corresponding path program 1 times [2024-11-08 16:08:03,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:08:03,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586054936] [2024-11-08 16:08:03,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:08:03,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:08:04,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:04,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:08:04,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:04,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:08:04,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:04,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:08:04,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:04,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:08:04,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:04,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:08:04,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:04,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:08:04,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:04,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:08:04,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:04,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:08:04,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:04,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 16:08:04,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:04,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:08:04,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:04,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:08:04,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:04,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:08:04,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:04,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-08 16:08:04,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:04,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 16:08:04,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:04,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 16:08:04,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:04,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 16:08:04,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:04,667 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 16:08:04,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:08:04,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586054936] [2024-11-08 16:08:04,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586054936] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:08:04,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:08:04,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 16:08:04,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393333265] [2024-11-08 16:08:04,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:08:04,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 16:08:04,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:08:04,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 16:08:04,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 16:08:04,711 INFO L87 Difference]: Start difference. First operand has 108 states, 89 states have (on average 1.4269662921348314) internal successors, (127), 90 states have internal predecessors, (127), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-08 16:08:04,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:08:04,753 INFO L93 Difference]: Finished difference Result 209 states and 328 transitions. [2024-11-08 16:08:04,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 16:08:04,758 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 131 [2024-11-08 16:08:04,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:08:04,768 INFO L225 Difference]: With dead ends: 209 [2024-11-08 16:08:04,769 INFO L226 Difference]: Without dead ends: 104 [2024-11-08 16:08:04,775 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 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:08:04,780 INFO L432 NwaCegarLoop]: 152 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, 152 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:08:04,783 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 16:08:04,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-08 16:08:04,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2024-11-08 16:08:04,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 86 states have (on average 1.3953488372093024) internal successors, (120), 86 states have internal predecessors, (120), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-08 16:08:04,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 152 transitions. [2024-11-08 16:08:04,850 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 152 transitions. Word has length 131 [2024-11-08 16:08:04,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:08:04,853 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 152 transitions. [2024-11-08 16:08:04,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-08 16:08:04,854 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 152 transitions. [2024-11-08 16:08:04,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-08 16:08:04,862 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:08:04,862 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:04,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 16:08:04,863 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:08:04,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:08:04,863 INFO L85 PathProgramCache]: Analyzing trace with hash -1234997567, now seen corresponding path program 1 times [2024-11-08 16:08:04,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:08:04,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817872497] [2024-11-08 16:08:04,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:08:04,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:08:05,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:05,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:08:05,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:05,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:08:05,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:05,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:08:05,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:05,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:08:05,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:05,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:08:05,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:05,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:08:05,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:05,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:08:05,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:05,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:08:05,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:05,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 16:08:05,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:05,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:08:05,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:05,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:08:05,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:05,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:08:05,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:05,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-08 16:08:05,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:05,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 16:08:05,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:05,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 16:08:05,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:05,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 16:08:05,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:05,398 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 16:08:05,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:08:05,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817872497] [2024-11-08 16:08:05,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817872497] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:08:05,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:08:05,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 16:08:05,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613252932] [2024-11-08 16:08:05,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:08:05,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 16:08:05,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:08:05,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 16:08:05,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 16:08:05,404 INFO L87 Difference]: Start difference. First operand 104 states and 152 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-08 16:08:05,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:08:05,459 INFO L93 Difference]: Finished difference Result 207 states and 304 transitions. [2024-11-08 16:08:05,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 16:08:05,460 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), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 131 [2024-11-08 16:08:05,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:08:05,462 INFO L225 Difference]: With dead ends: 207 [2024-11-08 16:08:05,462 INFO L226 Difference]: Without dead ends: 106 [2024-11-08 16:08:05,463 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 34 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:08:05,465 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 0 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:08:05,466 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 439 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 16:08:05,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-08 16:08:05,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2024-11-08 16:08:05,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 88 states have (on average 1.3863636363636365) internal successors, (122), 88 states have internal predecessors, (122), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-08 16:08:05,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 154 transitions. [2024-11-08 16:08:05,480 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 154 transitions. Word has length 131 [2024-11-08 16:08:05,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:08:05,483 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 154 transitions. [2024-11-08 16:08:05,483 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), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-08 16:08:05,483 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 154 transitions. [2024-11-08 16:08:05,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-08 16:08:05,486 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:08:05,486 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:05,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 16:08:05,487 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:08:05,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:08:05,488 INFO L85 PathProgramCache]: Analyzing trace with hash -2128483905, now seen corresponding path program 1 times [2024-11-08 16:08:05,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:08:05,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729185441] [2024-11-08 16:08:05,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:08:05,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:08:05,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:05,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:08:05,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:05,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:08:05,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:05,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:08:05,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:05,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:08:05,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:05,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:08:05,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:05,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:08:05,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:05,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:08:05,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:05,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:08:05,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:05,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 16:08:05,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:05,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:08:05,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:05,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:08:05,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:05,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:08:05,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:05,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-08 16:08:05,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:05,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 16:08:05,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:05,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 16:08:05,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:05,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 16:08:05,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:05,909 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 16:08:05,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:08:05,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729185441] [2024-11-08 16:08:05,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729185441] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:08:05,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:08:05,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 16:08:05,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303781133] [2024-11-08 16:08:05,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:08:05,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 16:08:05,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:08:05,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 16:08:05,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 16:08:05,919 INFO L87 Difference]: Start difference. First operand 106 states and 154 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 16:08:05,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:08:05,993 INFO L93 Difference]: Finished difference Result 212 states and 309 transitions. [2024-11-08 16:08:05,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 16:08:05,997 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 131 [2024-11-08 16:08:05,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:08:05,999 INFO L225 Difference]: With dead ends: 212 [2024-11-08 16:08:05,999 INFO L226 Difference]: Without dead ends: 109 [2024-11-08 16:08:06,004 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 34 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:08:06,006 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 1 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:08:06,006 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 436 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 16:08:06,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-08 16:08:06,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 108. [2024-11-08 16:08:06,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 90 states have (on average 1.3777777777777778) internal successors, (124), 90 states have internal predecessors, (124), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-08 16:08:06,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 156 transitions. [2024-11-08 16:08:06,029 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 156 transitions. Word has length 131 [2024-11-08 16:08:06,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:08:06,034 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 156 transitions. [2024-11-08 16:08:06,034 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 16:08:06,034 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 156 transitions. [2024-11-08 16:08:06,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-08 16:08:06,037 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:08:06,037 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:06,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 16:08:06,042 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:08:06,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:08:06,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1448425535, now seen corresponding path program 1 times [2024-11-08 16:08:06,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:08:06,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461784354] [2024-11-08 16:08:06,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:08:06,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:08:06,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:06,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:08:06,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:06,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:08:06,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:06,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:08:06,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:06,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:08:06,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:06,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:08:06,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:06,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:08:06,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:06,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:08:06,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:06,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:08:06,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:06,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 16:08:06,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:06,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:08:06,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:06,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:08:06,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:06,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:08:06,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:06,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-08 16:08:06,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:06,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 16:08:06,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:06,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 16:08:06,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:06,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 16:08:06,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:06,388 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 16:08:06,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:08:06,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461784354] [2024-11-08 16:08:06,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461784354] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:08:06,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:08:06,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 16:08:06,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367284140] [2024-11-08 16:08:06,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:08:06,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 16:08:06,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:08:06,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 16:08:06,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 16:08:06,396 INFO L87 Difference]: Start difference. First operand 108 states and 156 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 16:08:06,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:08:06,442 INFO L93 Difference]: Finished difference Result 216 states and 313 transitions. [2024-11-08 16:08:06,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 16:08:06,445 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 131 [2024-11-08 16:08:06,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:08:06,447 INFO L225 Difference]: With dead ends: 216 [2024-11-08 16:08:06,447 INFO L226 Difference]: Without dead ends: 111 [2024-11-08 16:08:06,448 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 34 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:08:06,449 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 1 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:08:06,454 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 437 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 16:08:06,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-08 16:08:06,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2024-11-08 16:08:06,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 92 states have (on average 1.3695652173913044) internal successors, (126), 92 states have internal predecessors, (126), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-08 16:08:06,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 158 transitions. [2024-11-08 16:08:06,471 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 158 transitions. Word has length 131 [2024-11-08 16:08:06,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:08:06,472 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 158 transitions. [2024-11-08 16:08:06,472 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 16:08:06,472 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 158 transitions. [2024-11-08 16:08:06,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-08 16:08:06,474 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:08:06,474 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:06,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 16:08:06,475 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:08:06,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:08:06,476 INFO L85 PathProgramCache]: Analyzing trace with hash 326581827, now seen corresponding path program 1 times [2024-11-08 16:08:06,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:08:06,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924809315] [2024-11-08 16:08:06,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:08:06,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:08:06,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:06,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:08:06,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:06,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:08:06,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:06,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:08:06,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:06,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:08:06,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:06,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:08:06,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:06,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:08:06,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:06,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:08:06,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:06,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:08:06,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:06,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 16:08:06,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:06,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:08:06,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:06,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:08:06,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:06,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:08:06,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:06,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-08 16:08:06,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:06,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 16:08:06,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:06,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 16:08:06,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:06,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 16:08:06,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:06,746 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 16:08:06,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:08:06,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924809315] [2024-11-08 16:08:06,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924809315] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:08:06,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:08:06,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 16:08:06,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447910476] [2024-11-08 16:08:06,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:08:06,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 16:08:06,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:08:06,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 16:08:06,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 16:08:06,751 INFO L87 Difference]: Start difference. First operand 110 states and 158 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 16:08:06,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:08:06,798 INFO L93 Difference]: Finished difference Result 220 states and 317 transitions. [2024-11-08 16:08:06,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 16:08:06,803 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 131 [2024-11-08 16:08:06,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:08:06,805 INFO L225 Difference]: With dead ends: 220 [2024-11-08 16:08:06,805 INFO L226 Difference]: Without dead ends: 113 [2024-11-08 16:08:06,806 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 34 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:08:06,807 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 1 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:08:06,807 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 439 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 16:08:06,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-08 16:08:06,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2024-11-08 16:08:06,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 94 states have (on average 1.3617021276595744) internal successors, (128), 94 states have internal predecessors, (128), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-08 16:08:06,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 160 transitions. [2024-11-08 16:08:06,825 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 160 transitions. Word has length 131 [2024-11-08 16:08:06,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:08:06,826 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 160 transitions. [2024-11-08 16:08:06,826 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 16:08:06,830 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 160 transitions. [2024-11-08 16:08:06,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-08 16:08:06,832 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:08:06,832 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:06,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 16:08:06,833 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:08:06,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:08:06,836 INFO L85 PathProgramCache]: Analyzing trace with hash 328428869, now seen corresponding path program 1 times [2024-11-08 16:08:06,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:08:06,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108670535] [2024-11-08 16:08:06,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:08:06,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:08:06,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:07,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:08:07,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:07,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:08:07,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:07,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:08:07,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:07,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:08:07,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:07,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:08:07,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:07,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:08:07,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:07,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:08:07,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:07,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:08:07,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:07,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 16:08:07,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:07,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:08:07,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:07,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:08:07,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:07,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:08:07,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:07,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-08 16:08:07,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:07,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 16:08:07,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:07,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 16:08:07,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:07,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 16:08:07,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:07,392 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 16:08:07,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:08:07,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108670535] [2024-11-08 16:08:07,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108670535] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:08:07,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:08:07,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 16:08:07,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015845224] [2024-11-08 16:08:07,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:08:07,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 16:08:07,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:08:07,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 16:08:07,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 16:08:07,400 INFO L87 Difference]: Start difference. First operand 112 states and 160 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 16:08:07,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:08:07,850 INFO L93 Difference]: Finished difference Result 223 states and 320 transitions. [2024-11-08 16:08:07,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 16:08:07,853 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 131 [2024-11-08 16:08:07,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:08:07,855 INFO L225 Difference]: With dead ends: 223 [2024-11-08 16:08:07,855 INFO L226 Difference]: Without dead ends: 114 [2024-11-08 16:08:07,856 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-08 16:08:07,860 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 1 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 16:08:07,861 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 473 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 16:08:07,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-08 16:08:07,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2024-11-08 16:08:07,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 96 states have (on average 1.3541666666666667) internal successors, (130), 96 states have internal predecessors, (130), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-08 16:08:07,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 162 transitions. [2024-11-08 16:08:07,877 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 162 transitions. Word has length 131 [2024-11-08 16:08:07,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:08:07,881 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 162 transitions. [2024-11-08 16:08:07,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 16:08:07,881 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 162 transitions. [2024-11-08 16:08:07,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-08 16:08:07,883 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:08:07,884 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:07,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 16:08:07,884 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:08:07,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:08:07,885 INFO L85 PathProgramCache]: Analyzing trace with hash -1360514873, now seen corresponding path program 1 times [2024-11-08 16:08:07,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:08:07,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952082320] [2024-11-08 16:08:07,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:08:07,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:08:08,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:11,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:08:11,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:11,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:08:11,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:11,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:08:11,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:11,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:08:12,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:12,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:08:12,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:12,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:08:12,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:12,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:08:12,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:12,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:08:12,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:12,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 16:08:12,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:12,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:08:12,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:12,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:08:12,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:12,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:08:12,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:12,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-08 16:08:12,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:12,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 16:08:12,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:12,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 16:08:12,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:12,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 16:08:12,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:12,277 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 16:08:12,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:08:12,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952082320] [2024-11-08 16:08:12,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952082320] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:08:12,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:08:12,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 16:08:12,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987706091] [2024-11-08 16:08:12,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:08:12,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 16:08:12,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:08:12,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 16:08:12,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-08 16:08:12,286 INFO L87 Difference]: Start difference. First operand 114 states and 162 transitions. Second operand has 9 states, 8 states have (on average 6.75) internal successors, (54), 9 states have internal predecessors, (54), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2024-11-08 16:08:13,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:08:13,488 INFO L93 Difference]: Finished difference Result 286 states and 408 transitions. [2024-11-08 16:08:13,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 16:08:13,489 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.75) internal successors, (54), 9 states have internal predecessors, (54), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) Word has length 131 [2024-11-08 16:08:13,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:08:13,491 INFO L225 Difference]: With dead ends: 286 [2024-11-08 16:08:13,492 INFO L226 Difference]: Without dead ends: 175 [2024-11-08 16:08:13,492 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-11-08 16:08:13,495 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 293 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 456 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-08 16:08:13,497 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 431 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 456 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-08 16:08:13,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2024-11-08 16:08:13,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 126. [2024-11-08 16:08:13,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 108 states have (on average 1.3703703703703705) internal successors, (148), 108 states have internal predecessors, (148), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-08 16:08:13,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 180 transitions. [2024-11-08 16:08:13,538 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 180 transitions. Word has length 131 [2024-11-08 16:08:13,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:08:13,538 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 180 transitions. [2024-11-08 16:08:13,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.75) internal successors, (54), 9 states have internal predecessors, (54), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2024-11-08 16:08:13,539 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 180 transitions. [2024-11-08 16:08:13,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-08 16:08:13,543 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:08:13,544 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:13,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 16:08:13,544 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:08:13,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:08:13,545 INFO L85 PathProgramCache]: Analyzing trace with hash -2018295971, now seen corresponding path program 1 times [2024-11-08 16:08:13,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:08:13,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431081874] [2024-11-08 16:08:13,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:08:13,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:08:13,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:14,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:08:14,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:14,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:08:14,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:14,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:08:14,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:14,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:08:14,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:14,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:08:14,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:14,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:08:14,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:14,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:08:14,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:14,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:08:14,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:14,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 16:08:14,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:14,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:08:14,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:14,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:08:14,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:14,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:08:14,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:14,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-08 16:08:14,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:14,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 16:08:14,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:14,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 16:08:14,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:14,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 16:08:14,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:14,377 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 16:08:14,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:08:14,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431081874] [2024-11-08 16:08:14,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431081874] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:08:14,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:08:14,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 16:08:14,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903113856] [2024-11-08 16:08:14,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:08:14,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 16:08:14,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:08:14,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 16:08:14,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 16:08:14,383 INFO L87 Difference]: Start difference. First operand 126 states and 180 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 16:08:14,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:08:14,470 INFO L93 Difference]: Finished difference Result 247 states and 355 transitions. [2024-11-08 16:08:14,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 16:08:14,471 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 133 [2024-11-08 16:08:14,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:08:14,474 INFO L225 Difference]: With dead ends: 247 [2024-11-08 16:08:14,475 INFO L226 Difference]: Without dead ends: 124 [2024-11-08 16:08:14,475 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 33 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:08:14,476 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 104 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:08:14,477 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 275 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 16:08:14,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-11-08 16:08:14,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2024-11-08 16:08:14,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 106 states have (on average 1.3584905660377358) internal successors, (144), 106 states have internal predecessors, (144), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-08 16:08:14,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 176 transitions. [2024-11-08 16:08:14,508 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 176 transitions. Word has length 133 [2024-11-08 16:08:14,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:08:14,509 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 176 transitions. [2024-11-08 16:08:14,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 16:08:14,509 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 176 transitions. [2024-11-08 16:08:14,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-08 16:08:14,511 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:08:14,511 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:14,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 16:08:14,513 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:08:14,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:08:14,513 INFO L85 PathProgramCache]: Analyzing trace with hash -1595594145, now seen corresponding path program 1 times [2024-11-08 16:08:14,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:08:14,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095471480] [2024-11-08 16:08:14,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:08:14,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:08:14,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:14,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:08:14,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:14,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:08:14,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:14,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:08:14,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:14,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:08:14,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:14,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:08:14,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:14,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:08:14,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:14,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:08:14,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:14,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:08:14,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:14,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 16:08:14,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:14,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:08:14,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:14,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:08:14,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:14,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:08:14,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:14,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-08 16:08:14,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:14,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 16:08:14,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:14,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 16:08:14,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:14,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 16:08:14,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:14,832 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 16:08:14,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:08:14,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095471480] [2024-11-08 16:08:14,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095471480] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:08:14,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:08:14,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 16:08:14,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596229452] [2024-11-08 16:08:14,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:08:14,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 16:08:14,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:08:14,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 16:08:14,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 16:08:14,836 INFO L87 Difference]: Start difference. First operand 124 states and 176 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 16:08:15,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:08:15,255 INFO L93 Difference]: Finished difference Result 243 states and 345 transitions. [2024-11-08 16:08:15,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 16:08:15,256 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 133 [2024-11-08 16:08:15,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:08:15,257 INFO L225 Difference]: With dead ends: 243 [2024-11-08 16:08:15,257 INFO L226 Difference]: Without dead ends: 122 [2024-11-08 16:08:15,258 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-08 16:08:15,259 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 1 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 16:08:15,259 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 464 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 16:08:15,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-08 16:08:15,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2024-11-08 16:08:15,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 104 states have (on average 1.3269230769230769) internal successors, (138), 104 states have internal predecessors, (138), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-08 16:08:15,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 170 transitions. [2024-11-08 16:08:15,277 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 170 transitions. Word has length 133 [2024-11-08 16:08:15,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:08:15,278 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 170 transitions. [2024-11-08 16:08:15,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 16:08:15,278 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 170 transitions. [2024-11-08 16:08:15,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-08 16:08:15,279 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:08:15,280 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:15,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 16:08:15,280 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:08:15,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:08:15,281 INFO L85 PathProgramCache]: Analyzing trace with hash -1745483454, now seen corresponding path program 1 times [2024-11-08 16:08:15,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:08:15,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201109167] [2024-11-08 16:08:15,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:08:15,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:08:15,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:15,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:08:15,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:15,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:08:15,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:15,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:08:15,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:15,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:08:15,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:15,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:08:15,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:15,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:08:15,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:15,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:08:15,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:15,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:08:15,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:15,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 16:08:15,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:15,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:08:15,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:15,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:08:15,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:15,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:08:15,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:15,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-08 16:08:15,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:15,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 16:08:15,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:15,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 16:08:15,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:15,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 16:08:15,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:15,426 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 16:08:15,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:08:15,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201109167] [2024-11-08 16:08:15,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201109167] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:08:15,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:08:15,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 16:08:15,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379103106] [2024-11-08 16:08:15,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:08:15,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 16:08:15,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:08:15,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 16:08:15,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:08:15,429 INFO L87 Difference]: Start difference. First operand 122 states and 170 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 16:08:15,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:08:15,468 INFO L93 Difference]: Finished difference Result 289 states and 402 transitions. [2024-11-08 16:08:15,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 16:08:15,469 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 133 [2024-11-08 16:08:15,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:08:15,470 INFO L225 Difference]: With dead ends: 289 [2024-11-08 16:08:15,470 INFO L226 Difference]: Without dead ends: 170 [2024-11-08 16:08:15,471 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 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:08:15,472 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 59 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:08:15,472 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 279 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 16:08:15,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2024-11-08 16:08:15,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 131. [2024-11-08 16:08:15,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 113 states have (on average 1.3097345132743363) internal successors, (148), 113 states have internal predecessors, (148), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-08 16:08:15,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 180 transitions. [2024-11-08 16:08:15,492 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 180 transitions. Word has length 133 [2024-11-08 16:08:15,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:08:15,493 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 180 transitions. [2024-11-08 16:08:15,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 16:08:15,493 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 180 transitions. [2024-11-08 16:08:15,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-08 16:08:15,495 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:08:15,495 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:15,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 16:08:15,495 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:08:15,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:08:15,496 INFO L85 PathProgramCache]: Analyzing trace with hash -204852795, now seen corresponding path program 1 times [2024-11-08 16:08:15,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:08:15,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962406554] [2024-11-08 16:08:15,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:08:15,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:08:15,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:15,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:08:15,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:15,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:08:15,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:15,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:08:15,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:15,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:08:15,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:15,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:08:15,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:15,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:08:15,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:15,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:08:15,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:15,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:08:15,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:15,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 16:08:15,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:15,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:08:15,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:15,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:08:15,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:15,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:08:15,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:15,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-08 16:08:15,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:15,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 16:08:15,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:15,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 16:08:15,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:15,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 16:08:15,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:15,747 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 16:08:15,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:08:15,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962406554] [2024-11-08 16:08:15,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962406554] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:08:15,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:08:15,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 16:08:15,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733390324] [2024-11-08 16:08:15,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:08:15,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 16:08:15,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:08:15,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 16:08:15,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 16:08:15,750 INFO L87 Difference]: Start difference. First operand 131 states and 180 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 16:08:15,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:08:15,809 INFO L93 Difference]: Finished difference Result 262 states and 361 transitions. [2024-11-08 16:08:15,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 16:08:15,810 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 133 [2024-11-08 16:08:15,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:08:15,811 INFO L225 Difference]: With dead ends: 262 [2024-11-08 16:08:15,811 INFO L226 Difference]: Without dead ends: 134 [2024-11-08 16:08:15,812 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 16:08:15,813 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 0 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:08:15,813 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 555 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 16:08:15,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-11-08 16:08:15,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2024-11-08 16:08:15,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 116 states have (on average 1.3017241379310345) internal successors, (151), 116 states have internal predecessors, (151), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-08 16:08:15,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 183 transitions. [2024-11-08 16:08:15,832 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 183 transitions. Word has length 133 [2024-11-08 16:08:15,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:08:15,832 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 183 transitions. [2024-11-08 16:08:15,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 16:08:15,833 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 183 transitions. [2024-11-08 16:08:15,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-08 16:08:15,834 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:08:15,834 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:15,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 16:08:15,835 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:08:15,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:08:15,835 INFO L85 PathProgramCache]: Analyzing trace with hash -1378747648, now seen corresponding path program 1 times [2024-11-08 16:08:15,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:08:15,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568300322] [2024-11-08 16:08:15,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:08:15,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:08:15,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:15,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:08:15,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:15,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:08:15,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:15,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:08:15,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:15,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:08:15,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:15,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:08:15,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:15,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:08:15,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:15,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:08:15,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:15,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:08:15,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:15,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 16:08:15,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:15,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:08:15,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:15,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:08:15,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:15,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:08:15,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:15,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-08 16:08:15,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:15,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 16:08:15,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:15,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 16:08:15,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:15,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 16:08:15,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:15,975 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 16:08:15,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:08:15,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568300322] [2024-11-08 16:08:15,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568300322] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:08:15,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:08:15,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 16:08:15,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457032158] [2024-11-08 16:08:15,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:08:15,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 16:08:15,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:08:15,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 16:08:15,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:08:15,978 INFO L87 Difference]: Start difference. First operand 134 states and 183 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 16:08:16,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:08:16,149 INFO L93 Difference]: Finished difference Result 307 states and 419 transitions. [2024-11-08 16:08:16,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 16:08:16,150 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 133 [2024-11-08 16:08:16,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:08:16,151 INFO L225 Difference]: With dead ends: 307 [2024-11-08 16:08:16,151 INFO L226 Difference]: Without dead ends: 176 [2024-11-08 16:08:16,151 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 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:08:16,152 INFO L432 NwaCegarLoop]: 207 mSDtfsCounter, 61 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 16:08:16,153 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 339 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 16:08:16,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2024-11-08 16:08:16,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 134. [2024-11-08 16:08:16,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 116 states have (on average 1.293103448275862) internal successors, (150), 116 states have internal predecessors, (150), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-08 16:08:16,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 182 transitions. [2024-11-08 16:08:16,173 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 182 transitions. Word has length 133 [2024-11-08 16:08:16,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:08:16,173 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 182 transitions. [2024-11-08 16:08:16,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 16:08:16,174 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 182 transitions. [2024-11-08 16:08:16,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-08 16:08:16,175 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:08:16,176 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:16,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-08 16:08:16,176 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:08:16,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:08:16,177 INFO L85 PathProgramCache]: Analyzing trace with hash 411846596, now seen corresponding path program 1 times [2024-11-08 16:08:16,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:08:16,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431427172] [2024-11-08 16:08:16,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:08:16,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:08:16,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:16,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:08:16,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:16,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:08:16,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:16,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:08:16,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:16,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:08:16,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:16,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:08:16,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:16,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:08:16,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:16,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:08:16,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:16,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:08:16,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:16,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 16:08:16,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:16,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:08:16,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:16,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:08:16,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:16,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:08:16,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:16,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-08 16:08:16,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:16,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 16:08:16,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:16,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 16:08:16,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:16,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 16:08:16,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:16,604 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 16:08:16,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:08:16,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431427172] [2024-11-08 16:08:16,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431427172] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:08:16,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:08:16,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 16:08:16,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32125252] [2024-11-08 16:08:16,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:08:16,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 16:08:16,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:08:16,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 16:08:16,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 16:08:16,608 INFO L87 Difference]: Start difference. First operand 134 states and 182 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 16:08:17,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:08:17,146 INFO L93 Difference]: Finished difference Result 271 states and 369 transitions. [2024-11-08 16:08:17,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 16:08:17,147 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 134 [2024-11-08 16:08:17,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:08:17,148 INFO L225 Difference]: With dead ends: 271 [2024-11-08 16:08:17,149 INFO L226 Difference]: Without dead ends: 140 [2024-11-08 16:08:17,149 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-08 16:08:17,150 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 12 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 16:08:17,151 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 447 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 16:08:17,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-11-08 16:08:17,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 134. [2024-11-08 16:08:17,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 116 states have (on average 1.2758620689655173) internal successors, (148), 116 states have internal predecessors, (148), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-08 16:08:17,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 180 transitions. [2024-11-08 16:08:17,176 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 180 transitions. Word has length 134 [2024-11-08 16:08:17,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:08:17,177 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 180 transitions. [2024-11-08 16:08:17,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 16:08:17,178 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 180 transitions. [2024-11-08 16:08:17,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-08 16:08:17,180 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:08:17,180 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:17,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-08 16:08:17,181 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:08:17,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:08:17,181 INFO L85 PathProgramCache]: Analyzing trace with hash -2087311045, now seen corresponding path program 1 times [2024-11-08 16:08:17,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:08:17,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821096092] [2024-11-08 16:08:17,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:08:17,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:08:17,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:17,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:08:17,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:17,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:08:17,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:17,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:08:17,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:17,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:08:17,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:17,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:08:17,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:17,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:08:17,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:17,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:08:17,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:17,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:08:17,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:17,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 16:08:17,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:17,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:08:17,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:17,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:08:17,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:17,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:08:17,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:17,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-08 16:08:17,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:17,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 16:08:17,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:17,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 16:08:17,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:17,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 16:08:17,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:17,924 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 16:08:17,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:08:17,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821096092] [2024-11-08 16:08:17,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821096092] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:08:17,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:08:17,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 16:08:17,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665355415] [2024-11-08 16:08:17,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:08:17,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 16:08:17,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:08:17,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 16:08:17,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 16:08:17,928 INFO L87 Difference]: Start difference. First operand 134 states and 180 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 16:08:18,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:08:18,249 INFO L93 Difference]: Finished difference Result 380 states and 512 transitions. [2024-11-08 16:08:18,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 16:08:18,250 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 135 [2024-11-08 16:08:18,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:08:18,253 INFO L225 Difference]: With dead ends: 380 [2024-11-08 16:08:18,254 INFO L226 Difference]: Without dead ends: 249 [2024-11-08 16:08:18,254 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 35 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:08:18,255 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 108 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 16:08:18,256 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 338 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 16:08:18,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2024-11-08 16:08:18,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 186. [2024-11-08 16:08:18,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 151 states have (on average 1.2516556291390728) internal successors, (189), 151 states have internal predecessors, (189), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-08 16:08:18,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 253 transitions. [2024-11-08 16:08:18,303 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 253 transitions. Word has length 135 [2024-11-08 16:08:18,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:08:18,304 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 253 transitions. [2024-11-08 16:08:18,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 16:08:18,305 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 253 transitions. [2024-11-08 16:08:18,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-08 16:08:18,307 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:08:18,307 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:18,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-08 16:08:18,308 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:08:18,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:08:18,308 INFO L85 PathProgramCache]: Analyzing trace with hash 912229201, now seen corresponding path program 1 times [2024-11-08 16:08:18,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:08:18,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163866411] [2024-11-08 16:08:18,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:08:18,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:08:18,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:18,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:08:18,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:18,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:08:18,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:18,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:08:18,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:18,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:08:18,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:18,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:08:18,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:18,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:08:18,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:18,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:08:18,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:18,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:08:18,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:18,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 16:08:18,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:18,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:08:18,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:18,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:08:18,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:18,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:08:18,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:18,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-08 16:08:18,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:18,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 16:08:18,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:18,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 16:08:18,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:18,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 16:08:18,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:18,532 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 16:08:18,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:08:18,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163866411] [2024-11-08 16:08:18,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163866411] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:08:18,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:08:18,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 16:08:18,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968884500] [2024-11-08 16:08:18,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:08:18,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 16:08:18,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:08:18,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 16:08:18,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 16:08:18,536 INFO L87 Difference]: Start difference. First operand 186 states and 253 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 16:08:18,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:08:18,627 INFO L93 Difference]: Finished difference Result 360 states and 488 transitions. [2024-11-08 16:08:18,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 16:08:18,628 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 136 [2024-11-08 16:08:18,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:08:18,630 INFO L225 Difference]: With dead ends: 360 [2024-11-08 16:08:18,630 INFO L226 Difference]: Without dead ends: 229 [2024-11-08 16:08:18,631 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 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:08:18,634 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 55 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:08:18,635 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 411 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 16:08:18,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2024-11-08 16:08:18,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 191. [2024-11-08 16:08:18,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 156 states have (on average 1.2628205128205128) internal successors, (197), 156 states have internal predecessors, (197), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-08 16:08:18,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 261 transitions. [2024-11-08 16:08:18,691 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 261 transitions. Word has length 136 [2024-11-08 16:08:18,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:08:18,692 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 261 transitions. [2024-11-08 16:08:18,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 16:08:18,693 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 261 transitions. [2024-11-08 16:08:18,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-08 16:08:18,695 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:08:18,695 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:18,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-08 16:08:18,696 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:08:18,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:08:18,697 INFO L85 PathProgramCache]: Analyzing trace with hash -108839153, now seen corresponding path program 1 times [2024-11-08 16:08:18,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:08:18,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853499909] [2024-11-08 16:08:18,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:08:18,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:08:18,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:18,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:08:18,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:18,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:08:18,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:18,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:08:18,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:18,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:08:18,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:18,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:08:18,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:18,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:08:18,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:18,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:08:18,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:18,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:08:18,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:18,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 16:08:18,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:18,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:08:18,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:18,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:08:18,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:18,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:08:18,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:19,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-08 16:08:19,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:19,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 16:08:19,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:19,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 16:08:19,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:19,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 16:08:19,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:19,012 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 16:08:19,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:08:19,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853499909] [2024-11-08 16:08:19,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853499909] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:08:19,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:08:19,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 16:08:19,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460148054] [2024-11-08 16:08:19,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:08:19,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 16:08:19,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:08:19,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 16:08:19,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 16:08:19,017 INFO L87 Difference]: Start difference. First operand 191 states and 261 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 16:08:19,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:08:19,091 INFO L93 Difference]: Finished difference Result 331 states and 451 transitions. [2024-11-08 16:08:19,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 16:08:19,091 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 136 [2024-11-08 16:08:19,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:08:19,095 INFO L225 Difference]: With dead ends: 331 [2024-11-08 16:08:19,097 INFO L226 Difference]: Without dead ends: 195 [2024-11-08 16:08:19,098 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 35 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:08:19,099 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 0 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 684 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:08:19,099 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 684 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 16:08:19,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-11-08 16:08:19,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 192. [2024-11-08 16:08:19,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 157 states have (on average 1.2611464968152866) internal successors, (198), 157 states have internal predecessors, (198), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-08 16:08:19,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 262 transitions. [2024-11-08 16:08:19,141 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 262 transitions. Word has length 136 [2024-11-08 16:08:19,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:08:19,142 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 262 transitions. [2024-11-08 16:08:19,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 16:08:19,142 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 262 transitions. [2024-11-08 16:08:19,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-08 16:08:19,144 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:08:19,144 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:19,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-08 16:08:19,145 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:08:19,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:08:19,145 INFO L85 PathProgramCache]: Analyzing trace with hash 469745535, now seen corresponding path program 1 times [2024-11-08 16:08:19,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:08:19,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329631561] [2024-11-08 16:08:19,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:08:19,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:08:19,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:19,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:08:19,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:19,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:08:19,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:19,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:08:19,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:19,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:08:19,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:19,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:08:19,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:19,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:08:19,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:19,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:08:19,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:19,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:08:19,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:19,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 16:08:19,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:19,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:08:19,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:19,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:08:19,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:19,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:08:19,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:19,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-08 16:08:19,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:19,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 16:08:19,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:19,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 16:08:19,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:19,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 16:08:19,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:19,496 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 16:08:19,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:08:19,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329631561] [2024-11-08 16:08:19,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329631561] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:08:19,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:08:19,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 16:08:19,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963318889] [2024-11-08 16:08:19,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:08:19,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 16:08:19,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:08:19,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 16:08:19,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:08:19,500 INFO L87 Difference]: Start difference. First operand 192 states and 262 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 16:08:19,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:08:19,543 INFO L93 Difference]: Finished difference Result 329 states and 448 transitions. [2024-11-08 16:08:19,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 16:08:19,544 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 136 [2024-11-08 16:08:19,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:08:19,547 INFO L225 Difference]: With dead ends: 329 [2024-11-08 16:08:19,547 INFO L226 Difference]: Without dead ends: 192 [2024-11-08 16:08:19,548 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 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:08:19,548 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 1 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:08:19,549 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 281 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 16:08:19,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2024-11-08 16:08:19,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2024-11-08 16:08:19,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 157 states have (on average 1.2484076433121019) internal successors, (196), 157 states have internal predecessors, (196), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-08 16:08:19,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 260 transitions. [2024-11-08 16:08:19,586 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 260 transitions. Word has length 136 [2024-11-08 16:08:19,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:08:19,586 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 260 transitions. [2024-11-08 16:08:19,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 16:08:19,586 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 260 transitions. [2024-11-08 16:08:19,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-08 16:08:19,589 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:08:19,589 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:19,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-08 16:08:19,589 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:08:19,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:08:19,590 INFO L85 PathProgramCache]: Analyzing trace with hash 688600253, now seen corresponding path program 1 times [2024-11-08 16:08:19,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:08:19,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901799666] [2024-11-08 16:08:19,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:08:19,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:08:19,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:24,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:08:24,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:24,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:08:24,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:24,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:08:24,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:24,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:08:24,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:24,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:08:24,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:24,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:08:24,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:24,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:08:24,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:24,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:08:24,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:24,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 16:08:24,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:24,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:08:24,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:24,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:08:24,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:24,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:08:24,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:24,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-08 16:08:24,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:24,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 16:08:24,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:24,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 16:08:24,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:24,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 16:08:24,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:24,744 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 16:08:24,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:08:24,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901799666] [2024-11-08 16:08:24,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901799666] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:08:24,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:08:24,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-08 16:08:24,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335692147] [2024-11-08 16:08:24,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:08:24,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 16:08:24,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:08:24,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 16:08:24,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-11-08 16:08:24,748 INFO L87 Difference]: Start difference. First operand 192 states and 260 transitions. Second operand has 11 states, 10 states have (on average 5.9) internal successors, (59), 11 states have internal predecessors, (59), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) [2024-11-08 16:08:26,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:08:26,415 INFO L93 Difference]: Finished difference Result 369 states and 495 transitions. [2024-11-08 16:08:26,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 16:08:26,417 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.9) internal successors, (59), 11 states have internal predecessors, (59), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) Word has length 136 [2024-11-08 16:08:26,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:08:26,419 INFO L225 Difference]: With dead ends: 369 [2024-11-08 16:08:26,420 INFO L226 Difference]: Without dead ends: 232 [2024-11-08 16:08:26,421 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2024-11-08 16:08:26,422 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 273 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 456 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-08 16:08:26,422 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 411 Invalid, 460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 456 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-08 16:08:26,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2024-11-08 16:08:26,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 184. [2024-11-08 16:08:26,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 149 states have (on average 1.25503355704698) internal successors, (187), 149 states have internal predecessors, (187), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-08 16:08:26,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 251 transitions. [2024-11-08 16:08:26,459 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 251 transitions. Word has length 136 [2024-11-08 16:08:26,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:08:26,461 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 251 transitions. [2024-11-08 16:08:26,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.9) internal successors, (59), 11 states have internal predecessors, (59), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) [2024-11-08 16:08:26,461 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 251 transitions. [2024-11-08 16:08:26,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-08 16:08:26,463 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:08:26,463 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:26,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-08 16:08:26,464 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:08:26,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:08:26,465 INFO L85 PathProgramCache]: Analyzing trace with hash 268008808, now seen corresponding path program 1 times [2024-11-08 16:08:26,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:08:26,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749051392] [2024-11-08 16:08:26,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:08:26,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:08:26,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:26,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:08:26,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:26,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:08:26,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:26,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:08:26,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:26,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:08:26,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:26,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:08:26,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:26,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:08:26,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:26,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:08:26,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:26,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:08:26,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:26,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 16:08:26,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:26,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:08:26,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:26,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:08:26,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:26,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:08:26,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:26,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-08 16:08:26,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:26,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 16:08:26,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:26,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 16:08:26,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:26,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 16:08:26,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:26,727 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 16:08:26,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:08:26,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749051392] [2024-11-08 16:08:26,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749051392] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:08:26,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:08:26,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 16:08:26,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839563470] [2024-11-08 16:08:26,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:08:26,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 16:08:26,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:08:26,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 16:08:26,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 16:08:26,731 INFO L87 Difference]: Start difference. First operand 184 states and 251 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 16:08:27,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:08:27,180 INFO L93 Difference]: Finished difference Result 313 states and 426 transitions. [2024-11-08 16:08:27,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 16:08:27,181 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 137 [2024-11-08 16:08:27,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:08:27,183 INFO L225 Difference]: With dead ends: 313 [2024-11-08 16:08:27,183 INFO L226 Difference]: Without dead ends: 184 [2024-11-08 16:08:27,183 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-08 16:08:27,184 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 45 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 16:08:27,184 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 391 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 16:08:27,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2024-11-08 16:08:27,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2024-11-08 16:08:27,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 149 states have (on average 1.2483221476510067) internal successors, (186), 149 states have internal predecessors, (186), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-08 16:08:27,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 250 transitions. [2024-11-08 16:08:27,218 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 250 transitions. Word has length 137 [2024-11-08 16:08:27,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:08:27,219 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 250 transitions. [2024-11-08 16:08:27,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 16:08:27,219 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 250 transitions. [2024-11-08 16:08:27,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-08 16:08:27,221 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:08:27,221 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:27,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-08 16:08:27,221 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:08:27,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:08:27,222 INFO L85 PathProgramCache]: Analyzing trace with hash -743108442, now seen corresponding path program 1 times [2024-11-08 16:08:27,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:08:27,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765454787] [2024-11-08 16:08:27,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:08:27,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:08:27,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:27,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:08:27,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:27,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 16:08:27,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:27,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 16:08:27,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:27,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 16:08:27,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:27,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 16:08:27,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:27,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 16:08:27,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:27,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 16:08:27,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:27,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 16:08:27,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:27,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 16:08:27,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:27,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 16:08:27,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:27,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:08:27,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:27,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:08:27,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:27,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-08 16:08:27,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:27,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 16:08:27,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:27,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 16:08:27,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:27,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 16:08:27,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:27,822 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 16:08:27,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:08:27,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765454787] [2024-11-08 16:08:27,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765454787] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:08:27,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:08:27,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 16:08:27,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356950347] [2024-11-08 16:08:27,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:08:27,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 16:08:27,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:08:27,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 16:08:27,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 16:08:27,825 INFO L87 Difference]: Start difference. First operand 184 states and 250 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 16:08:28,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:08:28,265 INFO L93 Difference]: Finished difference Result 189 states and 255 transitions. [2024-11-08 16:08:28,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 16:08:28,266 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 137 [2024-11-08 16:08:28,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:08:28,268 INFO L225 Difference]: With dead ends: 189 [2024-11-08 16:08:28,268 INFO L226 Difference]: Without dead ends: 187 [2024-11-08 16:08:28,268 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-08 16:08:28,270 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 137 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 16:08:28,270 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 494 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 16:08:28,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2024-11-08 16:08:28,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2024-11-08 16:08:28,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 152 states have (on average 1.243421052631579) internal successors, (189), 152 states have internal predecessors, (189), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-08 16:08:28,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 253 transitions. [2024-11-08 16:08:28,326 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 253 transitions. Word has length 137 [2024-11-08 16:08:28,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:08:28,327 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 253 transitions. [2024-11-08 16:08:28,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 16:08:28,328 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 253 transitions. [2024-11-08 16:08:28,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-08 16:08:28,330 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:08:28,331 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:28,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-08 16:08:28,331 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:08:28,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:08:28,332 INFO L85 PathProgramCache]: Analyzing trace with hash -741261400, now seen corresponding path program 1 times [2024-11-08 16:08:28,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:08:28,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563727843] [2024-11-08 16:08:28,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:08:28,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:08:28,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 16:08:28,478 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 16:08:28,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 16:08:28,708 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 16:08:28,708 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 16:08:28,710 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 16:08:28,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-08 16:08:28,715 INFO L407 BasicCegarLoop]: Path program histogram: [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:08:28,927 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 16:08:28,931 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 04:08:28 BoogieIcfgContainer [2024-11-08 16:08:28,931 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 16:08:28,932 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 16:08:28,932 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 16:08:28,932 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 16:08:28,933 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:08:03" (3/4) ... [2024-11-08 16:08:28,936 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 16:08:28,938 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 16:08:28,939 INFO L158 Benchmark]: Toolchain (without parser) took 27039.58ms. Allocated memory was 127.9MB in the beginning and 541.1MB in the end (delta: 413.1MB). Free memory was 91.3MB in the beginning and 406.7MB in the end (delta: -315.3MB). Peak memory consumption was 99.0MB. Max. memory is 16.1GB. [2024-11-08 16:08:28,940 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 127.9MB. Free memory was 73.8MB in the beginning and 73.6MB in the end (delta: 134.5kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 16:08:28,940 INFO L158 Benchmark]: CACSL2BoogieTranslator took 463.61ms. Allocated memory is still 127.9MB. Free memory was 91.0MB in the beginning and 73.3MB in the end (delta: 17.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-08 16:08:28,940 INFO L158 Benchmark]: Boogie Procedure Inliner took 82.52ms. Allocated memory is still 127.9MB. Free memory was 73.3MB in the beginning and 69.4MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 16:08:28,941 INFO L158 Benchmark]: Boogie Preprocessor took 77.41ms. Allocated memory is still 127.9MB. Free memory was 69.4MB in the beginning and 65.8MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 16:08:28,941 INFO L158 Benchmark]: RCFGBuilder took 1245.98ms. Allocated memory was 127.9MB in the beginning and 178.3MB in the end (delta: 50.3MB). Free memory was 65.8MB in the beginning and 126.2MB in the end (delta: -60.4MB). Peak memory consumption was 28.4MB. Max. memory is 16.1GB. [2024-11-08 16:08:28,946 INFO L158 Benchmark]: TraceAbstraction took 25155.66ms. Allocated memory was 178.3MB in the beginning and 541.1MB in the end (delta: 362.8MB). Free memory was 125.3MB in the beginning and 406.7MB in the end (delta: -281.3MB). Peak memory consumption was 81.1MB. Max. memory is 16.1GB. [2024-11-08 16:08:28,946 INFO L158 Benchmark]: Witness Printer took 6.19ms. Allocated memory is still 541.1MB. Free memory is still 406.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 16:08:28,948 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.33ms. Allocated memory is still 127.9MB. Free memory was 73.8MB in the beginning and 73.6MB in the end (delta: 134.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 463.61ms. Allocated memory is still 127.9MB. Free memory was 91.0MB in the beginning and 73.3MB in the end (delta: 17.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 82.52ms. Allocated memory is still 127.9MB. Free memory was 73.3MB in the beginning and 69.4MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 77.41ms. Allocated memory is still 127.9MB. Free memory was 69.4MB in the beginning and 65.8MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1245.98ms. Allocated memory was 127.9MB in the beginning and 178.3MB in the end (delta: 50.3MB). Free memory was 65.8MB in the beginning and 126.2MB in the end (delta: -60.4MB). Peak memory consumption was 28.4MB. Max. memory is 16.1GB. * TraceAbstraction took 25155.66ms. Allocated memory was 178.3MB in the beginning and 541.1MB in the end (delta: 362.8MB). Free memory was 125.3MB in the beginning and 406.7MB in the end (delta: -281.3MB). Peak memory consumption was 81.1MB. Max. memory is 16.1GB. * Witness Printer took 6.19ms. Allocated memory is still 541.1MB. Free memory is still 406.7MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 124, overapproximation of someBinaryFLOATComparisonOperation at line 133. Possible FailurePath: [L39] unsigned char isInitial = 0; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 8, 0, 8, 1000, 1, 0, 0, 0, 4.575, 2.75, 128.5, -1000000000, 99999.25, 1, 50 }; [L57] unsigned short int* WrapperStruct00_var_1_1_Pointer = &(WrapperStruct00.var_1_1); [L58] unsigned char* WrapperStruct00_var_1_2_Pointer = &(WrapperStruct00.var_1_2); [L59] unsigned short int* WrapperStruct00_var_1_3_Pointer = &(WrapperStruct00.var_1_3); [L60] unsigned short int* WrapperStruct00_var_1_4_Pointer = &(WrapperStruct00.var_1_4); [L61] unsigned char* WrapperStruct00_var_1_5_Pointer = &(WrapperStruct00.var_1_5); [L62] unsigned char* WrapperStruct00_var_1_6_Pointer = &(WrapperStruct00.var_1_6); [L63] unsigned char* WrapperStruct00_var_1_9_Pointer = &(WrapperStruct00.var_1_9); [L64] unsigned char* WrapperStruct00_var_1_10_Pointer = &(WrapperStruct00.var_1_10); [L65] double* WrapperStruct00_var_1_11_Pointer = &(WrapperStruct00.var_1_11); [L66] double* WrapperStruct00_var_1_13_Pointer = &(WrapperStruct00.var_1_13); [L67] double* WrapperStruct00_var_1_14_Pointer = &(WrapperStruct00.var_1_14); [L68] signed long int* WrapperStruct00_var_1_15_Pointer = &(WrapperStruct00.var_1_15); [L69] float* WrapperStruct00_var_1_16_Pointer = &(WrapperStruct00.var_1_16); [L70] signed char* WrapperStruct00_var_1_17_Pointer = &(WrapperStruct00.var_1_17); [L71] signed char* WrapperStruct00_var_1_18_Pointer = &(WrapperStruct00.var_1_18); [L72] unsigned char last_1_WrapperStruct00_var_1_5 = 1; VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=0, last_1_WrapperStruct00_var_1_5=1] [L137] isInitial = 1 [L138] FCALL initially() [L139] COND TRUE 1 [L140] CALL updateLastVariables() [L130] EXPR WrapperStruct00.var_1_5 [L130] last_1_WrapperStruct00_var_1_5 = WrapperStruct00.var_1_5 [L140] RET updateLastVariables() [L141] CALL updateVariables() [L103] WrapperStruct00.var_1_2 = __VERIFIER_nondet_uchar() [L104] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L104] CALL assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L104] RET assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L105] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L105] CALL assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L105] RET assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L106] WrapperStruct00.var_1_3 = __VERIFIER_nondet_ushort() [L107] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L107] CALL assume_abort_if_not(WrapperStruct00.var_1_3 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L107] RET assume_abort_if_not(WrapperStruct00.var_1_3 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L108] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L108] CALL assume_abort_if_not(WrapperStruct00.var_1_3 <= 65534) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L108] RET assume_abort_if_not(WrapperStruct00.var_1_3 <= 65534) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L109] WrapperStruct00.var_1_4 = __VERIFIER_nondet_ushort() [L110] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L110] CALL assume_abort_if_not(WrapperStruct00.var_1_4 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L110] RET assume_abort_if_not(WrapperStruct00.var_1_4 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L111] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L111] CALL assume_abort_if_not(WrapperStruct00.var_1_4 <= 65534) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L111] RET assume_abort_if_not(WrapperStruct00.var_1_4 <= 65534) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L112] WrapperStruct00.var_1_6 = __VERIFIER_nondet_uchar() [L113] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L113] CALL assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L113] RET assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L114] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L114] CALL assume_abort_if_not(WrapperStruct00.var_1_6 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L114] RET assume_abort_if_not(WrapperStruct00.var_1_6 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L115] WrapperStruct00.var_1_9 = __VERIFIER_nondet_uchar() [L116] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L116] CALL assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L116] RET assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L117] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L117] CALL assume_abort_if_not(WrapperStruct00.var_1_9 <= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L117] RET assume_abort_if_not(WrapperStruct00.var_1_9 <= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L118] WrapperStruct00.var_1_10 = __VERIFIER_nondet_uchar() [L119] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L119] CALL assume_abort_if_not(WrapperStruct00.var_1_10 >= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L119] RET assume_abort_if_not(WrapperStruct00.var_1_10 >= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L120] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L120] CALL assume_abort_if_not(WrapperStruct00.var_1_10 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L120] RET assume_abort_if_not(WrapperStruct00.var_1_10 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L121] WrapperStruct00.var_1_13 = __VERIFIER_nondet_double() [L122] EXPR WrapperStruct00.var_1_13 [L122] EXPR WrapperStruct00.var_1_13 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F [L122] EXPR WrapperStruct00.var_1_13 [L122] EXPR WrapperStruct00.var_1_13 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L122] EXPR (WrapperStruct00.var_1_13 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L122] CALL assume_abort_if_not((WrapperStruct00.var_1_13 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L122] RET assume_abort_if_not((WrapperStruct00.var_1_13 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L123] WrapperStruct00.var_1_14 = __VERIFIER_nondet_double() [L124] EXPR WrapperStruct00.var_1_14 [L124] EXPR WrapperStruct00.var_1_14 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F [L124] EXPR WrapperStruct00.var_1_14 [L124] EXPR WrapperStruct00.var_1_14 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L124] EXPR (WrapperStruct00.var_1_14 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L124] CALL assume_abort_if_not((WrapperStruct00.var_1_14 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L124] RET assume_abort_if_not((WrapperStruct00.var_1_14 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L125] WrapperStruct00.var_1_18 = __VERIFIER_nondet_char() [L126] EXPR WrapperStruct00.var_1_18 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L126] CALL assume_abort_if_not(WrapperStruct00.var_1_18 >= -127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L126] RET assume_abort_if_not(WrapperStruct00.var_1_18 >= -127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L127] EXPR WrapperStruct00.var_1_18 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L127] CALL assume_abort_if_not(WrapperStruct00.var_1_18 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L127] RET assume_abort_if_not(WrapperStruct00.var_1_18 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L141] RET updateVariables() [L142] CALL step() [L76] COND FALSE !(! last_1_WrapperStruct00_var_1_5) [L79] EXPR \read(*WrapperStruct00_var_1_4_Pointer) [L79] (*(WrapperStruct00_var_1_1_Pointer)) = (*(WrapperStruct00_var_1_4_Pointer)) [L81] EXPR \read(*WrapperStruct00_var_1_6_Pointer) [L81] unsigned char stepLocal_0 = (*(WrapperStruct00_var_1_6_Pointer)); [L82] EXPR \read(*WrapperStruct00_var_1_2_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1, stepLocal_0=257] [L82] COND FALSE !((*(WrapperStruct00_var_1_2_Pointer))) [L91] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L91] (*(WrapperStruct00_var_1_15_Pointer)) = (*(WrapperStruct00_var_1_1_Pointer)) [L92] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L92] (*(WrapperStruct00_var_1_16_Pointer)) = (*(WrapperStruct00_var_1_13_Pointer)) [L93] EXPR \read(*WrapperStruct00_var_1_18_Pointer) [L93] (*(WrapperStruct00_var_1_17_Pointer)) = (*(WrapperStruct00_var_1_18_Pointer)) [L94] EXPR \read(*WrapperStruct00_var_1_15_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1, stepLocal_0=257] [L94] EXPR (((*(WrapperStruct00_var_1_15_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))) [L94] EXPR \read(*WrapperStruct00_var_1_15_Pointer) [L94] EXPR (((*(WrapperStruct00_var_1_15_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1, stepLocal_0=257] [L94] EXPR \read(*WrapperStruct00_var_1_15_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1, stepLocal_0=257] [L94] COND FALSE !((((((*(WrapperStruct00_var_1_15_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))) > (*(WrapperStruct00_var_1_15_Pointer))) [L142] RET step() [L143] CALL, EXPR property() [L133] EXPR (! last_1_WrapperStruct00_var_1_5) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (((((*(WrapperStruct00_var_1_3_Pointer))) < ((*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_4_Pointer)))) [L133] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L133] EXPR \read(*WrapperStruct00_var_1_4_Pointer) [L133] EXPR (! last_1_WrapperStruct00_var_1_5) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (((((*(WrapperStruct00_var_1_3_Pointer))) < ((*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_4_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L133] EXPR ((! last_1_WrapperStruct00_var_1_5) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (((((*(WrapperStruct00_var_1_3_Pointer))) < ((*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_4_Pointer))))) && ((*(WrapperStruct00_var_1_2_Pointer)) ? (((*(WrapperStruct00_var_1_6_Pointer)) && (((*(WrapperStruct00_var_1_3_Pointer)) >= 16) || last_1_WrapperStruct00_var_1_5)) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_1_Pointer)) < (*(WrapperStruct00_var_1_1_Pointer))) && (*(WrapperStruct00_var_1_9_Pointer))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_10_Pointer))))) : 1) : 1) [L133] EXPR \read(*WrapperStruct00_var_1_2_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L133] EXPR (*(WrapperStruct00_var_1_2_Pointer)) ? (((*(WrapperStruct00_var_1_6_Pointer)) && (((*(WrapperStruct00_var_1_3_Pointer)) >= 16) || last_1_WrapperStruct00_var_1_5)) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_1_Pointer)) < (*(WrapperStruct00_var_1_1_Pointer))) && (*(WrapperStruct00_var_1_9_Pointer))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_10_Pointer))))) : 1) : 1 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L133] EXPR ((! last_1_WrapperStruct00_var_1_5) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (((((*(WrapperStruct00_var_1_3_Pointer))) < ((*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_4_Pointer))))) && ((*(WrapperStruct00_var_1_2_Pointer)) ? (((*(WrapperStruct00_var_1_6_Pointer)) && (((*(WrapperStruct00_var_1_3_Pointer)) >= 16) || last_1_WrapperStruct00_var_1_5)) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_1_Pointer)) < (*(WrapperStruct00_var_1_1_Pointer))) && (*(WrapperStruct00_var_1_9_Pointer))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_10_Pointer))))) : 1) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L133] EXPR (((! last_1_WrapperStruct00_var_1_5) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (((((*(WrapperStruct00_var_1_3_Pointer))) < ((*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_4_Pointer))))) && ((*(WrapperStruct00_var_1_2_Pointer)) ? (((*(WrapperStruct00_var_1_6_Pointer)) && (((*(WrapperStruct00_var_1_3_Pointer)) >= 16) || last_1_WrapperStruct00_var_1_5)) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_1_Pointer)) < (*(WrapperStruct00_var_1_1_Pointer))) && (*(WrapperStruct00_var_1_9_Pointer))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_10_Pointer))))) : 1) : 1)) && (((((((*(WrapperStruct00_var_1_15_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))) > (*(WrapperStruct00_var_1_15_Pointer))) ? ((((*(WrapperStruct00_var_1_15_Pointer)) / -5) >= (((*(WrapperStruct00_var_1_4_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer))) - (((((*(WrapperStruct00_var_1_1_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) ((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer))))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (*(WrapperStruct00_var_1_14_Pointer))))) : 1) [L133] EXPR \read(*WrapperStruct00_var_1_15_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L133] EXPR (((*(WrapperStruct00_var_1_15_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))) [L133] EXPR \read(*WrapperStruct00_var_1_15_Pointer) [L133] EXPR (((*(WrapperStruct00_var_1_15_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L133] EXPR \read(*WrapperStruct00_var_1_15_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L133] EXPR ((((((*(WrapperStruct00_var_1_15_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))) > (*(WrapperStruct00_var_1_15_Pointer))) ? ((((*(WrapperStruct00_var_1_15_Pointer)) / -5) >= (((*(WrapperStruct00_var_1_4_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer))) - (((((*(WrapperStruct00_var_1_1_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) ((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer))))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (*(WrapperStruct00_var_1_14_Pointer))))) : 1 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L133] EXPR (((! last_1_WrapperStruct00_var_1_5) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (((((*(WrapperStruct00_var_1_3_Pointer))) < ((*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_4_Pointer))))) && ((*(WrapperStruct00_var_1_2_Pointer)) ? (((*(WrapperStruct00_var_1_6_Pointer)) && (((*(WrapperStruct00_var_1_3_Pointer)) >= 16) || last_1_WrapperStruct00_var_1_5)) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_1_Pointer)) < (*(WrapperStruct00_var_1_1_Pointer))) && (*(WrapperStruct00_var_1_9_Pointer))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_10_Pointer))))) : 1) : 1)) && (((((((*(WrapperStruct00_var_1_15_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))) > (*(WrapperStruct00_var_1_15_Pointer))) ? ((((*(WrapperStruct00_var_1_15_Pointer)) / -5) >= (((*(WrapperStruct00_var_1_4_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer))) - (((((*(WrapperStruct00_var_1_1_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) ((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer))))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (*(WrapperStruct00_var_1_14_Pointer))))) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L133] EXPR ((((! last_1_WrapperStruct00_var_1_5) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (((((*(WrapperStruct00_var_1_3_Pointer))) < ((*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_4_Pointer))))) && ((*(WrapperStruct00_var_1_2_Pointer)) ? (((*(WrapperStruct00_var_1_6_Pointer)) && (((*(WrapperStruct00_var_1_3_Pointer)) >= 16) || last_1_WrapperStruct00_var_1_5)) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_1_Pointer)) < (*(WrapperStruct00_var_1_1_Pointer))) && (*(WrapperStruct00_var_1_9_Pointer))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_10_Pointer))))) : 1) : 1)) && (((((((*(WrapperStruct00_var_1_15_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))) > (*(WrapperStruct00_var_1_15_Pointer))) ? ((((*(WrapperStruct00_var_1_15_Pointer)) / -5) >= (((*(WrapperStruct00_var_1_4_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer))) - (((((*(WrapperStruct00_var_1_1_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) ((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer))))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (*(WrapperStruct00_var_1_14_Pointer))))) : 1)) && ((*(WrapperStruct00_var_1_15_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_1_Pointer)))) [L133] EXPR \read(*WrapperStruct00_var_1_15_Pointer) [L133] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L133] EXPR ((((! last_1_WrapperStruct00_var_1_5) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (((((*(WrapperStruct00_var_1_3_Pointer))) < ((*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_4_Pointer))))) && ((*(WrapperStruct00_var_1_2_Pointer)) ? (((*(WrapperStruct00_var_1_6_Pointer)) && (((*(WrapperStruct00_var_1_3_Pointer)) >= 16) || last_1_WrapperStruct00_var_1_5)) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_1_Pointer)) < (*(WrapperStruct00_var_1_1_Pointer))) && (*(WrapperStruct00_var_1_9_Pointer))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_10_Pointer))))) : 1) : 1)) && (((((((*(WrapperStruct00_var_1_15_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))) > (*(WrapperStruct00_var_1_15_Pointer))) ? ((((*(WrapperStruct00_var_1_15_Pointer)) / -5) >= (((*(WrapperStruct00_var_1_4_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer))) - (((((*(WrapperStruct00_var_1_1_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) ((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer))))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (*(WrapperStruct00_var_1_14_Pointer))))) : 1)) && ((*(WrapperStruct00_var_1_15_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_1_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L133] EXPR (((((! last_1_WrapperStruct00_var_1_5) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (((((*(WrapperStruct00_var_1_3_Pointer))) < ((*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_4_Pointer))))) && ((*(WrapperStruct00_var_1_2_Pointer)) ? (((*(WrapperStruct00_var_1_6_Pointer)) && (((*(WrapperStruct00_var_1_3_Pointer)) >= 16) || last_1_WrapperStruct00_var_1_5)) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_1_Pointer)) < (*(WrapperStruct00_var_1_1_Pointer))) && (*(WrapperStruct00_var_1_9_Pointer))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_10_Pointer))))) : 1) : 1)) && (((((((*(WrapperStruct00_var_1_15_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))) > (*(WrapperStruct00_var_1_15_Pointer))) ? ((((*(WrapperStruct00_var_1_15_Pointer)) / -5) >= (((*(WrapperStruct00_var_1_4_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer))) - (((((*(WrapperStruct00_var_1_1_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) ((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer))))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (*(WrapperStruct00_var_1_14_Pointer))))) : 1)) && ((*(WrapperStruct00_var_1_15_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_1_Pointer))))) && ((*(WrapperStruct00_var_1_16_Pointer)) == ((float) (*(WrapperStruct00_var_1_13_Pointer)))) [L133] EXPR \read(*WrapperStruct00_var_1_16_Pointer) [L133] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L133] EXPR (((((! last_1_WrapperStruct00_var_1_5) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (((((*(WrapperStruct00_var_1_3_Pointer))) < ((*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_4_Pointer))))) && ((*(WrapperStruct00_var_1_2_Pointer)) ? (((*(WrapperStruct00_var_1_6_Pointer)) && (((*(WrapperStruct00_var_1_3_Pointer)) >= 16) || last_1_WrapperStruct00_var_1_5)) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_1_Pointer)) < (*(WrapperStruct00_var_1_1_Pointer))) && (*(WrapperStruct00_var_1_9_Pointer))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_10_Pointer))))) : 1) : 1)) && (((((((*(WrapperStruct00_var_1_15_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))) > (*(WrapperStruct00_var_1_15_Pointer))) ? ((((*(WrapperStruct00_var_1_15_Pointer)) / -5) >= (((*(WrapperStruct00_var_1_4_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer))) - (((((*(WrapperStruct00_var_1_1_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) ((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer))))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (*(WrapperStruct00_var_1_14_Pointer))))) : 1)) && ((*(WrapperStruct00_var_1_15_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_1_Pointer))))) && ((*(WrapperStruct00_var_1_16_Pointer)) == ((float) (*(WrapperStruct00_var_1_13_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L133] EXPR ((((((! last_1_WrapperStruct00_var_1_5) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (((((*(WrapperStruct00_var_1_3_Pointer))) < ((*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_4_Pointer))))) && ((*(WrapperStruct00_var_1_2_Pointer)) ? (((*(WrapperStruct00_var_1_6_Pointer)) && (((*(WrapperStruct00_var_1_3_Pointer)) >= 16) || last_1_WrapperStruct00_var_1_5)) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_1_Pointer)) < (*(WrapperStruct00_var_1_1_Pointer))) && (*(WrapperStruct00_var_1_9_Pointer))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_10_Pointer))))) : 1) : 1)) && (((((((*(WrapperStruct00_var_1_15_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))) > (*(WrapperStruct00_var_1_15_Pointer))) ? ((((*(WrapperStruct00_var_1_15_Pointer)) / -5) >= (((*(WrapperStruct00_var_1_4_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer))) - (((((*(WrapperStruct00_var_1_1_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) ((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer))))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (*(WrapperStruct00_var_1_14_Pointer))))) : 1)) && ((*(WrapperStruct00_var_1_15_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_1_Pointer))))) && ((*(WrapperStruct00_var_1_16_Pointer)) == ((float) (*(WrapperStruct00_var_1_13_Pointer))))) && ((*(WrapperStruct00_var_1_17_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_18_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L133-L134] return ((((((! last_1_WrapperStruct00_var_1_5) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (((((*(WrapperStruct00_var_1_3_Pointer))) < ((*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_4_Pointer))))) && ((*(WrapperStruct00_var_1_2_Pointer)) ? (((*(WrapperStruct00_var_1_6_Pointer)) && (((*(WrapperStruct00_var_1_3_Pointer)) >= 16) || last_1_WrapperStruct00_var_1_5)) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_1_Pointer)) < (*(WrapperStruct00_var_1_1_Pointer))) && (*(WrapperStruct00_var_1_9_Pointer))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_10_Pointer))))) : 1) : 1)) && (((((((*(WrapperStruct00_var_1_15_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))) > (*(WrapperStruct00_var_1_15_Pointer))) ? ((((*(WrapperStruct00_var_1_15_Pointer)) / -5) >= (((*(WrapperStruct00_var_1_4_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer))) - (((((*(WrapperStruct00_var_1_1_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) ((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer))))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (*(WrapperStruct00_var_1_14_Pointer))))) : 1)) && ((*(WrapperStruct00_var_1_15_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_1_Pointer))))) && ((*(WrapperStruct00_var_1_16_Pointer)) == ((float) (*(WrapperStruct00_var_1_13_Pointer))))) && ((*(WrapperStruct00_var_1_17_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_18_Pointer)))) ; [L143] RET, EXPR property() [L143] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] [L19] reach_error() VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:10}, WrapperStruct00_var_1_11_Pointer={4:11}, WrapperStruct00_var_1_13_Pointer={4:19}, WrapperStruct00_var_1_14_Pointer={4:27}, WrapperStruct00_var_1_15_Pointer={4:35}, WrapperStruct00_var_1_16_Pointer={4:39}, WrapperStruct00_var_1_17_Pointer={4:43}, WrapperStruct00_var_1_18_Pointer={4:44}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:3}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:7}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:9}, isInitial=1, last_1_WrapperStruct00_var_1_5=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 108 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 24.9s, OverallIterations: 21, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 6.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1155 SdHoareTripleChecker+Valid, 4.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1153 mSDsluCounter, 8176 SdHoareTripleChecker+Invalid, 4.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5391 mSDsCounter, 74 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1888 IncrementalHoareTripleChecker+Invalid, 1962 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 74 mSolverCounterUnsat, 2785 mSDtfsCounter, 1888 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 785 GetRequests, 710 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=192occurred in iteration=16, InterpolantAutomatonStates: 92, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 20 MinimizatonAttempts, 291 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 14.7s InterpolantComputationTime, 2806 NumberOfCodeBlocks, 2806 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 2649 ConstructedInterpolants, 0 QuantifiedInterpolants, 10695 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 PerfectInterpolantSequences, 9600/9600 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:08:28,999 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10bed78d-be58-4612-93ef-123fdfa27175/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10bed78d-be58-4612-93ef-123fdfa27175/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10bed78d-be58-4612-93ef-123fdfa27175/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_10bed78d-be58-4612-93ef-123fdfa27175/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10bed78d-be58-4612-93ef-123fdfa27175/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-96.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10bed78d-be58-4612-93ef-123fdfa27175/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_10bed78d-be58-4612-93ef-123fdfa27175/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 1db73f91281ca8f72a31510912e769553ee6f99227245c59e3181b8854c575b5 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 16:08:31,645 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 16:08:31,740 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10bed78d-be58-4612-93ef-123fdfa27175/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 16:08:31,747 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 16:08:31,750 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 16:08:31,791 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 16:08:31,792 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 16:08:31,792 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 16:08:31,793 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 16:08:31,794 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 16:08:31,794 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 16:08:31,795 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 16:08:31,796 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 16:08:31,800 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 16:08:31,801 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 16:08:31,801 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 16:08:31,802 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 16:08:31,802 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 16:08:31,806 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 16:08:31,807 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 16:08:31,808 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 16:08:31,808 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 16:08:31,809 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 16:08:31,809 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 16:08:31,810 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 16:08:31,810 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 16:08:31,810 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 16:08:31,811 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 16:08:31,811 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 16:08:31,814 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 16:08:31,815 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 16:08:31,816 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 16:08:31,816 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 16:08:31,817 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 16:08:31,818 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 16:08:31,818 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 16:08:31,818 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 16:08:31,819 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 16:08:31,820 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-08 16:08:31,820 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 16:08:31,821 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 16:08:31,838 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 16:08:31,840 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 16:08:31,841 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 16:08:31,841 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_10bed78d-be58-4612-93ef-123fdfa27175/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_10bed78d-be58-4612-93ef-123fdfa27175/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 -> 1db73f91281ca8f72a31510912e769553ee6f99227245c59e3181b8854c575b5 [2024-11-08 16:08:32,303 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 16:08:32,339 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 16:08:32,342 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 16:08:32,344 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 16:08:32,345 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 16:08:32,346 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10bed78d-be58-4612-93ef-123fdfa27175/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-96.i Unable to find full path for "g++" [2024-11-08 16:08:34,640 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 16:08:34,961 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 16:08:34,962 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10bed78d-be58-4612-93ef-123fdfa27175/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-96.i [2024-11-08 16:08:34,972 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10bed78d-be58-4612-93ef-123fdfa27175/bin/uautomizer-verify-jihMAELWvX/data/c7fde3485/fac64a8867934ee2a3b8d47d47593818/FLAGd5b853aff [2024-11-08 16:08:35,242 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10bed78d-be58-4612-93ef-123fdfa27175/bin/uautomizer-verify-jihMAELWvX/data/c7fde3485/fac64a8867934ee2a3b8d47d47593818 [2024-11-08 16:08:35,245 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 16:08:35,247 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 16:08:35,248 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 16:08:35,248 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 16:08:35,257 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 16:08:35,261 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 04:08:35" (1/1) ... [2024-11-08 16:08:35,263 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e35f871 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:08:35, skipping insertion in model container [2024-11-08 16:08:35,263 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 04:08:35" (1/1) ... [2024-11-08 16:08:35,305 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 16:08:35,523 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_10bed78d-be58-4612-93ef-123fdfa27175/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-96.i[917,930] [2024-11-08 16:08:35,647 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 16:08:35,690 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 16:08:35,715 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_10bed78d-be58-4612-93ef-123fdfa27175/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-96.i[917,930] [2024-11-08 16:08:35,790 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 16:08:35,836 INFO L204 MainTranslator]: Completed translation [2024-11-08 16:08:35,837 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:08:35 WrapperNode [2024-11-08 16:08:35,837 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 16:08:35,838 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 16:08:35,839 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 16:08:35,839 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 16:08:35,848 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:08:35" (1/1) ... [2024-11-08 16:08:35,881 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:08:35" (1/1) ... [2024-11-08 16:08:35,946 INFO L138 Inliner]: procedures = 40, calls = 155, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 491 [2024-11-08 16:08:35,950 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 16:08:35,951 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 16:08:35,951 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 16:08:35,951 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 16:08:35,965 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:08:35" (1/1) ... [2024-11-08 16:08:35,966 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:08:35" (1/1) ... [2024-11-08 16:08:36,007 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:08:35" (1/1) ... [2024-11-08 16:08:36,081 INFO L175 MemorySlicer]: Split 128 memory accesses to 2 slices as follows [2, 126]. 98 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 34 writes are split as follows [0, 34]. [2024-11-08 16:08:36,086 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:08:35" (1/1) ... [2024-11-08 16:08:36,086 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:08:35" (1/1) ... [2024-11-08 16:08:36,140 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:08:35" (1/1) ... [2024-11-08 16:08:36,145 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:08:35" (1/1) ... [2024-11-08 16:08:36,149 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:08:35" (1/1) ... [2024-11-08 16:08:36,152 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:08:35" (1/1) ... [2024-11-08 16:08:36,158 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 16:08:36,159 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 16:08:36,159 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 16:08:36,159 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 16:08:36,160 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:08:35" (1/1) ... [2024-11-08 16:08:36,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 16:08:36,195 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10bed78d-be58-4612-93ef-123fdfa27175/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:08:36,213 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10bed78d-be58-4612-93ef-123fdfa27175/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:08:36,219 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10bed78d-be58-4612-93ef-123fdfa27175/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:08:36,258 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 16:08:36,259 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-08 16:08:36,259 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-08 16:08:36,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#0 [2024-11-08 16:08:36,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#1 [2024-11-08 16:08:36,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-08 16:08:36,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-08 16:08:36,260 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-08 16:08:36,260 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-08 16:08:36,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 16:08:36,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-08 16:08:36,260 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-08 16:08:36,261 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-08 16:08:36,261 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-08 16:08:36,261 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-08 16:08:36,261 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-08 16:08:36,261 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-08 16:08:36,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2024-11-08 16:08:36,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2024-11-08 16:08:36,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-08 16:08:36,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-08 16:08:36,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2024-11-08 16:08:36,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2024-11-08 16:08:36,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2024-11-08 16:08:36,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2024-11-08 16:08:36,264 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 16:08:36,264 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 16:08:36,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2024-11-08 16:08:36,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2024-11-08 16:08:36,265 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 16:08:36,265 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 16:08:36,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-08 16:08:36,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-08 16:08:36,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-08 16:08:36,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-08 16:08:36,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-08 16:08:36,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-08 16:08:36,526 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 16:08:36,529 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 16:08:38,972 INFO L? ?]: Removed 113 outVars from TransFormulas that were not future-live. [2024-11-08 16:08:38,973 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 16:08:39,001 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 16:08:39,003 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 16:08:39,004 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:08:39 BoogieIcfgContainer [2024-11-08 16:08:39,004 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 16:08:39,007 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 16:08:39,007 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 16:08:39,011 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 16:08:39,012 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 04:08:35" (1/3) ... [2024-11-08 16:08:39,013 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@550953c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 04:08:39, skipping insertion in model container [2024-11-08 16:08:39,013 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:08:35" (2/3) ... [2024-11-08 16:08:39,013 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@550953c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 04:08:39, skipping insertion in model container [2024-11-08 16:08:39,014 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:08:39" (3/3) ... [2024-11-08 16:08:39,015 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-96.i [2024-11-08 16:08:39,040 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 16:08:39,041 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 16:08:39,144 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 16:08:39,154 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;@44c350fc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 16:08:39,155 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 16:08:39,159 INFO L276 IsEmpty]: Start isEmpty. Operand has 108 states, 89 states have (on average 1.4269662921348314) internal successors, (127), 90 states have internal predecessors, (127), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-08 16:08:39,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-08 16:08:39,175 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:08:39,176 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:39,177 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:08:39,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:08:39,184 INFO L85 PathProgramCache]: Analyzing trace with hash 864937929, now seen corresponding path program 1 times [2024-11-08 16:08:39,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:08:39,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1662131289] [2024-11-08 16:08:39,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:08:39,206 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:08:39,206 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10bed78d-be58-4612-93ef-123fdfa27175/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:08:39,209 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10bed78d-be58-4612-93ef-123fdfa27175/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:08:39,223 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10bed78d-be58-4612-93ef-123fdfa27175/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:08:39,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:39,836 INFO L255 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 16:08:39,847 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:08:39,891 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 254 proven. 0 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2024-11-08 16:08:39,892 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:08:39,893 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:08:39,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1662131289] [2024-11-08 16:08:39,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1662131289] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:08:39,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:08:39,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 16:08:39,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085714696] [2024-11-08 16:08:39,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:08:39,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 16:08:39,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:08:39,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 16:08:39,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 16:08:39,931 INFO L87 Difference]: Start difference. First operand has 108 states, 89 states have (on average 1.4269662921348314) internal successors, (127), 90 states have internal predecessors, (127), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-08 16:08:39,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:08:39,974 INFO L93 Difference]: Finished difference Result 209 states and 328 transitions. [2024-11-08 16:08:39,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 16:08:39,977 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 131 [2024-11-08 16:08:39,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:08:39,988 INFO L225 Difference]: With dead ends: 209 [2024-11-08 16:08:39,988 INFO L226 Difference]: Without dead ends: 104 [2024-11-08 16:08:39,992 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 130 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:08:39,996 INFO L432 NwaCegarLoop]: 152 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, 152 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:08:39,997 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 16:08:40,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-08 16:08:40,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2024-11-08 16:08:40,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 86 states have (on average 1.3953488372093024) internal successors, (120), 86 states have internal predecessors, (120), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-08 16:08:40,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 152 transitions. [2024-11-08 16:08:40,061 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 152 transitions. Word has length 131 [2024-11-08 16:08:40,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:08:40,062 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 152 transitions. [2024-11-08 16:08:40,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-08 16:08:40,062 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 152 transitions. [2024-11-08 16:08:40,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-08 16:08:40,068 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:08:40,069 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:40,080 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10bed78d-be58-4612-93ef-123fdfa27175/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-08 16:08:40,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10bed78d-be58-4612-93ef-123fdfa27175/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:08:40,270 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:08:40,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:08:40,271 INFO L85 PathProgramCache]: Analyzing trace with hash 1032802925, now seen corresponding path program 1 times [2024-11-08 16:08:40,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:08:40,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1087955188] [2024-11-08 16:08:40,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:08:40,272 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:08:40,272 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10bed78d-be58-4612-93ef-123fdfa27175/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:08:40,277 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10bed78d-be58-4612-93ef-123fdfa27175/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:08:40,278 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10bed78d-be58-4612-93ef-123fdfa27175/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:08:40,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:40,843 INFO L255 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 16:08:40,850 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:08:40,960 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 16:08:40,960 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:08:40,960 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:08:40,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1087955188] [2024-11-08 16:08:40,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1087955188] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:08:40,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:08:40,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 16:08:40,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401549970] [2024-11-08 16:08:40,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:08:40,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 16:08:40,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:08:40,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 16:08:40,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 16:08:40,969 INFO L87 Difference]: Start difference. First operand 104 states and 152 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 16:08:41,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:08:41,105 INFO L93 Difference]: Finished difference Result 210 states and 308 transitions. [2024-11-08 16:08:41,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 16:08:41,106 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 131 [2024-11-08 16:08:41,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:08:41,111 INFO L225 Difference]: With dead ends: 210 [2024-11-08 16:08:41,114 INFO L226 Difference]: Without dead ends: 109 [2024-11-08 16:08:41,115 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 16:08:41,116 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 1 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 16:08:41,119 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 572 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 16:08:41,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-08 16:08:41,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 108. [2024-11-08 16:08:41,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 90 states have (on average 1.3777777777777778) internal successors, (124), 90 states have internal predecessors, (124), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-08 16:08:41,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 156 transitions. [2024-11-08 16:08:41,151 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 156 transitions. Word has length 131 [2024-11-08 16:08:41,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:08:41,153 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 156 transitions. [2024-11-08 16:08:41,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 16:08:41,153 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 156 transitions. [2024-11-08 16:08:41,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-08 16:08:41,160 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:08:41,160 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:41,171 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10bed78d-be58-4612-93ef-123fdfa27175/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:08:41,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10bed78d-be58-4612-93ef-123fdfa27175/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:08:41,361 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:08:41,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:08:41,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1712861295, now seen corresponding path program 1 times [2024-11-08 16:08:41,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:08:41,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1010851235] [2024-11-08 16:08:41,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:08:41,364 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:08:41,364 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10bed78d-be58-4612-93ef-123fdfa27175/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:08:41,371 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10bed78d-be58-4612-93ef-123fdfa27175/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:08:41,374 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10bed78d-be58-4612-93ef-123fdfa27175/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:08:41,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:41,892 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-08 16:08:41,897 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:08:41,982 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 16:08:41,983 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:08:41,983 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:08:41,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1010851235] [2024-11-08 16:08:41,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1010851235] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:08:41,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:08:41,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 16:08:41,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685532697] [2024-11-08 16:08:41,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:08:41,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 16:08:41,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:08:41,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 16:08:41,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 16:08:41,987 INFO L87 Difference]: Start difference. First operand 108 states and 156 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 16:08:42,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:08:42,365 INFO L93 Difference]: Finished difference Result 216 states and 313 transitions. [2024-11-08 16:08:42,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 16:08:42,366 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 131 [2024-11-08 16:08:42,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:08:42,368 INFO L225 Difference]: With dead ends: 216 [2024-11-08 16:08:42,369 INFO L226 Difference]: Without dead ends: 111 [2024-11-08 16:08:42,369 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 126 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:08:42,371 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 1 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 705 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 16:08:42,371 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 705 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 16:08:42,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-08 16:08:42,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2024-11-08 16:08:42,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 92 states have (on average 1.3695652173913044) internal successors, (126), 92 states have internal predecessors, (126), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-08 16:08:42,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 158 transitions. [2024-11-08 16:08:42,383 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 158 transitions. Word has length 131 [2024-11-08 16:08:42,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:08:42,384 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 158 transitions. [2024-11-08 16:08:42,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 16:08:42,385 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 158 transitions. [2024-11-08 16:08:42,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-08 16:08:42,387 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:08:42,388 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:42,402 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10bed78d-be58-4612-93ef-123fdfa27175/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:08:42,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10bed78d-be58-4612-93ef-123fdfa27175/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:08:42,589 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:08:42,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:08:42,590 INFO L85 PathProgramCache]: Analyzing trace with hash -807098639, now seen corresponding path program 1 times [2024-11-08 16:08:42,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:08:42,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [676413689] [2024-11-08 16:08:42,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:08:42,596 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:08:42,596 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10bed78d-be58-4612-93ef-123fdfa27175/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:08:42,598 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10bed78d-be58-4612-93ef-123fdfa27175/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:08:42,605 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10bed78d-be58-4612-93ef-123fdfa27175/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 (5)] Waiting until timeout for monitored process [2024-11-08 16:08:43,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:43,094 INFO L255 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 16:08:43,103 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:08:43,216 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 16:08:43,217 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:08:43,217 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:08:43,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [676413689] [2024-11-08 16:08:43,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [676413689] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:08:43,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:08:43,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 16:08:43,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352859491] [2024-11-08 16:08:43,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:08:43,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 16:08:43,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:08:43,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 16:08:43,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 16:08:43,221 INFO L87 Difference]: Start difference. First operand 110 states and 158 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 16:08:43,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:08:43,597 INFO L93 Difference]: Finished difference Result 220 states and 317 transitions. [2024-11-08 16:08:43,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 16:08:43,598 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 131 [2024-11-08 16:08:43,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:08:43,600 INFO L225 Difference]: With dead ends: 220 [2024-11-08 16:08:43,601 INFO L226 Difference]: Without dead ends: 113 [2024-11-08 16:08:43,602 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 16:08:43,607 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 1 mSDsluCounter, 696 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 839 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 16:08:43,607 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 839 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 16:08:43,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-08 16:08:43,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2024-11-08 16:08:43,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 94 states have (on average 1.3617021276595744) internal successors, (128), 94 states have internal predecessors, (128), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-08 16:08:43,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 160 transitions. [2024-11-08 16:08:43,630 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 160 transitions. Word has length 131 [2024-11-08 16:08:43,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:08:43,631 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 160 transitions. [2024-11-08 16:08:43,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 16:08:43,632 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 160 transitions. [2024-11-08 16:08:43,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-08 16:08:43,634 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:08:43,634 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:43,647 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10bed78d-be58-4612-93ef-123fdfa27175/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 (5)] Ended with exit code 0 [2024-11-08 16:08:43,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10bed78d-be58-4612-93ef-123fdfa27175/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:08:43,838 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:08:43,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:08:43,839 INFO L85 PathProgramCache]: Analyzing trace with hash -805251597, now seen corresponding path program 1 times [2024-11-08 16:08:43,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:08:43,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1138309028] [2024-11-08 16:08:43,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:08:43,841 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:08:43,841 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10bed78d-be58-4612-93ef-123fdfa27175/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:08:43,844 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10bed78d-be58-4612-93ef-123fdfa27175/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:08:43,846 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10bed78d-be58-4612-93ef-123fdfa27175/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:08:44,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:44,419 INFO L255 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-08 16:08:44,429 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:08:48,346 INFO L349 Elim1Store]: treesize reduction 80, result has 26.6 percent of original size [2024-11-08 16:08:48,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 39 [2024-11-08 16:08:48,378 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:08:48,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 46 [2024-11-08 16:08:48,465 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 16:08:48,466 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:08:48,466 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:08:48,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1138309028] [2024-11-08 16:08:48,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1138309028] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:08:48,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:08:48,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 16:08:48,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370819355] [2024-11-08 16:08:48,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:08:48,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 16:08:48,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:08:48,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 16:08:48,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 16:08:48,470 INFO L87 Difference]: Start difference. First operand 112 states and 160 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 16:08:48,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:08:48,892 INFO L93 Difference]: Finished difference Result 221 states and 317 transitions. [2024-11-08 16:08:48,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 16:08:48,895 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 131 [2024-11-08 16:08:48,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:08:48,897 INFO L225 Difference]: With dead ends: 221 [2024-11-08 16:08:48,897 INFO L226 Difference]: Without dead ends: 112 [2024-11-08 16:08:48,898 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 16:08:48,903 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 85 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 16:08:48,904 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 275 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 16:08:48,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-08 16:08:48,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2024-11-08 16:08:48,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 94 states have (on average 1.351063829787234) internal successors, (127), 94 states have internal predecessors, (127), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-08 16:08:48,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 159 transitions. [2024-11-08 16:08:48,933 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 159 transitions. Word has length 131 [2024-11-08 16:08:48,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:08:48,934 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 159 transitions. [2024-11-08 16:08:48,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 16:08:48,938 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 159 transitions. [2024-11-08 16:08:48,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-08 16:08:48,940 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:08:48,940 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:48,953 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10bed78d-be58-4612-93ef-123fdfa27175/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)] Ended with exit code 0 [2024-11-08 16:08:49,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10bed78d-be58-4612-93ef-123fdfa27175/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:08:49,144 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:08:49,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:08:49,145 INFO L85 PathProgramCache]: Analyzing trace with hash 1800771957, now seen corresponding path program 1 times [2024-11-08 16:08:49,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:08:49,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [619141556] [2024-11-08 16:08:49,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:08:49,146 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:08:49,146 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10bed78d-be58-4612-93ef-123fdfa27175/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:08:49,147 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10bed78d-be58-4612-93ef-123fdfa27175/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:08:49,149 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10bed78d-be58-4612-93ef-123fdfa27175/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 (7)] Waiting until timeout for monitored process [2024-11-08 16:08:49,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:08:49,627 INFO L255 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-11-08 16:08:49,641 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:08:52,466 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:08:53,669 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:08:54,937 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:08:55,904 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:08:56,831 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 12 [2024-11-08 16:08:57,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2024-11-08 16:09:02,274 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 37 treesize of output 42 [2024-11-08 16:09:03,769 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 50 treesize of output 61 [2024-11-08 16:09:04,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 74 [2024-11-08 16:09:04,651 INFO L349 Elim1Store]: treesize reduction 226, result has 6.2 percent of original size [2024-11-08 16:09:04,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 7 select indices, 7 select index equivalence classes, 36 disjoint index pairs (out of 21 index pairs), introduced 10 new quantified variables, introduced 9 case distinctions, treesize of input 174 treesize of output 306 [2024-11-08 16:09:06,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 85 [2024-11-08 16:09:06,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 66 [2024-11-08 16:09:08,097 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:09:08,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 36 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 268 treesize of output 204 [2024-11-08 16:09:40,509 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 220 proven. 112 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2024-11-08 16:09:40,510 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 16:09:45,709 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:09:45,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [619141556] [2024-11-08 16:09:45,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [619141556] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 16:09:45,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1790738786] [2024-11-08 16:09:45,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:09:45,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:09:45,710 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10bed78d-be58-4612-93ef-123fdfa27175/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:09:45,712 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10bed78d-be58-4612-93ef-123fdfa27175/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 16:09:45,720 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_10bed78d-be58-4612-93ef-123fdfa27175/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-08 16:09:46,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:09:46,823 INFO L255 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-08 16:09:46,831 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:09:54,607 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 17 treesize of output 17 [2024-11-08 16:09:55,498 INFO L349 Elim1Store]: treesize reduction 261, result has 25.2 percent of original size [2024-11-08 16:09:55,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 202 treesize of output 318 [2024-11-08 16:09:56,630 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 16:09:56,736 INFO L349 Elim1Store]: treesize reduction 12, result has 60.0 percent of original size [2024-11-08 16:09:56,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 101 treesize of output 98 [2024-11-08 16:09:56,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 54 treesize of output 44 [2024-11-08 16:09:56,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 16:09:56,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 16:09:57,010 INFO L349 Elim1Store]: treesize reduction 17, result has 32.0 percent of original size [2024-11-08 16:09:57,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 12 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 81 treesize of output 77 [2024-11-08 16:09:57,097 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 16:09:57,104 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 16:09:57,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 57 [2024-11-08 16:09:57,118 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 112 treesize of output 86 [2024-11-08 16:09:57,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 89 treesize of output 69 [2024-11-08 16:09:58,056 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 16:09:58,057 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 58 [2024-11-08 16:09:58,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 58 treesize of output 48 [2024-11-08 16:09:58,079 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 16:09:58,522 INFO L349 Elim1Store]: treesize reduction 96, result has 41.8 percent of original size [2024-11-08 16:09:58,523 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 18 case distinctions, treesize of input 163 treesize of output 203 [2024-11-08 16:10:02,640 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 58 treesize of output 48 [2024-11-08 16:10:03,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 58 treesize of output 48 [2024-11-08 16:10:03,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 58 treesize of output 48 [2024-11-08 16:10:03,456 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 58 treesize of output 48 [2024-11-08 16:10:03,576 INFO L349 Elim1Store]: treesize reduction 29, result has 12.1 percent of original size [2024-11-08 16:10:03,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 4 case distinctions, treesize of input 78 treesize of output 68 [2024-11-08 16:10:03,625 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 58 treesize of output 48 [2024-11-08 16:10:03,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 58 treesize of output 48 [2024-11-08 16:20:26,796 WARN L286 SmtUtils]: Spent 10.08m on a formula simplification that was a NOOP. DAG size: 7443 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-08 16:20:26,802 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:20:26,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 61 select indices, 61 select index equivalence classes, 0 disjoint index pairs (out of 1830 index pairs), introduced 61 new quantified variables, introduced 1830 case distinctions, treesize of input 2995 treesize of output 16821 [2024-11-08 16:20:32,334 WARN L286 SmtUtils]: Spent 5.49s on a formula simplification. DAG size of input: 8069 DAG size of output: 8068 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:20:34,148 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 2148 treesize of output 2138 [2024-11-08 16:20:39,530 WARN L286 SmtUtils]: Spent 5.37s on a formula simplification that was a NOOP. DAG size: 8066 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:20:40,970 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 2138 treesize of output 2112 [2024-11-08 16:20:46,437 WARN L286 SmtUtils]: Spent 5.45s on a formula simplification that was a NOOP. DAG size: 8065 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:20:47,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 2112 treesize of output 2100 [2024-11-08 16:20:53,075 WARN L286 SmtUtils]: Spent 5.38s on a formula simplification that was a NOOP. DAG size: 8064 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 16:20:54,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 2100 treesize of output 2074 [2024-11-08 16:20:59,599 WARN L286 SmtUtils]: Spent 5.26s on a formula simplification that was a NOOP. DAG size: 8063 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)