./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-84.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cd99b5b-6820-4803-a9e6-81859ef0faef/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cd99b5b-6820-4803-a9e6-81859ef0faef/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cd99b5b-6820-4803-a9e6-81859ef0faef/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cd99b5b-6820-4803-a9e6-81859ef0faef/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-84.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cd99b5b-6820-4803-a9e6-81859ef0faef/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cd99b5b-6820-4803-a9e6-81859ef0faef/bin/uautomizer-verify-aQ6SnzHsRB --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 645cc8cd2ca5c3df18e88a30b2b1ec0d9c7b704a87e37ccd990a4988acc7530a --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 02:48:37,423 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 02:48:37,510 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cd99b5b-6820-4803-a9e6-81859ef0faef/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-28 02:48:37,517 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 02:48:37,518 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 02:48:37,553 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 02:48:37,554 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 02:48:37,555 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 02:48:37,555 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 02:48:37,555 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 02:48:37,556 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 02:48:37,557 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 02:48:37,557 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 02:48:37,557 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 02:48:37,557 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 02:48:37,558 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 02:48:37,558 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-28 02:48:37,558 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 02:48:37,558 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-28 02:48:37,558 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 02:48:37,558 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 02:48:37,558 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-28 02:48:37,558 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 02:48:37,559 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-28 02:48:37,559 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 02:48:37,559 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-28 02:48:37,559 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 02:48:37,559 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 02:48:37,560 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 02:48:37,560 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 02:48:37,560 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 02:48:37,560 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 02:48:37,560 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 02:48:37,561 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 02:48:37,561 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 02:48:37,561 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 02:48:37,561 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 02:48:37,561 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 02:48:37,561 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 02:48:37,562 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 02:48:37,562 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-28 02:48:37,562 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-28 02:48:37,562 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-28 02:48:37,562 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-28 02:48:37,562 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 02:48:37,562 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 02:48:37,562 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 02:48:37,562 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 02:48:37,563 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_9cd99b5b-6820-4803-a9e6-81859ef0faef/bin/uautomizer-verify-aQ6SnzHsRB 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 -> 645cc8cd2ca5c3df18e88a30b2b1ec0d9c7b704a87e37ccd990a4988acc7530a [2024-11-28 02:48:37,881 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 02:48:37,894 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 02:48:37,897 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 02:48:37,899 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 02:48:37,899 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 02:48:37,902 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cd99b5b-6820-4803-a9e6-81859ef0faef/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-84.i [2024-11-28 02:48:40,943 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cd99b5b-6820-4803-a9e6-81859ef0faef/bin/uautomizer-verify-aQ6SnzHsRB/data/46c12ba3d/db6a78dec8524460876a1ce700aeb627/FLAGf30c61003 [2024-11-28 02:48:41,235 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 02:48:41,235 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cd99b5b-6820-4803-a9e6-81859ef0faef/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-84.i [2024-11-28 02:48:41,244 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cd99b5b-6820-4803-a9e6-81859ef0faef/bin/uautomizer-verify-aQ6SnzHsRB/data/46c12ba3d/db6a78dec8524460876a1ce700aeb627/FLAGf30c61003 [2024-11-28 02:48:41,258 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cd99b5b-6820-4803-a9e6-81859ef0faef/bin/uautomizer-verify-aQ6SnzHsRB/data/46c12ba3d/db6a78dec8524460876a1ce700aeb627 [2024-11-28 02:48:41,260 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 02:48:41,262 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 02:48:41,263 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 02:48:41,263 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 02:48:41,268 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 02:48:41,269 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:48:41" (1/1) ... [2024-11-28 02:48:41,270 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6acda766 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:48:41, skipping insertion in model container [2024-11-28 02:48:41,270 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:48:41" (1/1) ... [2024-11-28 02:48:41,290 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 02:48:41,429 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_9cd99b5b-6820-4803-a9e6-81859ef0faef/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-84.i[917,930] [2024-11-28 02:48:41,512 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 02:48:41,523 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 02:48:41,534 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_9cd99b5b-6820-4803-a9e6-81859ef0faef/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-84.i[917,930] [2024-11-28 02:48:41,572 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 02:48:41,593 INFO L204 MainTranslator]: Completed translation [2024-11-28 02:48:41,594 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:48:41 WrapperNode [2024-11-28 02:48:41,594 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 02:48:41,595 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 02:48:41,595 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 02:48:41,595 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 02:48:41,602 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:48:41" (1/1) ... [2024-11-28 02:48:41,614 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:48:41" (1/1) ... [2024-11-28 02:48:41,658 INFO L138 Inliner]: procedures = 30, calls = 154, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 438 [2024-11-28 02:48:41,659 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 02:48:41,659 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 02:48:41,659 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 02:48:41,659 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 02:48:41,673 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:48:41" (1/1) ... [2024-11-28 02:48:41,673 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:48:41" (1/1) ... [2024-11-28 02:48:41,679 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:48:41" (1/1) ... [2024-11-28 02:48:41,685 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-28 02:48:41,686 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:48:41" (1/1) ... [2024-11-28 02:48:41,686 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:48:41" (1/1) ... [2024-11-28 02:48:41,701 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:48:41" (1/1) ... [2024-11-28 02:48:41,703 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:48:41" (1/1) ... [2024-11-28 02:48:41,707 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:48:41" (1/1) ... [2024-11-28 02:48:41,710 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:48:41" (1/1) ... [2024-11-28 02:48:41,712 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:48:41" (1/1) ... [2024-11-28 02:48:41,718 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 02:48:41,719 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 02:48:41,719 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 02:48:41,719 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 02:48:41,720 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:48:41" (1/1) ... [2024-11-28 02:48:41,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 02:48:41,750 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cd99b5b-6820-4803-a9e6-81859ef0faef/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:48:41,765 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cd99b5b-6820-4803-a9e6-81859ef0faef/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-28 02:48:41,776 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cd99b5b-6820-4803-a9e6-81859ef0faef/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-28 02:48:41,800 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 02:48:41,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-28 02:48:41,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-28 02:48:41,801 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-28 02:48:41,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-28 02:48:41,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-28 02:48:41,801 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-28 02:48:41,802 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-28 02:48:41,802 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-28 02:48:41,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-28 02:48:41,802 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 02:48:41,802 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 02:48:41,960 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 02:48:41,962 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 02:48:42,656 INFO L? ?]: Removed 98 outVars from TransFormulas that were not future-live. [2024-11-28 02:48:42,656 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 02:48:42,674 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 02:48:42,674 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-28 02:48:42,674 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:48:42 BoogieIcfgContainer [2024-11-28 02:48:42,674 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 02:48:42,678 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 02:48:42,678 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 02:48:42,684 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 02:48:42,684 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 02:48:41" (1/3) ... [2024-11-28 02:48:42,685 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d1fe1f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:48:42, skipping insertion in model container [2024-11-28 02:48:42,685 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:48:41" (2/3) ... [2024-11-28 02:48:42,685 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d1fe1f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:48:42, skipping insertion in model container [2024-11-28 02:48:42,685 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:48:42" (3/3) ... [2024-11-28 02:48:42,686 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-84.i [2024-11-28 02:48:42,708 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 02:48:42,710 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-sp_file-84.i that has 2 procedures, 103 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-28 02:48:42,787 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 02:48:42,803 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;@755879c2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 02:48:42,803 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-28 02:48:42,807 INFO L276 IsEmpty]: Start isEmpty. Operand has 103 states, 80 states have (on average 1.35) internal successors, (108), 81 states have internal predecessors, (108), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-28 02:48:42,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-28 02:48:42,822 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:48:42,824 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 02:48:42,824 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:48:42,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:48:42,831 INFO L85 PathProgramCache]: Analyzing trace with hash 924800917, now seen corresponding path program 1 times [2024-11-28 02:48:42,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:48:42,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5332068] [2024-11-28 02:48:42,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:48:42,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:48:43,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:48:43,358 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2024-11-28 02:48:43,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:48:43,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5332068] [2024-11-28 02:48:43,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5332068] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:48:43,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [195561505] [2024-11-28 02:48:43,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:48:43,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:48:43,360 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cd99b5b-6820-4803-a9e6-81859ef0faef/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:48:43,362 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cd99b5b-6820-4803-a9e6-81859ef0faef/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:48:43,368 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cd99b5b-6820-4803-a9e6-81859ef0faef/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-28 02:48:43,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:48:43,766 INFO L256 TraceCheckSpWp]: Trace formula consists of 585 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-28 02:48:43,777 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:48:43,819 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2024-11-28 02:48:43,823 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 02:48:43,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [195561505] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:48:43,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-28 02:48:43,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-28 02:48:43,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472335727] [2024-11-28 02:48:43,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:48:43,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-28 02:48:43,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:48:43,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-28 02:48:43,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-28 02:48:43,852 INFO L87 Difference]: Start difference. First operand has 103 states, 80 states have (on average 1.35) internal successors, (108), 81 states have internal predecessors, (108), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-28 02:48:43,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:48:43,882 INFO L93 Difference]: Finished difference Result 199 states and 310 transitions. [2024-11-28 02:48:43,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-28 02:48:43,884 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 150 [2024-11-28 02:48:43,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:48:43,891 INFO L225 Difference]: With dead ends: 199 [2024-11-28 02:48:43,891 INFO L226 Difference]: Without dead ends: 99 [2024-11-28 02:48:43,895 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 151 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-28 02:48:43,897 INFO L435 NwaCegarLoop]: 141 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, 141 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-28 02:48:43,898 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 02:48:43,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-28 02:48:43,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-11-28 02:48:43,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 77 states have (on average 1.3116883116883118) internal successors, (101), 77 states have internal predecessors, (101), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-28 02:48:43,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 141 transitions. [2024-11-28 02:48:43,953 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 141 transitions. Word has length 150 [2024-11-28 02:48:43,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:48:43,953 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 141 transitions. [2024-11-28 02:48:43,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-28 02:48:43,954 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 141 transitions. [2024-11-28 02:48:43,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-28 02:48:43,962 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:48:43,963 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 02:48:43,974 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cd99b5b-6820-4803-a9e6-81859ef0faef/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-28 02:48:44,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cd99b5b-6820-4803-a9e6-81859ef0faef/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:48:44,164 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:48:44,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:48:44,165 INFO L85 PathProgramCache]: Analyzing trace with hash 1032707065, now seen corresponding path program 1 times [2024-11-28 02:48:44,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:48:44,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326808236] [2024-11-28 02:48:44,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:48:44,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:48:44,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:48:44,602 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-28 02:48:44,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:48:44,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326808236] [2024-11-28 02:48:44,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326808236] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:48:44,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:48:44,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 02:48:44,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508289931] [2024-11-28 02:48:44,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:48:44,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 02:48:44,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:48:44,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 02:48:44,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 02:48:44,607 INFO L87 Difference]: Start difference. First operand 99 states and 141 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-28 02:48:44,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:48:44,676 INFO L93 Difference]: Finished difference Result 198 states and 283 transitions. [2024-11-28 02:48:44,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 02:48:44,676 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 150 [2024-11-28 02:48:44,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:48:44,679 INFO L225 Difference]: With dead ends: 198 [2024-11-28 02:48:44,679 INFO L226 Difference]: Without dead ends: 102 [2024-11-28 02:48:44,683 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-28 02:48:44,686 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 1 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 02:48:44,686 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 405 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 02:48:44,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-28 02:48:44,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2024-11-28 02:48:44,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 79 states have (on average 1.3037974683544304) internal successors, (103), 79 states have internal predecessors, (103), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-28 02:48:44,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 143 transitions. [2024-11-28 02:48:44,713 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 143 transitions. Word has length 150 [2024-11-28 02:48:44,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:48:44,714 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 143 transitions. [2024-11-28 02:48:44,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-28 02:48:44,715 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 143 transitions. [2024-11-28 02:48:44,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-28 02:48:44,721 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:48:44,721 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 02:48:44,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-28 02:48:44,721 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:48:44,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:48:44,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1034554107, now seen corresponding path program 1 times [2024-11-28 02:48:44,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:48:44,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463817875] [2024-11-28 02:48:44,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:48:44,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:48:44,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:48:46,029 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-28 02:48:46,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:48:46,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463817875] [2024-11-28 02:48:46,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463817875] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:48:46,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:48:46,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 02:48:46,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624851297] [2024-11-28 02:48:46,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:48:46,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 02:48:46,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:48:46,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 02:48:46,034 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 02:48:46,034 INFO L87 Difference]: Start difference. First operand 101 states and 143 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-28 02:48:46,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:48:46,816 INFO L93 Difference]: Finished difference Result 292 states and 415 transitions. [2024-11-28 02:48:46,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 02:48:46,817 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 150 [2024-11-28 02:48:46,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:48:46,819 INFO L225 Difference]: With dead ends: 292 [2024-11-28 02:48:46,820 INFO L226 Difference]: Without dead ends: 194 [2024-11-28 02:48:46,820 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-28 02:48:46,821 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 106 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-28 02:48:46,822 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 370 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-28 02:48:46,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2024-11-28 02:48:46,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 169. [2024-11-28 02:48:46,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 126 states have (on average 1.2698412698412698) internal successors, (160), 126 states have internal predecessors, (160), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-28 02:48:46,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 240 transitions. [2024-11-28 02:48:46,853 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 240 transitions. Word has length 150 [2024-11-28 02:48:46,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:48:46,855 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 240 transitions. [2024-11-28 02:48:46,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-28 02:48:46,856 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 240 transitions. [2024-11-28 02:48:46,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-28 02:48:46,862 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:48:46,862 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 02:48:46,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-28 02:48:46,862 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:48:46,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:48:46,863 INFO L85 PathProgramCache]: Analyzing trace with hash 2120166937, now seen corresponding path program 1 times [2024-11-28 02:48:46,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:48:46,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289375041] [2024-11-28 02:48:46,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:48:46,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:48:47,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:48:57,588 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-28 02:48:57,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:48:57,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289375041] [2024-11-28 02:48:57,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289375041] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:48:57,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:48:57,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-28 02:48:57,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965075830] [2024-11-28 02:48:57,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:48:57,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-28 02:48:57,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:48:57,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-28 02:48:57,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2024-11-28 02:48:57,592 INFO L87 Difference]: Start difference. First operand 169 states and 240 transitions. Second operand has 18 states, 16 states have (on average 3.8125) internal successors, (61), 18 states have internal predecessors, (61), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-28 02:49:02,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:49:02,434 INFO L93 Difference]: Finished difference Result 322 states and 456 transitions. [2024-11-28 02:49:02,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-28 02:49:02,435 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 3.8125) internal successors, (61), 18 states have internal predecessors, (61), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) Word has length 158 [2024-11-28 02:49:02,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:49:02,439 INFO L225 Difference]: With dead ends: 322 [2024-11-28 02:49:02,439 INFO L226 Difference]: Without dead ends: 224 [2024-11-28 02:49:02,440 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=131, Invalid=625, Unknown=0, NotChecked=0, Total=756 [2024-11-28 02:49:02,441 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 252 mSDsluCounter, 753 mSDsCounter, 0 mSdLazyCounter, 1432 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 849 SdHoareTripleChecker+Invalid, 1458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-11-28 02:49:02,442 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 849 Invalid, 1458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1432 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-11-28 02:49:02,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2024-11-28 02:49:02,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 195. [2024-11-28 02:49:02,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 152 states have (on average 1.2960526315789473) internal successors, (197), 152 states have internal predecessors, (197), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-28 02:49:02,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 277 transitions. [2024-11-28 02:49:02,509 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 277 transitions. Word has length 158 [2024-11-28 02:49:02,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:49:02,510 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 277 transitions. [2024-11-28 02:49:02,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 3.8125) internal successors, (61), 18 states have internal predecessors, (61), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-28 02:49:02,510 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 277 transitions. [2024-11-28 02:49:02,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-28 02:49:02,512 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:49:02,513 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 02:49:02,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-28 02:49:02,513 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:49:02,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:49:02,514 INFO L85 PathProgramCache]: Analyzing trace with hash -710246938, now seen corresponding path program 1 times [2024-11-28 02:49:02,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:49:02,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786946620] [2024-11-28 02:49:02,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:49:02,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:49:02,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:49:13,247 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-28 02:49:13,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:49:13,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786946620] [2024-11-28 02:49:13,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786946620] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:49:13,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:49:13,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2024-11-28 02:49:13,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356919742] [2024-11-28 02:49:13,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:49:13,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-28 02:49:13,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:49:13,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-28 02:49:13,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2024-11-28 02:49:13,251 INFO L87 Difference]: Start difference. First operand 195 states and 277 transitions. Second operand has 20 states, 18 states have (on average 3.4444444444444446) internal successors, (62), 20 states have internal predecessors, (62), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-28 02:49:20,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:49:20,923 INFO L93 Difference]: Finished difference Result 468 states and 652 transitions. [2024-11-28 02:49:20,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-28 02:49:20,924 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 3.4444444444444446) internal successors, (62), 20 states have internal predecessors, (62), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) Word has length 159 [2024-11-28 02:49:20,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:49:20,926 INFO L225 Difference]: With dead ends: 468 [2024-11-28 02:49:20,926 INFO L226 Difference]: Without dead ends: 354 [2024-11-28 02:49:20,928 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=254, Invalid=1152, Unknown=0, NotChecked=0, Total=1406 [2024-11-28 02:49:20,928 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 457 mSDsluCounter, 1203 mSDsCounter, 0 mSdLazyCounter, 1995 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 459 SdHoareTripleChecker+Valid, 1343 SdHoareTripleChecker+Invalid, 2012 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1995 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-11-28 02:49:20,929 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [459 Valid, 1343 Invalid, 2012 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1995 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2024-11-28 02:49:20,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2024-11-28 02:49:20,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 201. [2024-11-28 02:49:20,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 158 states have (on average 1.3101265822784811) internal successors, (207), 158 states have internal predecessors, (207), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-28 02:49:20,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 287 transitions. [2024-11-28 02:49:20,977 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 287 transitions. Word has length 159 [2024-11-28 02:49:20,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:49:20,978 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 287 transitions. [2024-11-28 02:49:20,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 3.4444444444444446) internal successors, (62), 20 states have internal predecessors, (62), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-28 02:49:20,978 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 287 transitions. [2024-11-28 02:49:20,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-28 02:49:20,980 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:49:20,980 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 02:49:20,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-28 02:49:20,981 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:49:20,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:49:20,981 INFO L85 PathProgramCache]: Analyzing trace with hash -491392220, now seen corresponding path program 1 times [2024-11-28 02:49:20,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:49:20,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887055512] [2024-11-28 02:49:20,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:49:20,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:49:21,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:49:28,456 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-28 02:49:28,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:49:28,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887055512] [2024-11-28 02:49:28,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887055512] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:49:28,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:49:28,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-28 02:49:28,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435996828] [2024-11-28 02:49:28,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:49:28,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-28 02:49:28,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:49:28,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-28 02:49:28,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2024-11-28 02:49:28,459 INFO L87 Difference]: Start difference. First operand 201 states and 287 transitions. Second operand has 18 states, 16 states have (on average 3.875) internal successors, (62), 18 states have internal predecessors, (62), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-28 02:49:32,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:49:32,094 INFO L93 Difference]: Finished difference Result 357 states and 507 transitions. [2024-11-28 02:49:32,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-28 02:49:32,095 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 3.875) internal successors, (62), 18 states have internal predecessors, (62), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) Word has length 159 [2024-11-28 02:49:32,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:49:32,097 INFO L225 Difference]: With dead ends: 357 [2024-11-28 02:49:32,097 INFO L226 Difference]: Without dead ends: 240 [2024-11-28 02:49:32,098 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=131, Invalid=571, Unknown=0, NotChecked=0, Total=702 [2024-11-28 02:49:32,098 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 216 mSDsluCounter, 594 mSDsCounter, 0 mSdLazyCounter, 1330 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 671 SdHoareTripleChecker+Invalid, 1337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-28 02:49:32,099 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 671 Invalid, 1337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1330 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-28 02:49:32,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2024-11-28 02:49:32,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 195. [2024-11-28 02:49:32,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 152 states have (on average 1.2960526315789473) internal successors, (197), 152 states have internal predecessors, (197), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-28 02:49:32,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 277 transitions. [2024-11-28 02:49:32,141 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 277 transitions. Word has length 159 [2024-11-28 02:49:32,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:49:32,142 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 277 transitions. [2024-11-28 02:49:32,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 3.875) internal successors, (62), 18 states have internal predecessors, (62), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-28 02:49:32,142 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 277 transitions. [2024-11-28 02:49:32,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-28 02:49:32,146 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:49:32,146 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 02:49:32,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-28 02:49:32,146 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:49:32,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:49:32,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1171616002, now seen corresponding path program 1 times [2024-11-28 02:49:32,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:49:32,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494197950] [2024-11-28 02:49:32,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:49:32,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:49:32,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:49:36,785 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-28 02:49:36,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:49:36,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494197950] [2024-11-28 02:49:36,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494197950] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:49:36,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:49:36,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-28 02:49:36,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675822817] [2024-11-28 02:49:36,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:49:36,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-28 02:49:36,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:49:36,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-28 02:49:36,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2024-11-28 02:49:36,787 INFO L87 Difference]: Start difference. First operand 195 states and 277 transitions. Second operand has 15 states, 13 states have (on average 4.846153846153846) internal successors, (63), 15 states have internal predecessors, (63), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-28 02:49:39,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:49:39,772 INFO L93 Difference]: Finished difference Result 378 states and 533 transitions. [2024-11-28 02:49:39,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-28 02:49:39,773 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 4.846153846153846) internal successors, (63), 15 states have internal predecessors, (63), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) Word has length 160 [2024-11-28 02:49:39,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:49:39,776 INFO L225 Difference]: With dead ends: 378 [2024-11-28 02:49:39,776 INFO L226 Difference]: Without dead ends: 264 [2024-11-28 02:49:39,777 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=93, Invalid=369, Unknown=0, NotChecked=0, Total=462 [2024-11-28 02:49:39,779 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 211 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 1219 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 1230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-28 02:49:39,780 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 578 Invalid, 1230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1219 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-28 02:49:39,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2024-11-28 02:49:39,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 261. [2024-11-28 02:49:39,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 215 states have (on average 1.3162790697674418) internal successors, (283), 216 states have internal predecessors, (283), 42 states have call successors, (42), 3 states have call predecessors, (42), 3 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-28 02:49:39,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 367 transitions. [2024-11-28 02:49:39,834 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 367 transitions. Word has length 160 [2024-11-28 02:49:39,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:49:39,834 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 367 transitions. [2024-11-28 02:49:39,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 4.846153846153846) internal successors, (63), 15 states have internal predecessors, (63), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-28 02:49:39,835 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 367 transitions. [2024-11-28 02:49:39,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-28 02:49:39,836 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:49:39,837 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 02:49:39,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-28 02:49:39,837 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:49:39,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:49:39,837 INFO L85 PathProgramCache]: Analyzing trace with hash 269132564, now seen corresponding path program 1 times [2024-11-28 02:49:39,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:49:39,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744540188] [2024-11-28 02:49:39,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:49:39,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:49:40,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:49:43,514 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-28 02:49:43,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:49:43,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744540188] [2024-11-28 02:49:43,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744540188] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:49:43,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:49:43,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-28 02:49:43,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023100140] [2024-11-28 02:49:43,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:49:43,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-28 02:49:43,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:49:43,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-28 02:49:43,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2024-11-28 02:49:43,516 INFO L87 Difference]: Start difference. First operand 261 states and 367 transitions. Second operand has 16 states, 15 states have (on average 4.2) internal successors, (63), 16 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-28 02:49:45,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:49:45,831 INFO L93 Difference]: Finished difference Result 554 states and 778 transitions. [2024-11-28 02:49:45,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-28 02:49:45,832 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 4.2) internal successors, (63), 16 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) Word has length 160 [2024-11-28 02:49:45,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:49:45,835 INFO L225 Difference]: With dead ends: 554 [2024-11-28 02:49:45,837 INFO L226 Difference]: Without dead ends: 386 [2024-11-28 02:49:45,838 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=114, Invalid=486, Unknown=0, NotChecked=0, Total=600 [2024-11-28 02:49:45,838 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 318 mSDsluCounter, 659 mSDsCounter, 0 mSdLazyCounter, 973 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 742 SdHoareTripleChecker+Invalid, 998 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 973 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-28 02:49:45,839 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 742 Invalid, 998 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 973 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-28 02:49:45,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2024-11-28 02:49:45,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 338. [2024-11-28 02:49:45,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 292 states have (on average 1.345890410958904) internal successors, (393), 293 states have internal predecessors, (393), 42 states have call successors, (42), 3 states have call predecessors, (42), 3 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-28 02:49:45,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 477 transitions. [2024-11-28 02:49:45,895 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 477 transitions. Word has length 160 [2024-11-28 02:49:45,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:49:45,896 INFO L471 AbstractCegarLoop]: Abstraction has 338 states and 477 transitions. [2024-11-28 02:49:45,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 4.2) internal successors, (63), 16 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-28 02:49:45,896 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 477 transitions. [2024-11-28 02:49:45,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-28 02:49:45,898 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:49:45,898 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 02:49:45,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-28 02:49:45,898 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:49:45,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:49:45,899 INFO L85 PathProgramCache]: Analyzing trace with hash 1129206588, now seen corresponding path program 1 times [2024-11-28 02:49:45,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:49:45,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341251059] [2024-11-28 02:49:45,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:49:45,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:49:45,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:49:46,239 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-28 02:49:46,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:49:46,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341251059] [2024-11-28 02:49:46,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341251059] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:49:46,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:49:46,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 02:49:46,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035556644] [2024-11-28 02:49:46,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:49:46,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 02:49:46,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:49:46,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 02:49:46,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 02:49:46,241 INFO L87 Difference]: Start difference. First operand 338 states and 477 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-28 02:49:46,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:49:46,712 INFO L93 Difference]: Finished difference Result 650 states and 908 transitions. [2024-11-28 02:49:46,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 02:49:46,713 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 160 [2024-11-28 02:49:46,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:49:46,715 INFO L225 Difference]: With dead ends: 650 [2024-11-28 02:49:46,716 INFO L226 Difference]: Without dead ends: 426 [2024-11-28 02:49:46,716 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-28 02:49:46,717 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 38 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-28 02:49:46,717 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 450 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-28 02:49:46,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2024-11-28 02:49:46,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 348. [2024-11-28 02:49:46,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 302 states have (on average 1.3410596026490067) internal successors, (405), 303 states have internal predecessors, (405), 42 states have call successors, (42), 3 states have call predecessors, (42), 3 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-28 02:49:46,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 489 transitions. [2024-11-28 02:49:46,785 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 489 transitions. Word has length 160 [2024-11-28 02:49:46,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:49:46,786 INFO L471 AbstractCegarLoop]: Abstraction has 348 states and 489 transitions. [2024-11-28 02:49:46,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-28 02:49:46,786 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 489 transitions. [2024-11-28 02:49:46,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-28 02:49:46,788 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:49:46,788 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 02:49:46,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-28 02:49:46,789 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:49:46,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:49:46,789 INFO L85 PathProgramCache]: Analyzing trace with hash -150657090, now seen corresponding path program 1 times [2024-11-28 02:49:46,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:49:46,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093951431] [2024-11-28 02:49:46,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:49:46,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:49:46,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:49:50,391 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-28 02:49:50,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:49:50,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093951431] [2024-11-28 02:49:50,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093951431] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:49:50,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:49:50,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-28 02:49:50,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811198422] [2024-11-28 02:49:50,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:49:50,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-28 02:49:50,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:49:50,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-28 02:49:50,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-11-28 02:49:50,394 INFO L87 Difference]: Start difference. First operand 348 states and 489 transitions. Second operand has 12 states, 10 states have (on average 6.3) internal successors, (63), 12 states have internal predecessors, (63), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-28 02:49:51,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:49:51,899 INFO L93 Difference]: Finished difference Result 662 states and 930 transitions. [2024-11-28 02:49:51,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-28 02:49:51,900 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 6.3) internal successors, (63), 12 states have internal predecessors, (63), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) Word has length 160 [2024-11-28 02:49:51,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:49:51,902 INFO L225 Difference]: With dead ends: 662 [2024-11-28 02:49:51,902 INFO L226 Difference]: Without dead ends: 428 [2024-11-28 02:49:51,903 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2024-11-28 02:49:51,904 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 259 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 582 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-28 02:49:51,904 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 339 Invalid, 600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 582 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-28 02:49:51,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2024-11-28 02:49:51,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 388. [2024-11-28 02:49:51,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 342 states have (on average 1.3538011695906433) internal successors, (463), 343 states have internal predecessors, (463), 42 states have call successors, (42), 3 states have call predecessors, (42), 3 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-28 02:49:51,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 547 transitions. [2024-11-28 02:49:51,974 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 547 transitions. Word has length 160 [2024-11-28 02:49:51,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:49:51,974 INFO L471 AbstractCegarLoop]: Abstraction has 388 states and 547 transitions. [2024-11-28 02:49:51,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 6.3) internal successors, (63), 12 states have internal predecessors, (63), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-28 02:49:51,974 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 547 transitions. [2024-11-28 02:49:51,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-28 02:49:51,976 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:49:51,976 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 02:49:51,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-28 02:49:51,977 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:49:51,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:49:51,977 INFO L85 PathProgramCache]: Analyzing trace with hash 409681174, now seen corresponding path program 1 times [2024-11-28 02:49:51,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:49:51,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057351617] [2024-11-28 02:49:51,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:49:51,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:49:52,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:49:52,608 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-28 02:49:52,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:49:52,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057351617] [2024-11-28 02:49:52,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057351617] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:49:52,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:49:52,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-28 02:49:52,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660235046] [2024-11-28 02:49:52,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:49:52,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 02:49:52,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:49:52,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 02:49:52,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-28 02:49:52,611 INFO L87 Difference]: Start difference. First operand 388 states and 547 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-28 02:49:53,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:49:53,207 INFO L93 Difference]: Finished difference Result 718 states and 1005 transitions. [2024-11-28 02:49:53,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 02:49:53,208 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 160 [2024-11-28 02:49:53,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:49:53,211 INFO L225 Difference]: With dead ends: 718 [2024-11-28 02:49:53,211 INFO L226 Difference]: Without dead ends: 463 [2024-11-28 02:49:53,212 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-28 02:49:53,212 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 167 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-28 02:49:53,213 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 404 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-28 02:49:53,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2024-11-28 02:49:53,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 415. [2024-11-28 02:49:53,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 369 states have (on average 1.3523035230352303) internal successors, (499), 370 states have internal predecessors, (499), 42 states have call successors, (42), 3 states have call predecessors, (42), 3 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-28 02:49:53,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 583 transitions. [2024-11-28 02:49:53,289 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 583 transitions. Word has length 160 [2024-11-28 02:49:53,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:49:53,289 INFO L471 AbstractCegarLoop]: Abstraction has 415 states and 583 transitions. [2024-11-28 02:49:53,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-28 02:49:53,290 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 583 transitions. [2024-11-28 02:49:53,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-28 02:49:53,291 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:49:53,292 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 02:49:53,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-28 02:49:53,292 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:49:53,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:49:53,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1545951006, now seen corresponding path program 1 times [2024-11-28 02:49:53,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:49:53,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020353048] [2024-11-28 02:49:53,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:49:53,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:49:53,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:49:57,023 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-28 02:49:57,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:49:57,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020353048] [2024-11-28 02:49:57,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020353048] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:49:57,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:49:57,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-28 02:49:57,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998137606] [2024-11-28 02:49:57,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:49:57,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-28 02:49:57,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:49:57,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-28 02:49:57,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2024-11-28 02:49:57,024 INFO L87 Difference]: Start difference. First operand 415 states and 583 transitions. Second operand has 15 states, 13 states have (on average 4.846153846153846) internal successors, (63), 15 states have internal predecessors, (63), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-28 02:49:59,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:49:59,646 INFO L93 Difference]: Finished difference Result 736 states and 1026 transitions. [2024-11-28 02:49:59,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-28 02:49:59,646 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 4.846153846153846) internal successors, (63), 15 states have internal predecessors, (63), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) Word has length 160 [2024-11-28 02:49:59,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:49:59,649 INFO L225 Difference]: With dead ends: 736 [2024-11-28 02:49:59,649 INFO L226 Difference]: Without dead ends: 458 [2024-11-28 02:49:59,650 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=93, Invalid=369, Unknown=0, NotChecked=0, Total=462 [2024-11-28 02:49:59,650 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 287 mSDsluCounter, 563 mSDsCounter, 0 mSdLazyCounter, 1138 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 675 SdHoareTripleChecker+Invalid, 1182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 1138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-28 02:49:59,651 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 675 Invalid, 1182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 1138 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-28 02:49:59,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2024-11-28 02:49:59,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 419. [2024-11-28 02:49:59,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 372 states have (on average 1.3440860215053763) internal successors, (500), 373 states have internal predecessors, (500), 42 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-28 02:49:59,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 584 transitions. [2024-11-28 02:49:59,731 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 584 transitions. Word has length 160 [2024-11-28 02:49:59,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:49:59,731 INFO L471 AbstractCegarLoop]: Abstraction has 419 states and 584 transitions. [2024-11-28 02:49:59,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 4.846153846153846) internal successors, (63), 15 states have internal predecessors, (63), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-28 02:49:59,732 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 584 transitions. [2024-11-28 02:49:59,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-28 02:49:59,734 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:49:59,734 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 02:49:59,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-28 02:49:59,734 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:49:59,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:49:59,735 INFO L85 PathProgramCache]: Analyzing trace with hash -1148983748, now seen corresponding path program 1 times [2024-11-28 02:49:59,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:49:59,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947278144] [2024-11-28 02:49:59,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:49:59,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:49:59,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:50:03,276 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-28 02:50:03,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:50:03,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947278144] [2024-11-28 02:50:03,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947278144] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:50:03,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:50:03,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-28 02:50:03,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016519098] [2024-11-28 02:50:03,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:50:03,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-28 02:50:03,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:50:03,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-28 02:50:03,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2024-11-28 02:50:03,279 INFO L87 Difference]: Start difference. First operand 419 states and 584 transitions. Second operand has 16 states, 14 states have (on average 4.5) internal successors, (63), 16 states have internal predecessors, (63), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-28 02:50:06,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:50:06,000 INFO L93 Difference]: Finished difference Result 746 states and 1034 transitions. [2024-11-28 02:50:06,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-28 02:50:06,001 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 4.5) internal successors, (63), 16 states have internal predecessors, (63), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) Word has length 160 [2024-11-28 02:50:06,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:50:06,004 INFO L225 Difference]: With dead ends: 746 [2024-11-28 02:50:06,004 INFO L226 Difference]: Without dead ends: 468 [2024-11-28 02:50:06,005 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=101, Invalid=405, Unknown=0, NotChecked=0, Total=506 [2024-11-28 02:50:06,006 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 371 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 1246 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 626 SdHoareTripleChecker+Invalid, 1308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 1246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-28 02:50:06,006 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [373 Valid, 626 Invalid, 1308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 1246 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-28 02:50:06,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2024-11-28 02:50:06,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 465. [2024-11-28 02:50:06,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 413 states have (on average 1.3292978208232447) internal successors, (549), 415 states have internal predecessors, (549), 46 states have call successors, (46), 5 states have call predecessors, (46), 5 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-28 02:50:06,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 641 transitions. [2024-11-28 02:50:06,096 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 641 transitions. Word has length 160 [2024-11-28 02:50:06,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:50:06,096 INFO L471 AbstractCegarLoop]: Abstraction has 465 states and 641 transitions. [2024-11-28 02:50:06,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 4.5) internal successors, (63), 16 states have internal predecessors, (63), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-28 02:50:06,096 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 641 transitions. [2024-11-28 02:50:06,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-28 02:50:06,098 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:50:06,098 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 02:50:06,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-28 02:50:06,098 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:50:06,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:50:06,099 INFO L85 PathProgramCache]: Analyzing trace with hash -128024836, now seen corresponding path program 1 times [2024-11-28 02:50:06,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:50:06,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909266163] [2024-11-28 02:50:06,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:50:06,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:50:06,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:50:10,152 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-28 02:50:10,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:50:10,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909266163] [2024-11-28 02:50:10,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909266163] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:50:10,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:50:10,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-28 02:50:10,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195134210] [2024-11-28 02:50:10,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:50:10,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-28 02:50:10,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:50:10,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-28 02:50:10,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2024-11-28 02:50:10,154 INFO L87 Difference]: Start difference. First operand 465 states and 641 transitions. Second operand has 17 states, 15 states have (on average 4.2) internal successors, (63), 17 states have internal predecessors, (63), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-28 02:50:12,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:50:12,822 INFO L93 Difference]: Finished difference Result 786 states and 1083 transitions. [2024-11-28 02:50:12,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-28 02:50:12,823 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 4.2) internal successors, (63), 17 states have internal predecessors, (63), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) Word has length 160 [2024-11-28 02:50:12,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:50:12,826 INFO L225 Difference]: With dead ends: 786 [2024-11-28 02:50:12,826 INFO L226 Difference]: Without dead ends: 462 [2024-11-28 02:50:12,826 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=115, Invalid=437, Unknown=0, NotChecked=0, Total=552 [2024-11-28 02:50:12,827 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 243 mSDsluCounter, 616 mSDsCounter, 0 mSdLazyCounter, 1303 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 739 SdHoareTripleChecker+Invalid, 1343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 1303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-28 02:50:12,827 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 739 Invalid, 1343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 1303 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-28 02:50:12,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2024-11-28 02:50:12,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 455. [2024-11-28 02:50:12,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 455 states, 403 states have (on average 1.3325062034739454) internal successors, (537), 405 states have internal predecessors, (537), 46 states have call successors, (46), 5 states have call predecessors, (46), 5 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-28 02:50:12,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 629 transitions. [2024-11-28 02:50:12,913 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 629 transitions. Word has length 160 [2024-11-28 02:50:12,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:50:12,914 INFO L471 AbstractCegarLoop]: Abstraction has 455 states and 629 transitions. [2024-11-28 02:50:12,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 4.2) internal successors, (63), 17 states have internal predecessors, (63), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-28 02:50:12,914 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 629 transitions. [2024-11-28 02:50:12,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-28 02:50:12,916 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:50:12,916 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 02:50:12,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-28 02:50:12,916 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:50:12,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:50:12,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1568583260, now seen corresponding path program 1 times [2024-11-28 02:50:12,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:50:12,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922334008] [2024-11-28 02:50:12,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:50:12,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:50:12,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:50:13,998 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-28 02:50:13,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:50:13,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922334008] [2024-11-28 02:50:13,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922334008] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:50:14,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:50:14,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-28 02:50:14,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559315614] [2024-11-28 02:50:14,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:50:14,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 02:50:14,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:50:14,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 02:50:14,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-28 02:50:14,002 INFO L87 Difference]: Start difference. First operand 455 states and 629 transitions. Second operand has 7 states, 6 states have (on average 10.5) internal successors, (63), 7 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-28 02:50:14,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:50:14,709 INFO L93 Difference]: Finished difference Result 789 states and 1090 transitions. [2024-11-28 02:50:14,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-28 02:50:14,709 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 10.5) internal successors, (63), 7 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) Word has length 160 [2024-11-28 02:50:14,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:50:14,712 INFO L225 Difference]: With dead ends: 789 [2024-11-28 02:50:14,712 INFO L226 Difference]: Without dead ends: 455 [2024-11-28 02:50:14,712 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-11-28 02:50:14,713 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 105 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 398 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-28 02:50:14,713 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 324 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 398 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-28 02:50:14,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2024-11-28 02:50:14,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 455. [2024-11-28 02:50:14,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 455 states, 403 states have (on average 1.3275434243176178) internal successors, (535), 405 states have internal predecessors, (535), 46 states have call successors, (46), 5 states have call predecessors, (46), 5 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-28 02:50:14,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 627 transitions. [2024-11-28 02:50:14,801 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 627 transitions. Word has length 160 [2024-11-28 02:50:14,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:50:14,802 INFO L471 AbstractCegarLoop]: Abstraction has 455 states and 627 transitions. [2024-11-28 02:50:14,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 10.5) internal successors, (63), 7 states have internal predecessors, (63), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-28 02:50:14,802 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 627 transitions. [2024-11-28 02:50:14,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-28 02:50:14,803 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:50:14,803 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 02:50:14,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-28 02:50:14,804 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:50:14,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:50:14,804 INFO L85 PathProgramCache]: Analyzing trace with hash -803156002, now seen corresponding path program 1 times [2024-11-28 02:50:14,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:50:14,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277383166] [2024-11-28 02:50:14,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:50:14,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:50:14,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:50:18,444 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-28 02:50:18,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:50:18,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277383166] [2024-11-28 02:50:18,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277383166] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:50:18,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:50:18,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-28 02:50:18,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116045476] [2024-11-28 02:50:18,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:50:18,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-28 02:50:18,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:50:18,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-28 02:50:18,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2024-11-28 02:50:18,446 INFO L87 Difference]: Start difference. First operand 455 states and 627 transitions. Second operand has 14 states, 12 states have (on average 5.25) internal successors, (63), 14 states have internal predecessors, (63), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-28 02:50:20,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:50:20,446 INFO L93 Difference]: Finished difference Result 836 states and 1150 transitions. [2024-11-28 02:50:20,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-28 02:50:20,446 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 5.25) internal successors, (63), 14 states have internal predecessors, (63), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) Word has length 160 [2024-11-28 02:50:20,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:50:20,449 INFO L225 Difference]: With dead ends: 836 [2024-11-28 02:50:20,449 INFO L226 Difference]: Without dead ends: 522 [2024-11-28 02:50:20,450 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2024-11-28 02:50:20,450 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 311 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 910 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 955 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 910 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-28 02:50:20,451 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 516 Invalid, 955 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 910 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-28 02:50:20,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2024-11-28 02:50:20,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 479. [2024-11-28 02:50:20,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 479 states, 427 states have (on average 1.334894613583138) internal successors, (570), 429 states have internal predecessors, (570), 46 states have call successors, (46), 5 states have call predecessors, (46), 5 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-28 02:50:20,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 662 transitions. [2024-11-28 02:50:20,540 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 662 transitions. Word has length 160 [2024-11-28 02:50:20,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:50:20,541 INFO L471 AbstractCegarLoop]: Abstraction has 479 states and 662 transitions. [2024-11-28 02:50:20,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 5.25) internal successors, (63), 14 states have internal predecessors, (63), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-28 02:50:20,541 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 662 transitions. [2024-11-28 02:50:20,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-28 02:50:20,544 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:50:20,544 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 02:50:20,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-28 02:50:20,544 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:50:20,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:50:20,544 INFO L85 PathProgramCache]: Analyzing trace with hash -1824224356, now seen corresponding path program 1 times [2024-11-28 02:50:20,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:50:20,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231466350] [2024-11-28 02:50:20,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:50:20,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:50:20,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:50:24,747 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-28 02:50:24,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:50:24,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231466350] [2024-11-28 02:50:24,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231466350] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:50:24,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:50:24,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-28 02:50:24,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236866102] [2024-11-28 02:50:24,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:50:24,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-28 02:50:24,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:50:24,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-28 02:50:24,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2024-11-28 02:50:24,749 INFO L87 Difference]: Start difference. First operand 479 states and 662 transitions. Second operand has 16 states, 13 states have (on average 4.846153846153846) internal successors, (63), 16 states have internal predecessors, (63), 5 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 5 states have call successors, (20) [2024-11-28 02:50:28,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:50:28,028 INFO L93 Difference]: Finished difference Result 872 states and 1195 transitions. [2024-11-28 02:50:28,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-28 02:50:28,029 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 4.846153846153846) internal successors, (63), 16 states have internal predecessors, (63), 5 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 5 states have call successors, (20) Word has length 160 [2024-11-28 02:50:28,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:50:28,031 INFO L225 Difference]: With dead ends: 872 [2024-11-28 02:50:28,031 INFO L226 Difference]: Without dead ends: 534 [2024-11-28 02:50:28,032 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=105, Invalid=447, Unknown=0, NotChecked=0, Total=552 [2024-11-28 02:50:28,033 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 277 mSDsluCounter, 698 mSDsCounter, 0 mSdLazyCounter, 1432 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 806 SdHoareTripleChecker+Invalid, 1492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 1432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-28 02:50:28,034 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 806 Invalid, 1492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 1432 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-28 02:50:28,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2024-11-28 02:50:28,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 531. [2024-11-28 02:50:28,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 531 states, 472 states have (on average 1.319915254237288) internal successors, (623), 475 states have internal predecessors, (623), 50 states have call successors, (50), 8 states have call predecessors, (50), 8 states have return successors, (50), 47 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-28 02:50:28,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 723 transitions. [2024-11-28 02:50:28,124 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 723 transitions. Word has length 160 [2024-11-28 02:50:28,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:50:28,124 INFO L471 AbstractCegarLoop]: Abstraction has 531 states and 723 transitions. [2024-11-28 02:50:28,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 4.846153846153846) internal successors, (63), 16 states have internal predecessors, (63), 5 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 5 states have call successors, (20) [2024-11-28 02:50:28,125 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 723 transitions. [2024-11-28 02:50:28,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-28 02:50:28,126 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:50:28,126 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 02:50:28,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-28 02:50:28,127 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:50:28,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:50:28,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1809915787, now seen corresponding path program 1 times [2024-11-28 02:50:28,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:50:28,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356085624] [2024-11-28 02:50:28,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:50:28,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:50:28,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:50:32,951 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-28 02:50:32,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:50:32,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356085624] [2024-11-28 02:50:32,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356085624] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:50:32,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:50:32,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-28 02:50:32,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886834674] [2024-11-28 02:50:32,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:50:32,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-28 02:50:32,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:50:32,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-28 02:50:32,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2024-11-28 02:50:32,953 INFO L87 Difference]: Start difference. First operand 531 states and 723 transitions. Second operand has 17 states, 15 states have (on average 4.266666666666667) internal successors, (64), 17 states have internal predecessors, (64), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-28 02:50:36,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:50:36,392 INFO L93 Difference]: Finished difference Result 1005 states and 1361 transitions. [2024-11-28 02:50:36,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-28 02:50:36,393 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 4.266666666666667) internal successors, (64), 17 states have internal predecessors, (64), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) Word has length 161 [2024-11-28 02:50:36,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:50:36,396 INFO L225 Difference]: With dead ends: 1005 [2024-11-28 02:50:36,399 INFO L226 Difference]: Without dead ends: 619 [2024-11-28 02:50:36,401 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=125, Invalid=525, Unknown=0, NotChecked=0, Total=650 [2024-11-28 02:50:36,401 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 430 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 1154 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 432 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 1201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-28 02:50:36,401 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [432 Valid, 529 Invalid, 1201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 1154 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-28 02:50:36,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2024-11-28 02:50:36,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 550. [2024-11-28 02:50:36,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 491 states have (on average 1.3177189409368635) internal successors, (647), 494 states have internal predecessors, (647), 50 states have call successors, (50), 8 states have call predecessors, (50), 8 states have return successors, (50), 47 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-28 02:50:36,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 747 transitions. [2024-11-28 02:50:36,514 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 747 transitions. Word has length 161 [2024-11-28 02:50:36,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:50:36,514 INFO L471 AbstractCegarLoop]: Abstraction has 550 states and 747 transitions. [2024-11-28 02:50:36,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 4.266666666666667) internal successors, (64), 17 states have internal predecessors, (64), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-28 02:50:36,515 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 747 transitions. [2024-11-28 02:50:36,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-28 02:50:36,516 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:50:36,516 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 02:50:36,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-28 02:50:36,517 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:50:36,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:50:36,517 INFO L85 PathProgramCache]: Analyzing trace with hash -1044302943, now seen corresponding path program 1 times [2024-11-28 02:50:36,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:50:36,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583438983] [2024-11-28 02:50:36,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:50:36,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:50:36,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:50:42,629 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-28 02:50:42,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:50:42,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583438983] [2024-11-28 02:50:42,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583438983] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:50:42,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:50:42,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-28 02:50:42,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735859124] [2024-11-28 02:50:42,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:50:42,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-28 02:50:42,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:50:42,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-28 02:50:42,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2024-11-28 02:50:42,631 INFO L87 Difference]: Start difference. First operand 550 states and 747 transitions. Second operand has 16 states, 15 states have (on average 4.266666666666667) internal successors, (64), 16 states have internal predecessors, (64), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-28 02:50:46,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:50:46,549 INFO L93 Difference]: Finished difference Result 1104 states and 1489 transitions. [2024-11-28 02:50:46,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-28 02:50:46,556 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 4.266666666666667) internal successors, (64), 16 states have internal predecessors, (64), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) Word has length 161 [2024-11-28 02:50:46,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:50:46,559 INFO L225 Difference]: With dead ends: 1104 [2024-11-28 02:50:46,559 INFO L226 Difference]: Without dead ends: 701 [2024-11-28 02:50:46,561 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=172, Invalid=698, Unknown=0, NotChecked=0, Total=870 [2024-11-28 02:50:46,561 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 449 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 950 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 450 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 985 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 950 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-28 02:50:46,562 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [450 Valid, 546 Invalid, 985 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 950 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-28 02:50:46,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2024-11-28 02:50:46,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 588. [2024-11-28 02:50:46,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 588 states, 529 states have (on average 1.3232514177693762) internal successors, (700), 532 states have internal predecessors, (700), 50 states have call successors, (50), 8 states have call predecessors, (50), 8 states have return successors, (50), 47 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-28 02:50:46,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 800 transitions. [2024-11-28 02:50:46,690 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 800 transitions. Word has length 161 [2024-11-28 02:50:46,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:50:46,691 INFO L471 AbstractCegarLoop]: Abstraction has 588 states and 800 transitions. [2024-11-28 02:50:46,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 4.266666666666667) internal successors, (64), 16 states have internal predecessors, (64), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-28 02:50:46,691 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 800 transitions. [2024-11-28 02:50:46,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-28 02:50:46,692 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:50:46,693 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 02:50:46,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-28 02:50:46,693 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:50:46,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:50:46,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1464092597, now seen corresponding path program 1 times [2024-11-28 02:50:46,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:50:46,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007009451] [2024-11-28 02:50:46,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:50:46,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:50:46,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:50:51,320 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-28 02:50:51,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:50:51,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007009451] [2024-11-28 02:50:51,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007009451] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:50:51,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:50:51,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-28 02:50:51,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542654508] [2024-11-28 02:50:51,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:50:51,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-28 02:50:51,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:50:51,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-28 02:50:51,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2024-11-28 02:50:51,322 INFO L87 Difference]: Start difference. First operand 588 states and 800 transitions. Second operand has 14 states, 12 states have (on average 5.333333333333333) internal successors, (64), 14 states have internal predecessors, (64), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-28 02:50:53,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:50:53,337 INFO L93 Difference]: Finished difference Result 1045 states and 1422 transitions. [2024-11-28 02:50:53,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-28 02:50:53,338 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 5.333333333333333) internal successors, (64), 14 states have internal predecessors, (64), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) Word has length 161 [2024-11-28 02:50:53,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:50:53,341 INFO L225 Difference]: With dead ends: 1045 [2024-11-28 02:50:53,341 INFO L226 Difference]: Without dead ends: 610 [2024-11-28 02:50:53,343 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2024-11-28 02:50:53,343 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 206 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 897 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 911 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 897 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-28 02:50:53,344 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 460 Invalid, 911 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 897 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-28 02:50:53,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2024-11-28 02:50:53,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 562. [2024-11-28 02:50:53,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 503 states have (on average 1.31610337972167) internal successors, (662), 506 states have internal predecessors, (662), 50 states have call successors, (50), 8 states have call predecessors, (50), 8 states have return successors, (50), 47 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-28 02:50:53,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 762 transitions. [2024-11-28 02:50:53,479 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 762 transitions. Word has length 161 [2024-11-28 02:50:53,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:50:53,480 INFO L471 AbstractCegarLoop]: Abstraction has 562 states and 762 transitions. [2024-11-28 02:50:53,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 5.333333333333333) internal successors, (64), 14 states have internal predecessors, (64), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-28 02:50:53,480 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 762 transitions. [2024-11-28 02:50:53,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-28 02:50:53,481 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:50:53,482 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 02:50:53,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-28 02:50:53,482 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:50:53,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:50:53,483 INFO L85 PathProgramCache]: Analyzing trace with hash -982263329, now seen corresponding path program 1 times [2024-11-28 02:50:53,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:50:53,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436728765] [2024-11-28 02:50:53,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:50:53,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:50:53,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:50:55,356 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-28 02:50:55,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:50:55,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436728765] [2024-11-28 02:50:55,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436728765] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:50:55,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:50:55,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-28 02:50:55,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898457727] [2024-11-28 02:50:55,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:50:55,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-28 02:50:55,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:50:55,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-28 02:50:55,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2024-11-28 02:50:55,357 INFO L87 Difference]: Start difference. First operand 562 states and 762 transitions. Second operand has 12 states, 11 states have (on average 5.818181818181818) internal successors, (64), 12 states have internal predecessors, (64), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-28 02:50:56,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:50:56,939 INFO L93 Difference]: Finished difference Result 1147 states and 1546 transitions. [2024-11-28 02:50:56,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-28 02:50:56,940 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.818181818181818) internal successors, (64), 12 states have internal predecessors, (64), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) Word has length 161 [2024-11-28 02:50:56,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:50:56,944 INFO L225 Difference]: With dead ends: 1147 [2024-11-28 02:50:56,944 INFO L226 Difference]: Without dead ends: 736 [2024-11-28 02:50:56,945 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2024-11-28 02:50:56,946 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 343 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 617 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-28 02:50:56,946 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 459 Invalid, 704 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 617 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-28 02:50:56,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736 states. [2024-11-28 02:50:57,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 703. [2024-11-28 02:50:57,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 703 states, 621 states have (on average 1.3011272141706924) internal successors, (808), 628 states have internal predecessors, (808), 68 states have call successors, (68), 13 states have call predecessors, (68), 13 states have return successors, (68), 61 states have call predecessors, (68), 68 states have call successors, (68) [2024-11-28 02:50:57,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 703 states and 944 transitions. [2024-11-28 02:50:57,162 INFO L78 Accepts]: Start accepts. Automaton has 703 states and 944 transitions. Word has length 161 [2024-11-28 02:50:57,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:50:57,163 INFO L471 AbstractCegarLoop]: Abstraction has 703 states and 944 transitions. [2024-11-28 02:50:57,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.818181818181818) internal successors, (64), 12 states have internal predecessors, (64), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-28 02:50:57,163 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 944 transitions. [2024-11-28 02:50:57,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-28 02:50:57,164 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:50:57,165 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 02:50:57,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-28 02:50:57,165 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:50:57,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:50:57,166 INFO L85 PathProgramCache]: Analyzing trace with hash -1331071615, now seen corresponding path program 1 times [2024-11-28 02:50:57,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:50:57,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642619595] [2024-11-28 02:50:57,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:50:57,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:50:57,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:51:02,082 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-28 02:51:02,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:51:02,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642619595] [2024-11-28 02:51:02,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642619595] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:51:02,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:51:02,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-28 02:51:02,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409713258] [2024-11-28 02:51:02,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:51:02,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-28 02:51:02,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:51:02,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-28 02:51:02,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2024-11-28 02:51:02,084 INFO L87 Difference]: Start difference. First operand 703 states and 944 transitions. Second operand has 16 states, 14 states have (on average 4.571428571428571) internal successors, (64), 16 states have internal predecessors, (64), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-28 02:51:05,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:51:05,701 INFO L93 Difference]: Finished difference Result 1323 states and 1771 transitions. [2024-11-28 02:51:05,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-28 02:51:05,702 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 4.571428571428571) internal successors, (64), 16 states have internal predecessors, (64), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) Word has length 161 [2024-11-28 02:51:05,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:51:05,706 INFO L225 Difference]: With dead ends: 1323 [2024-11-28 02:51:05,706 INFO L226 Difference]: Without dead ends: 773 [2024-11-28 02:51:05,708 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2024-11-28 02:51:05,710 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 285 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 1169 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 708 SdHoareTripleChecker+Invalid, 1214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 1169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-28 02:51:05,710 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 708 Invalid, 1214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 1169 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-28 02:51:05,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 773 states. [2024-11-28 02:51:05,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 773 to 689. [2024-11-28 02:51:05,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 689 states, 607 states have (on average 1.301482701812191) internal successors, (790), 614 states have internal predecessors, (790), 68 states have call successors, (68), 13 states have call predecessors, (68), 13 states have return successors, (68), 61 states have call predecessors, (68), 68 states have call successors, (68) [2024-11-28 02:51:05,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 689 states and 926 transitions. [2024-11-28 02:51:05,932 INFO L78 Accepts]: Start accepts. Automaton has 689 states and 926 transitions. Word has length 161 [2024-11-28 02:51:05,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:51:05,933 INFO L471 AbstractCegarLoop]: Abstraction has 689 states and 926 transitions. [2024-11-28 02:51:05,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 4.571428571428571) internal successors, (64), 16 states have internal predecessors, (64), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-28 02:51:05,933 INFO L276 IsEmpty]: Start isEmpty. Operand 689 states and 926 transitions. [2024-11-28 02:51:05,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-28 02:51:05,935 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:51:05,935 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 02:51:05,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-28 02:51:05,935 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:51:05,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:51:05,936 INFO L85 PathProgramCache]: Analyzing trace with hash -1783451635, now seen corresponding path program 1 times [2024-11-28 02:51:05,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:51:05,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822134398] [2024-11-28 02:51:05,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:51:05,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:51:06,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:51:10,850 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-28 02:51:10,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:51:10,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822134398] [2024-11-28 02:51:10,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822134398] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:51:10,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:51:10,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-28 02:51:10,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27151350] [2024-11-28 02:51:10,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:51:10,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-28 02:51:10,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:51:10,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-28 02:51:10,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2024-11-28 02:51:10,852 INFO L87 Difference]: Start difference. First operand 689 states and 926 transitions. Second operand has 18 states, 16 states have (on average 4.0) internal successors, (64), 18 states have internal predecessors, (64), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-28 02:51:14,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:51:14,425 INFO L93 Difference]: Finished difference Result 1334 states and 1780 transitions. [2024-11-28 02:51:14,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-28 02:51:14,425 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 4.0) internal successors, (64), 18 states have internal predecessors, (64), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) Word has length 161 [2024-11-28 02:51:14,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:51:14,428 INFO L225 Difference]: With dead ends: 1334 [2024-11-28 02:51:14,428 INFO L226 Difference]: Without dead ends: 794 [2024-11-28 02:51:14,430 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=126, Invalid=524, Unknown=0, NotChecked=0, Total=650 [2024-11-28 02:51:14,430 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 373 mSDsluCounter, 617 mSDsCounter, 0 mSdLazyCounter, 1503 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 725 SdHoareTripleChecker+Invalid, 1569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 1503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-28 02:51:14,431 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [375 Valid, 725 Invalid, 1569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 1503 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-28 02:51:14,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2024-11-28 02:51:14,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 624. [2024-11-28 02:51:14,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 624 states, 548 states have (on average 1.302919708029197) internal successors, (714), 553 states have internal predecessors, (714), 64 states have call successors, (64), 11 states have call predecessors, (64), 11 states have return successors, (64), 59 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-28 02:51:14,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 842 transitions. [2024-11-28 02:51:14,636 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 842 transitions. Word has length 161 [2024-11-28 02:51:14,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:51:14,636 INFO L471 AbstractCegarLoop]: Abstraction has 624 states and 842 transitions. [2024-11-28 02:51:14,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 4.0) internal successors, (64), 18 states have internal predecessors, (64), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-28 02:51:14,636 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 842 transitions. [2024-11-28 02:51:14,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-28 02:51:14,641 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:51:14,641 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 02:51:14,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-28 02:51:14,641 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:51:14,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:51:14,642 INFO L85 PathProgramCache]: Analyzing trace with hash -342703069, now seen corresponding path program 1 times [2024-11-28 02:51:14,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:51:14,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025746147] [2024-11-28 02:51:14,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:51:14,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:51:14,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:51:21,302 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-28 02:51:21,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:51:21,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025746147] [2024-11-28 02:51:21,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025746147] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:51:21,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:51:21,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-28 02:51:21,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313079582] [2024-11-28 02:51:21,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:51:21,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-28 02:51:21,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:51:21,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-28 02:51:21,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2024-11-28 02:51:21,304 INFO L87 Difference]: Start difference. First operand 624 states and 842 transitions. Second operand has 17 states, 14 states have (on average 4.571428571428571) internal successors, (64), 17 states have internal predecessors, (64), 5 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 5 states have call successors, (20) [2024-11-28 02:51:24,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:51:24,203 INFO L93 Difference]: Finished difference Result 1264 states and 1689 transitions. [2024-11-28 02:51:24,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-28 02:51:24,204 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 4.571428571428571) internal successors, (64), 17 states have internal predecessors, (64), 5 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 5 states have call successors, (20) Word has length 161 [2024-11-28 02:51:24,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:51:24,207 INFO L225 Difference]: With dead ends: 1264 [2024-11-28 02:51:24,207 INFO L226 Difference]: Without dead ends: 789 [2024-11-28 02:51:24,209 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=89, Invalid=331, Unknown=0, NotChecked=0, Total=420 [2024-11-28 02:51:24,209 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 377 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 1150 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 1207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 1150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-28 02:51:24,210 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [380 Valid, 602 Invalid, 1207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 1150 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-28 02:51:24,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2024-11-28 02:51:24,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 618. [2024-11-28 02:51:24,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 618 states, 546 states have (on average 1.304029304029304) internal successors, (712), 551 states have internal predecessors, (712), 60 states have call successors, (60), 11 states have call predecessors, (60), 11 states have return successors, (60), 55 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-28 02:51:24,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 832 transitions. [2024-11-28 02:51:24,403 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 832 transitions. Word has length 161 [2024-11-28 02:51:24,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:51:24,403 INFO L471 AbstractCegarLoop]: Abstraction has 618 states and 832 transitions. [2024-11-28 02:51:24,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 4.571428571428571) internal successors, (64), 17 states have internal predecessors, (64), 5 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 5 states have call successors, (20) [2024-11-28 02:51:24,404 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 832 transitions. [2024-11-28 02:51:24,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-28 02:51:24,405 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:51:24,405 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 02:51:24,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-28 02:51:24,406 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:51:24,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:51:24,406 INFO L85 PathProgramCache]: Analyzing trace with hash -762492723, now seen corresponding path program 1 times [2024-11-28 02:51:24,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:51:24,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764441469] [2024-11-28 02:51:24,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:51:24,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:51:24,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:51:28,512 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-28 02:51:28,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:51:28,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764441469] [2024-11-28 02:51:28,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764441469] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:51:28,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:51:28,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-28 02:51:28,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792289057] [2024-11-28 02:51:28,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:51:28,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-28 02:51:28,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:51:28,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-28 02:51:28,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2024-11-28 02:51:28,514 INFO L87 Difference]: Start difference. First operand 618 states and 832 transitions. Second operand has 17 states, 15 states have (on average 4.266666666666667) internal successors, (64), 17 states have internal predecessors, (64), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-28 02:51:31,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:51:31,768 INFO L93 Difference]: Finished difference Result 1180 states and 1576 transitions. [2024-11-28 02:51:31,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-28 02:51:31,769 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 4.266666666666667) internal successors, (64), 17 states have internal predecessors, (64), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) Word has length 161 [2024-11-28 02:51:31,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:51:31,772 INFO L225 Difference]: With dead ends: 1180 [2024-11-28 02:51:31,772 INFO L226 Difference]: Without dead ends: 711 [2024-11-28 02:51:31,773 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=113, Invalid=439, Unknown=0, NotChecked=0, Total=552 [2024-11-28 02:51:31,774 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 211 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 1239 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 648 SdHoareTripleChecker+Invalid, 1270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-28 02:51:31,774 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 648 Invalid, 1270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1239 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-28 02:51:31,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2024-11-28 02:51:31,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 608. [2024-11-28 02:51:31,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 608 states, 536 states have (on average 1.3041044776119404) internal successors, (699), 541 states have internal predecessors, (699), 60 states have call successors, (60), 11 states have call predecessors, (60), 11 states have return successors, (60), 55 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-28 02:51:31,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 819 transitions. [2024-11-28 02:51:31,963 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 819 transitions. Word has length 161 [2024-11-28 02:51:31,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:51:31,965 INFO L471 AbstractCegarLoop]: Abstraction has 608 states and 819 transitions. [2024-11-28 02:51:31,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 4.266666666666667) internal successors, (64), 17 states have internal predecessors, (64), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-28 02:51:31,965 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 819 transitions. [2024-11-28 02:51:31,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-28 02:51:31,968 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:51:31,968 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 02:51:31,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-28 02:51:31,968 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:51:31,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:51:31,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1958119521, now seen corresponding path program 1 times [2024-11-28 02:51:31,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:51:31,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994649990] [2024-11-28 02:51:31,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:51:31,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:51:32,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:51:36,349 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-28 02:51:36,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:51:36,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994649990] [2024-11-28 02:51:36,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994649990] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:51:36,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:51:36,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-28 02:51:36,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826915070] [2024-11-28 02:51:36,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:51:36,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-28 02:51:36,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:51:36,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-28 02:51:36,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2024-11-28 02:51:36,351 INFO L87 Difference]: Start difference. First operand 608 states and 819 transitions. Second operand has 15 states, 13 states have (on average 4.923076923076923) internal successors, (64), 15 states have internal predecessors, (64), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-28 02:51:38,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:51:38,940 INFO L93 Difference]: Finished difference Result 1077 states and 1449 transitions. [2024-11-28 02:51:38,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-28 02:51:38,944 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 4.923076923076923) internal successors, (64), 15 states have internal predecessors, (64), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) Word has length 161 [2024-11-28 02:51:38,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:51:38,947 INFO L225 Difference]: With dead ends: 1077 [2024-11-28 02:51:38,947 INFO L226 Difference]: Without dead ends: 616 [2024-11-28 02:51:38,949 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=123, Invalid=383, Unknown=0, NotChecked=0, Total=506 [2024-11-28 02:51:38,949 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 198 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 878 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 885 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 878 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-28 02:51:38,950 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 536 Invalid, 885 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 878 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-28 02:51:38,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2024-11-28 02:51:39,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 578. [2024-11-28 02:51:39,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 578 states, 506 states have (on average 1.3023715415019763) internal successors, (659), 511 states have internal predecessors, (659), 60 states have call successors, (60), 11 states have call predecessors, (60), 11 states have return successors, (60), 55 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-28 02:51:39,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 779 transitions. [2024-11-28 02:51:39,117 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 779 transitions. Word has length 161 [2024-11-28 02:51:39,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:51:39,117 INFO L471 AbstractCegarLoop]: Abstraction has 578 states and 779 transitions. [2024-11-28 02:51:39,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 4.923076923076923) internal successors, (64), 15 states have internal predecessors, (64), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-28 02:51:39,117 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 779 transitions. [2024-11-28 02:51:39,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-28 02:51:39,119 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:51:39,119 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 02:51:39,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-28 02:51:39,119 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:51:39,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:51:39,120 INFO L85 PathProgramCache]: Analyzing trace with hash 2134954111, now seen corresponding path program 1 times [2024-11-28 02:51:39,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:51:39,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762253661] [2024-11-28 02:51:39,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:51:39,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:51:39,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:51:44,488 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-28 02:51:44,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:51:44,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762253661] [2024-11-28 02:51:44,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762253661] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:51:44,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:51:44,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2024-11-28 02:51:44,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625987682] [2024-11-28 02:51:44,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:51:44,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-28 02:51:44,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:51:44,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-28 02:51:44,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2024-11-28 02:51:44,490 INFO L87 Difference]: Start difference. First operand 578 states and 779 transitions. Second operand has 19 states, 16 states have (on average 4.0) internal successors, (64), 19 states have internal predecessors, (64), 5 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 5 states have call successors, (20) [2024-11-28 02:51:48,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:51:48,489 INFO L93 Difference]: Finished difference Result 1117 states and 1489 transitions. [2024-11-28 02:51:48,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-28 02:51:48,490 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 4.0) internal successors, (64), 19 states have internal predecessors, (64), 5 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 5 states have call successors, (20) Word has length 161 [2024-11-28 02:51:48,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:51:48,492 INFO L225 Difference]: With dead ends: 1117 [2024-11-28 02:51:48,492 INFO L226 Difference]: Without dead ends: 684 [2024-11-28 02:51:48,493 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=142, Invalid=614, Unknown=0, NotChecked=0, Total=756 [2024-11-28 02:51:48,493 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 153 mSDsluCounter, 758 mSDsCounter, 0 mSdLazyCounter, 1583 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 865 SdHoareTripleChecker+Invalid, 1608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-28 02:51:48,494 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 865 Invalid, 1608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1583 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-28 02:51:48,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684 states. [2024-11-28 02:51:48,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 492. [2024-11-28 02:51:48,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 492 states, 426 states have (on average 1.3098591549295775) internal successors, (558), 429 states have internal predecessors, (558), 56 states have call successors, (56), 9 states have call predecessors, (56), 9 states have return successors, (56), 53 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-28 02:51:48,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 670 transitions. [2024-11-28 02:51:48,685 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 670 transitions. Word has length 161 [2024-11-28 02:51:48,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:51:48,686 INFO L471 AbstractCegarLoop]: Abstraction has 492 states and 670 transitions. [2024-11-28 02:51:48,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 4.0) internal successors, (64), 19 states have internal predecessors, (64), 5 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 5 states have call successors, (20) [2024-11-28 02:51:48,686 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 670 transitions. [2024-11-28 02:51:48,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-28 02:51:48,687 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:51:48,687 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 02:51:48,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-28 02:51:48,688 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:51:48,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:51:48,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1092955930, now seen corresponding path program 1 times [2024-11-28 02:51:48,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:51:48,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512819539] [2024-11-28 02:51:48,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:51:48,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:51:48,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:51:48,896 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-28 02:51:48,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:51:48,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512819539] [2024-11-28 02:51:48,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512819539] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:51:48,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1680796025] [2024-11-28 02:51:48,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:51:48,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:51:48,896 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cd99b5b-6820-4803-a9e6-81859ef0faef/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:51:48,899 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cd99b5b-6820-4803-a9e6-81859ef0faef/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:51:48,900 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cd99b5b-6820-4803-a9e6-81859ef0faef/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-28 02:51:49,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:51:49,325 INFO L256 TraceCheckSpWp]: Trace formula consists of 633 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-28 02:51:49,331 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:51:49,390 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-28 02:51:49,391 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 02:51:49,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1680796025] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:51:49,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-28 02:51:49,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2024-11-28 02:51:49,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298952297] [2024-11-28 02:51:49,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:51:49,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 02:51:49,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:51:49,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 02:51:49,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-28 02:51:49,393 INFO L87 Difference]: Start difference. First operand 492 states and 670 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-28 02:51:49,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:51:49,615 INFO L93 Difference]: Finished difference Result 855 states and 1163 transitions. [2024-11-28 02:51:49,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 02:51:49,616 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 162 [2024-11-28 02:51:49,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:51:49,619 INFO L225 Difference]: With dead ends: 855 [2024-11-28 02:51:49,619 INFO L226 Difference]: Without dead ends: 504 [2024-11-28 02:51:49,620 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-28 02:51:49,620 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 535 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-28 02:51:49,620 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 535 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 02:51:49,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2024-11-28 02:51:49,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 504. [2024-11-28 02:51:49,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 438 states have (on average 1.3013698630136987) internal successors, (570), 441 states have internal predecessors, (570), 56 states have call successors, (56), 9 states have call predecessors, (56), 9 states have return successors, (56), 53 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-28 02:51:49,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 682 transitions. [2024-11-28 02:51:49,803 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 682 transitions. Word has length 162 [2024-11-28 02:51:49,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:51:49,804 INFO L471 AbstractCegarLoop]: Abstraction has 504 states and 682 transitions. [2024-11-28 02:51:49,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-28 02:51:49,804 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 682 transitions. [2024-11-28 02:51:49,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-28 02:51:49,805 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:51:49,805 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 02:51:49,817 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cd99b5b-6820-4803-a9e6-81859ef0faef/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-28 02:51:50,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cd99b5b-6820-4803-a9e6-81859ef0faef/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:51:50,006 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:51:50,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:51:50,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1057655491, now seen corresponding path program 1 times [2024-11-28 02:51:50,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:51:50,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622034568] [2024-11-28 02:51:50,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:51:50,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:51:50,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:51:55,196 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-28 02:51:55,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:51:55,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622034568] [2024-11-28 02:51:55,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622034568] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:51:55,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:51:55,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2024-11-28 02:51:55,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549447831] [2024-11-28 02:51:55,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:51:55,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-28 02:51:55,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:51:55,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-28 02:51:55,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=365, Unknown=0, NotChecked=0, Total=420 [2024-11-28 02:51:55,198 INFO L87 Difference]: Start difference. First operand 504 states and 682 transitions. Second operand has 21 states, 19 states have (on average 3.4210526315789473) internal successors, (65), 21 states have internal predecessors, (65), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-28 02:51:59,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:51:59,208 INFO L93 Difference]: Finished difference Result 983 states and 1323 transitions. [2024-11-28 02:51:59,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-28 02:51:59,209 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 3.4210526315789473) internal successors, (65), 21 states have internal predecessors, (65), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) Word has length 162 [2024-11-28 02:51:59,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:51:59,212 INFO L225 Difference]: With dead ends: 983 [2024-11-28 02:51:59,212 INFO L226 Difference]: Without dead ends: 620 [2024-11-28 02:51:59,213 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=157, Invalid=899, Unknown=0, NotChecked=0, Total=1056 [2024-11-28 02:51:59,213 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 241 mSDsluCounter, 872 mSDsCounter, 0 mSdLazyCounter, 1669 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 968 SdHoareTripleChecker+Invalid, 1695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1669 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-28 02:51:59,213 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 968 Invalid, 1695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1669 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-28 02:51:59,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2024-11-28 02:51:59,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 550. [2024-11-28 02:51:59,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 484 states have (on average 1.3099173553719008) internal successors, (634), 487 states have internal predecessors, (634), 56 states have call successors, (56), 9 states have call predecessors, (56), 9 states have return successors, (56), 53 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-28 02:51:59,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 746 transitions. [2024-11-28 02:51:59,353 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 746 transitions. Word has length 162 [2024-11-28 02:51:59,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:51:59,353 INFO L471 AbstractCegarLoop]: Abstraction has 550 states and 746 transitions. [2024-11-28 02:51:59,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 3.4210526315789473) internal successors, (65), 21 states have internal predecessors, (65), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-28 02:51:59,353 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 746 transitions. [2024-11-28 02:51:59,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-28 02:51:59,354 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:51:59,354 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 02:51:59,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-28 02:51:59,354 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:51:59,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:51:59,355 INFO L85 PathProgramCache]: Analyzing trace with hash -222208187, now seen corresponding path program 1 times [2024-11-28 02:51:59,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:51:59,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125738824] [2024-11-28 02:51:59,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:51:59,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:51:59,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:51:59,661 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-28 02:51:59,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:51:59,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125738824] [2024-11-28 02:51:59,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125738824] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:51:59,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:51:59,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 02:51:59,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137759225] [2024-11-28 02:51:59,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:51:59,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 02:51:59,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:51:59,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 02:51:59,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 02:51:59,663 INFO L87 Difference]: Start difference. First operand 550 states and 746 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-28 02:52:00,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:52:00,109 INFO L93 Difference]: Finished difference Result 945 states and 1278 transitions. [2024-11-28 02:52:00,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 02:52:00,109 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 162 [2024-11-28 02:52:00,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:52:00,112 INFO L225 Difference]: With dead ends: 945 [2024-11-28 02:52:00,112 INFO L226 Difference]: Without dead ends: 554 [2024-11-28 02:52:00,112 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-28 02:52:00,113 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 0 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-28 02:52:00,113 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 428 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-28 02:52:00,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2024-11-28 02:52:00,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 550. [2024-11-28 02:52:00,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 484 states have (on average 1.2975206611570247) internal successors, (628), 487 states have internal predecessors, (628), 56 states have call successors, (56), 9 states have call predecessors, (56), 9 states have return successors, (56), 53 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-28 02:52:00,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 740 transitions. [2024-11-28 02:52:00,228 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 740 transitions. Word has length 162 [2024-11-28 02:52:00,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:52:00,228 INFO L471 AbstractCegarLoop]: Abstraction has 550 states and 740 transitions. [2024-11-28 02:52:00,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-28 02:52:00,228 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 740 transitions. [2024-11-28 02:52:00,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-28 02:52:00,229 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:52:00,229 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 02:52:00,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-28 02:52:00,229 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:52:00,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:52:00,230 INFO L85 PathProgramCache]: Analyzing trace with hash -1851108411, now seen corresponding path program 1 times [2024-11-28 02:52:00,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:52:00,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976872107] [2024-11-28 02:52:00,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:52:00,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:52:00,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:52:01,123 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-28 02:52:01,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:52:01,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976872107] [2024-11-28 02:52:01,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976872107] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:52:01,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:52:01,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-28 02:52:01,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567911395] [2024-11-28 02:52:01,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:52:01,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 02:52:01,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:52:01,124 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 02:52:01,124 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-28 02:52:01,124 INFO L87 Difference]: Start difference. First operand 550 states and 740 transitions. Second operand has 7 states, 6 states have (on average 10.833333333333334) internal successors, (65), 7 states have internal predecessors, (65), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-28 02:52:02,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:52:02,058 INFO L93 Difference]: Finished difference Result 931 states and 1245 transitions. [2024-11-28 02:52:02,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-28 02:52:02,058 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 10.833333333333334) internal successors, (65), 7 states have internal predecessors, (65), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) Word has length 162 [2024-11-28 02:52:02,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:52:02,061 INFO L225 Difference]: With dead ends: 931 [2024-11-28 02:52:02,061 INFO L226 Difference]: Without dead ends: 522 [2024-11-28 02:52:02,063 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-28 02:52:02,063 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 101 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-28 02:52:02,064 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 315 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-28 02:52:02,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2024-11-28 02:52:02,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 522. [2024-11-28 02:52:02,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 456 states have (on average 1.280701754385965) internal successors, (584), 459 states have internal predecessors, (584), 56 states have call successors, (56), 9 states have call predecessors, (56), 9 states have return successors, (56), 53 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-28 02:52:02,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 696 transitions. [2024-11-28 02:52:02,185 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 696 transitions. Word has length 162 [2024-11-28 02:52:02,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:52:02,185 INFO L471 AbstractCegarLoop]: Abstraction has 522 states and 696 transitions. [2024-11-28 02:52:02,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 10.833333333333334) internal successors, (65), 7 states have internal predecessors, (65), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-28 02:52:02,185 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 696 transitions. [2024-11-28 02:52:02,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-28 02:52:02,186 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:52:02,186 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 02:52:02,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-28 02:52:02,187 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:52:02,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:52:02,187 INFO L85 PathProgramCache]: Analyzing trace with hash -555389885, now seen corresponding path program 1 times [2024-11-28 02:52:02,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:52:02,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277354220] [2024-11-28 02:52:02,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:52:02,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:52:02,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:52:07,515 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-28 02:52:07,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:52:07,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277354220] [2024-11-28 02:52:07,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277354220] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:52:07,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:52:07,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2024-11-28 02:52:07,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934221192] [2024-11-28 02:52:07,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:52:07,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-28 02:52:07,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:52:07,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-28 02:52:07,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=494, Unknown=0, NotChecked=0, Total=552 [2024-11-28 02:52:07,517 INFO L87 Difference]: Start difference. First operand 522 states and 696 transitions. Second operand has 24 states, 22 states have (on average 2.9545454545454546) internal successors, (65), 24 states have internal predecessors, (65), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-28 02:52:14,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:52:14,916 INFO L93 Difference]: Finished difference Result 1163 states and 1528 transitions. [2024-11-28 02:52:14,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-28 02:52:14,917 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 2.9545454545454546) internal successors, (65), 24 states have internal predecessors, (65), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) Word has length 162 [2024-11-28 02:52:14,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:52:14,921 INFO L225 Difference]: With dead ends: 1163 [2024-11-28 02:52:14,921 INFO L226 Difference]: Without dead ends: 786 [2024-11-28 02:52:14,922 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 433 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=343, Invalid=2107, Unknown=0, NotChecked=0, Total=2450 [2024-11-28 02:52:14,923 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 419 mSDsluCounter, 1328 mSDsCounter, 0 mSdLazyCounter, 2079 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 421 SdHoareTripleChecker+Valid, 1438 SdHoareTripleChecker+Invalid, 2091 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 2079 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-28 02:52:14,923 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [421 Valid, 1438 Invalid, 2091 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 2079 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-28 02:52:14,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 786 states. [2024-11-28 02:52:15,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 786 to 538. [2024-11-28 02:52:15,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 538 states, 472 states have (on average 1.2754237288135593) internal successors, (602), 475 states have internal predecessors, (602), 56 states have call successors, (56), 9 states have call predecessors, (56), 9 states have return successors, (56), 53 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-28 02:52:15,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 714 transitions. [2024-11-28 02:52:15,041 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 714 transitions. Word has length 162 [2024-11-28 02:52:15,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:52:15,041 INFO L471 AbstractCegarLoop]: Abstraction has 538 states and 714 transitions. [2024-11-28 02:52:15,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 2.9545454545454546) internal successors, (65), 24 states have internal predecessors, (65), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-28 02:52:15,041 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 714 transitions. [2024-11-28 02:52:15,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-28 02:52:15,042 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:52:15,042 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 02:52:15,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-28 02:52:15,042 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:52:15,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:52:15,043 INFO L85 PathProgramCache]: Analyzing trace with hash -2097111962, now seen corresponding path program 1 times [2024-11-28 02:52:15,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:52:15,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435916063] [2024-11-28 02:52:15,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:52:15,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:52:15,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:52:21,028 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-28 02:52:21,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:52:21,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435916063] [2024-11-28 02:52:21,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435916063] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:52:21,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:52:21,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2024-11-28 02:52:21,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975638979] [2024-11-28 02:52:21,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:52:21,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-28 02:52:21,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:52:21,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-28 02:52:21,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=398, Unknown=0, NotChecked=0, Total=462 [2024-11-28 02:52:21,030 INFO L87 Difference]: Start difference. First operand 538 states and 714 transitions. Second operand has 22 states, 20 states have (on average 3.3) internal successors, (66), 22 states have internal predecessors, (66), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-28 02:52:25,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:52:25,522 INFO L93 Difference]: Finished difference Result 1003 states and 1322 transitions. [2024-11-28 02:52:25,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-28 02:52:25,523 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 3.3) internal successors, (66), 22 states have internal predecessors, (66), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) Word has length 163 [2024-11-28 02:52:25,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:52:25,525 INFO L225 Difference]: With dead ends: 1003 [2024-11-28 02:52:25,525 INFO L226 Difference]: Without dead ends: 614 [2024-11-28 02:52:25,526 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=184, Invalid=1006, Unknown=0, NotChecked=0, Total=1190 [2024-11-28 02:52:25,526 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 361 mSDsluCounter, 938 mSDsCounter, 0 mSdLazyCounter, 1661 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 1046 SdHoareTripleChecker+Invalid, 1694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-28 02:52:25,526 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [363 Valid, 1046 Invalid, 1694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1661 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-28 02:52:25,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2024-11-28 02:52:25,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 522. [2024-11-28 02:52:25,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 456 states have (on average 1.280701754385965) internal successors, (584), 459 states have internal predecessors, (584), 56 states have call successors, (56), 9 states have call predecessors, (56), 9 states have return successors, (56), 53 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-28 02:52:25,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 696 transitions. [2024-11-28 02:52:25,629 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 696 transitions. Word has length 163 [2024-11-28 02:52:25,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:52:25,630 INFO L471 AbstractCegarLoop]: Abstraction has 522 states and 696 transitions. [2024-11-28 02:52:25,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 3.3) internal successors, (66), 22 states have internal predecessors, (66), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-28 02:52:25,630 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 696 transitions. [2024-11-28 02:52:25,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-28 02:52:25,631 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:52:25,631 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 02:52:25,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-28 02:52:25,631 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:52:25,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:52:25,632 INFO L85 PathProgramCache]: Analyzing trace with hash -1125907354, now seen corresponding path program 1 times [2024-11-28 02:52:25,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:52:25,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026527051] [2024-11-28 02:52:25,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:52:25,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:52:25,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:52:32,208 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-28 02:52:32,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:52:32,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026527051] [2024-11-28 02:52:32,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026527051] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:52:32,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:52:32,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2024-11-28 02:52:32,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757372714] [2024-11-28 02:52:32,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:52:32,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-28 02:52:32,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:52:32,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-28 02:52:32,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=449, Unknown=0, NotChecked=0, Total=506 [2024-11-28 02:52:32,210 INFO L87 Difference]: Start difference. First operand 522 states and 696 transitions. Second operand has 23 states, 21 states have (on average 3.142857142857143) internal successors, (66), 23 states have internal predecessors, (66), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-28 02:52:40,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:52:40,210 INFO L93 Difference]: Finished difference Result 1231 states and 1608 transitions. [2024-11-28 02:52:40,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-28 02:52:40,210 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 3.142857142857143) internal successors, (66), 23 states have internal predecessors, (66), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) Word has length 163 [2024-11-28 02:52:40,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:52:40,213 INFO L225 Difference]: With dead ends: 1231 [2024-11-28 02:52:40,213 INFO L226 Difference]: Without dead ends: 854 [2024-11-28 02:52:40,214 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 320 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=299, Invalid=1593, Unknown=0, NotChecked=0, Total=1892 [2024-11-28 02:52:40,214 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 265 mSDsluCounter, 1886 mSDsCounter, 0 mSdLazyCounter, 2954 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 2048 SdHoareTripleChecker+Invalid, 2965 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2954 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-11-28 02:52:40,215 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 2048 Invalid, 2965 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 2954 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2024-11-28 02:52:40,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 854 states. [2024-11-28 02:52:40,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 854 to 534. [2024-11-28 02:52:40,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 534 states, 468 states have (on average 1.2905982905982907) internal successors, (604), 471 states have internal predecessors, (604), 56 states have call successors, (56), 9 states have call predecessors, (56), 9 states have return successors, (56), 53 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-28 02:52:40,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 716 transitions. [2024-11-28 02:52:40,326 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 716 transitions. Word has length 163 [2024-11-28 02:52:40,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:52:40,326 INFO L471 AbstractCegarLoop]: Abstraction has 534 states and 716 transitions. [2024-11-28 02:52:40,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 3.142857142857143) internal successors, (66), 23 states have internal predecessors, (66), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-28 02:52:40,326 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 716 transitions. [2024-11-28 02:52:40,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-28 02:52:40,327 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:52:40,327 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 02:52:40,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-28 02:52:40,327 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:52:40,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:52:40,328 INFO L85 PathProgramCache]: Analyzing trace with hash -1259920860, now seen corresponding path program 1 times [2024-11-28 02:52:40,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:52:40,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574972123] [2024-11-28 02:52:40,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:52:40,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:52:40,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:52:46,450 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-28 02:52:46,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:52:46,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574972123] [2024-11-28 02:52:46,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574972123] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:52:46,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:52:46,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2024-11-28 02:52:46,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671253066] [2024-11-28 02:52:46,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:52:46,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-28 02:52:46,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:52:46,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-28 02:52:46,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=365, Unknown=0, NotChecked=0, Total=420 [2024-11-28 02:52:46,451 INFO L87 Difference]: Start difference. First operand 534 states and 716 transitions. Second operand has 21 states, 19 states have (on average 3.473684210526316) internal successors, (66), 21 states have internal predecessors, (66), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-28 02:52:51,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:52:51,751 INFO L93 Difference]: Finished difference Result 989 states and 1316 transitions. [2024-11-28 02:52:51,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-28 02:52:51,751 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 3.473684210526316) internal successors, (66), 21 states have internal predecessors, (66), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) Word has length 163 [2024-11-28 02:52:51,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:52:51,755 INFO L225 Difference]: With dead ends: 989 [2024-11-28 02:52:51,755 INFO L226 Difference]: Without dead ends: 606 [2024-11-28 02:52:51,756 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=166, Invalid=956, Unknown=0, NotChecked=0, Total=1122 [2024-11-28 02:52:51,756 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 196 mSDsluCounter, 1017 mSDsCounter, 0 mSdLazyCounter, 1900 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 1126 SdHoareTripleChecker+Invalid, 1908 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1900 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-11-28 02:52:51,756 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 1126 Invalid, 1908 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1900 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-11-28 02:52:51,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2024-11-28 02:52:51,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 502. [2024-11-28 02:52:51,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 502 states, 436 states have (on average 1.2889908256880733) internal successors, (562), 439 states have internal predecessors, (562), 56 states have call successors, (56), 9 states have call predecessors, (56), 9 states have return successors, (56), 53 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-28 02:52:51,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 674 transitions. [2024-11-28 02:52:51,862 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 674 transitions. Word has length 163 [2024-11-28 02:52:51,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:52:51,862 INFO L471 AbstractCegarLoop]: Abstraction has 502 states and 674 transitions. [2024-11-28 02:52:51,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 3.473684210526316) internal successors, (66), 21 states have internal predecessors, (66), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-28 02:52:51,862 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 674 transitions. [2024-11-28 02:52:51,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-28 02:52:51,863 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:52:51,863 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 02:52:51,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-28 02:52:51,864 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:52:51,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:52:51,864 INFO L85 PathProgramCache]: Analyzing trace with hash 1940567467, now seen corresponding path program 1 times [2024-11-28 02:52:51,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:52:51,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543337454] [2024-11-28 02:52:51,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:52:51,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:52:51,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:52:52,124 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-28 02:52:52,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:52:52,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543337454] [2024-11-28 02:52:52,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543337454] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:52:52,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:52:52,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 02:52:52,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791113718] [2024-11-28 02:52:52,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:52:52,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 02:52:52,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:52:52,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 02:52:52,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 02:52:52,126 INFO L87 Difference]: Start difference. First operand 502 states and 674 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-28 02:52:52,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:52:52,537 INFO L93 Difference]: Finished difference Result 1055 states and 1393 transitions. [2024-11-28 02:52:52,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 02:52:52,537 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 164 [2024-11-28 02:52:52,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:52:52,541 INFO L225 Difference]: With dead ends: 1055 [2024-11-28 02:52:52,541 INFO L226 Difference]: Without dead ends: 694 [2024-11-28 02:52:52,542 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-28 02:52:52,542 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 30 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-28 02:52:52,542 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 402 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-28 02:52:52,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2024-11-28 02:52:52,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 624. [2024-11-28 02:52:52,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 624 states, 558 states have (on average 1.2724014336917562) internal successors, (710), 561 states have internal predecessors, (710), 56 states have call successors, (56), 9 states have call predecessors, (56), 9 states have return successors, (56), 53 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-28 02:52:52,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 822 transitions. [2024-11-28 02:52:52,664 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 822 transitions. Word has length 164 [2024-11-28 02:52:52,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:52:52,664 INFO L471 AbstractCegarLoop]: Abstraction has 624 states and 822 transitions. [2024-11-28 02:52:52,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-28 02:52:52,665 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 822 transitions. [2024-11-28 02:52:52,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-28 02:52:52,666 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:52:52,666 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 02:52:52,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-28 02:52:52,666 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:52:52,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:52:52,667 INFO L85 PathProgramCache]: Analyzing trace with hash 362288575, now seen corresponding path program 1 times [2024-11-28 02:52:52,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:52:52,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246555584] [2024-11-28 02:52:52,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:52:52,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:52:52,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 02:52:52,934 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-28 02:52:53,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 02:52:53,331 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-28 02:52:53,332 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-28 02:52:53,333 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-28 02:52:53,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-11-28 02:52:53,339 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:52:53,515 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-28 02:52:53,519 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 02:52:53 BoogieIcfgContainer [2024-11-28 02:52:53,519 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-28 02:52:53,519 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-28 02:52:53,519 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-28 02:52:53,520 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-28 02:52:53,520 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:48:42" (3/4) ... [2024-11-28 02:52:53,525 INFO L149 WitnessPrinter]: No result that supports witness generation found [2024-11-28 02:52:53,526 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-28 02:52:53,527 INFO L158 Benchmark]: Toolchain (without parser) took 252265.17ms. Allocated memory was 117.4MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 91.2MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 391.7MB. Max. memory is 16.1GB. [2024-11-28 02:52:53,527 INFO L158 Benchmark]: CDTParser took 0.46ms. Allocated memory is still 117.4MB. Free memory is still 74.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 02:52:53,530 INFO L158 Benchmark]: CACSL2BoogieTranslator took 331.13ms. Allocated memory is still 117.4MB. Free memory was 91.2MB in the beginning and 75.0MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-28 02:52:53,530 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.80ms. Allocated memory is still 117.4MB. Free memory was 75.0MB in the beginning and 70.9MB in the end (delta: 4.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-28 02:52:53,530 INFO L158 Benchmark]: Boogie Preprocessor took 58.77ms. Allocated memory is still 117.4MB. Free memory was 70.9MB in the beginning and 67.7MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 02:52:53,530 INFO L158 Benchmark]: RCFGBuilder took 956.47ms. Allocated memory is still 117.4MB. Free memory was 67.7MB in the beginning and 84.1MB in the end (delta: -16.3MB). Peak memory consumption was 39.6MB. Max. memory is 16.1GB. [2024-11-28 02:52:53,531 INFO L158 Benchmark]: TraceAbstraction took 250841.04ms. Allocated memory was 117.4MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 83.6MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 377.3MB. Max. memory is 16.1GB. [2024-11-28 02:52:53,531 INFO L158 Benchmark]: Witness Printer took 6.71ms. Allocated memory is still 1.7GB. Free memory was 1.3GB in the beginning and 1.3GB in the end (delta: 240.9kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-28 02:52:53,532 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.46ms. Allocated memory is still 117.4MB. Free memory is still 74.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 331.13ms. Allocated memory is still 117.4MB. Free memory was 91.2MB in the beginning and 75.0MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.80ms. Allocated memory is still 117.4MB. Free memory was 75.0MB in the beginning and 70.9MB in the end (delta: 4.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 58.77ms. Allocated memory is still 117.4MB. Free memory was 70.9MB in the beginning and 67.7MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 956.47ms. Allocated memory is still 117.4MB. Free memory was 67.7MB in the beginning and 84.1MB in the end (delta: -16.3MB). Peak memory consumption was 39.6MB. Max. memory is 16.1GB. * TraceAbstraction took 250841.04ms. Allocated memory was 117.4MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 83.6MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 377.3MB. Max. memory is 16.1GB. * Witness Printer took 6.71ms. Allocated memory is still 1.7GB. Free memory was 1.3GB in the beginning and 1.3GB in the end (delta: 240.9kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 135, overapproximation of someBinaryFLOATComparisonOperation at line 128, overapproximation of someBinaryFLOATComparisonOperation at line 128. Possible FailurePath: [L39] unsigned char isInitial = 0; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 128, 25, 64, 8, 0, 64, 1, 27843, -4, 128, 5, 28020, 128, 10000000000000.926, 1000000.6 }; [L57] unsigned char* WrapperStruct00_var_1_1_Pointer = &(WrapperStruct00.var_1_1); [L58] unsigned char* WrapperStruct00_var_1_4_Pointer = &(WrapperStruct00.var_1_4); [L59] unsigned char* WrapperStruct00_var_1_5_Pointer = &(WrapperStruct00.var_1_5); [L60] unsigned char* WrapperStruct00_var_1_6_Pointer = &(WrapperStruct00.var_1_6); [L61] unsigned char* WrapperStruct00_var_1_7_Pointer = &(WrapperStruct00.var_1_7); [L62] unsigned short int* WrapperStruct00_var_1_8_Pointer = &(WrapperStruct00.var_1_8); [L63] unsigned char* WrapperStruct00_var_1_9_Pointer = &(WrapperStruct00.var_1_9); [L64] unsigned short int* WrapperStruct00_var_1_10_Pointer = &(WrapperStruct00.var_1_10); [L65] signed short int* WrapperStruct00_var_1_11_Pointer = &(WrapperStruct00.var_1_11); [L66] unsigned char* WrapperStruct00_var_1_13_Pointer = &(WrapperStruct00.var_1_13); [L67] unsigned char* WrapperStruct00_var_1_14_Pointer = &(WrapperStruct00.var_1_14); [L68] signed short int* WrapperStruct00_var_1_15_Pointer = &(WrapperStruct00.var_1_15); [L69] signed short int* WrapperStruct00_var_1_16_Pointer = &(WrapperStruct00.var_1_16); [L70] float* WrapperStruct00_var_1_17_Pointer = &(WrapperStruct00.var_1_17); [L71] float* WrapperStruct00_var_1_18_Pointer = &(WrapperStruct00.var_1_18); [L72] unsigned short int last_1_WrapperStruct00_var_1_8 = 64; [L73] signed short int last_1_WrapperStruct00_var_1_11 = -4; VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=0, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L139] isInitial = 1 [L140] FCALL initially() [L142] CALL updateLastVariables() [L131] EXPR WrapperStruct00.var_1_8 [L131] last_1_WrapperStruct00_var_1_8 = WrapperStruct00.var_1_8 [L132] EXPR WrapperStruct00.var_1_11 [L132] last_1_WrapperStruct00_var_1_11 = WrapperStruct00.var_1_11 [L142] RET updateLastVariables() [L143] CALL updateVariables() [L99] WrapperStruct00.var_1_4 = __VERIFIER_nondet_uchar() [L100] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L100] CALL assume_abort_if_not(WrapperStruct00.var_1_4 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L100] RET assume_abort_if_not(WrapperStruct00.var_1_4 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L101] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L101] CALL assume_abort_if_not(WrapperStruct00.var_1_4 <= 127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L101] RET assume_abort_if_not(WrapperStruct00.var_1_4 <= 127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L102] WrapperStruct00.var_1_5 = __VERIFIER_nondet_uchar() [L103] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L103] CALL assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L103] RET assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L104] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L104] CALL assume_abort_if_not(WrapperStruct00.var_1_5 <= 127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L104] RET assume_abort_if_not(WrapperStruct00.var_1_5 <= 127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L105] WrapperStruct00.var_1_6 = __VERIFIER_nondet_uchar() [L106] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L106] CALL assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L106] RET assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L107] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L107] CALL assume_abort_if_not(WrapperStruct00.var_1_6 <= 127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L107] RET assume_abort_if_not(WrapperStruct00.var_1_6 <= 127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L108] WrapperStruct00.var_1_7 = __VERIFIER_nondet_uchar() [L109] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L109] CALL assume_abort_if_not(WrapperStruct00.var_1_7 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L109] RET assume_abort_if_not(WrapperStruct00.var_1_7 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L110] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L110] CALL assume_abort_if_not(WrapperStruct00.var_1_7 <= 127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L110] RET assume_abort_if_not(WrapperStruct00.var_1_7 <= 127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L111] WrapperStruct00.var_1_9 = __VERIFIER_nondet_uchar() [L112] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L112] CALL assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L112] RET assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L113] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L113] CALL assume_abort_if_not(WrapperStruct00.var_1_9 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L113] RET assume_abort_if_not(WrapperStruct00.var_1_9 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L114] WrapperStruct00.var_1_10 = __VERIFIER_nondet_ushort() [L115] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L115] CALL assume_abort_if_not(WrapperStruct00.var_1_10 >= 16383) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L115] RET assume_abort_if_not(WrapperStruct00.var_1_10 >= 16383) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L116] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L116] CALL assume_abort_if_not(WrapperStruct00.var_1_10 <= 32767) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L116] RET assume_abort_if_not(WrapperStruct00.var_1_10 <= 32767) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L117] WrapperStruct00.var_1_13 = __VERIFIER_nondet_uchar() [L118] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L118] CALL assume_abort_if_not(WrapperStruct00.var_1_13 >= 127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L118] RET assume_abort_if_not(WrapperStruct00.var_1_13 >= 127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L119] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L119] CALL assume_abort_if_not(WrapperStruct00.var_1_13 <= 255) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L119] RET assume_abort_if_not(WrapperStruct00.var_1_13 <= 255) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L120] WrapperStruct00.var_1_14 = __VERIFIER_nondet_uchar() [L121] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L121] CALL assume_abort_if_not(WrapperStruct00.var_1_14 >= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L121] RET assume_abort_if_not(WrapperStruct00.var_1_14 >= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L122] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L122] CALL assume_abort_if_not(WrapperStruct00.var_1_14 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L122] RET assume_abort_if_not(WrapperStruct00.var_1_14 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L123] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L123] CALL assume_abort_if_not(WrapperStruct00.var_1_14 != 127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L123] RET assume_abort_if_not(WrapperStruct00.var_1_14 != 127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L124] WrapperStruct00.var_1_15 = __VERIFIER_nondet_short() [L125] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L125] CALL assume_abort_if_not(WrapperStruct00.var_1_15 >= 16383) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L125] RET assume_abort_if_not(WrapperStruct00.var_1_15 >= 16383) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L126] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L126] CALL assume_abort_if_not(WrapperStruct00.var_1_15 <= 32766) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L126] RET assume_abort_if_not(WrapperStruct00.var_1_15 <= 32766) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L127] WrapperStruct00.var_1_18 = __VERIFIER_nondet_float() [L128] EXPR WrapperStruct00.var_1_18 [L128] EXPR WrapperStruct00.var_1_18 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_18 <= -1.0e-20F [L128] EXPR WrapperStruct00.var_1_18 [L128] EXPR WrapperStruct00.var_1_18 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_18 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L128] EXPR (WrapperStruct00.var_1_18 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_18 <= -1.0e-20F) || (WrapperStruct00.var_1_18 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_18 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L128] CALL assume_abort_if_not((WrapperStruct00.var_1_18 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_18 <= -1.0e-20F) || (WrapperStruct00.var_1_18 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_18 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L128] RET assume_abort_if_not((WrapperStruct00.var_1_18 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_18 <= -1.0e-20F) || (WrapperStruct00.var_1_18 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_18 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L143] RET updateVariables() [L144] CALL step() [L77] signed long int stepLocal_0 = last_1_WrapperStruct00_var_1_11; VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64, stepLocal_0=-4] [L78] COND TRUE stepLocal_0 != last_1_WrapperStruct00_var_1_8 [L79] EXPR \read(*WrapperStruct00_var_1_4_Pointer) [L79] EXPR \read(*WrapperStruct00_var_1_5_Pointer) [L79] EXPR \read(*WrapperStruct00_var_1_6_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L79] EXPR (((*(WrapperStruct00_var_1_5_Pointer))) < ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_6_Pointer))) [L79] EXPR \read(*WrapperStruct00_var_1_5_Pointer) [L79] EXPR (((*(WrapperStruct00_var_1_5_Pointer))) < ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_6_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L79] EXPR \read(*WrapperStruct00_var_1_7_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L79] EXPR (((((((*(WrapperStruct00_var_1_5_Pointer))) < ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_6_Pointer)))))) > ((*(WrapperStruct00_var_1_7_Pointer)))) ? ((((((*(WrapperStruct00_var_1_5_Pointer))) < ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_6_Pointer)))))) : ((*(WrapperStruct00_var_1_7_Pointer))) [L79] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L79] EXPR (((((((*(WrapperStruct00_var_1_5_Pointer))) < ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_6_Pointer)))))) > ((*(WrapperStruct00_var_1_7_Pointer)))) ? ((((((*(WrapperStruct00_var_1_5_Pointer))) < ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_6_Pointer)))))) : ((*(WrapperStruct00_var_1_7_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L79] (*(WrapperStruct00_var_1_1_Pointer)) = ((*(WrapperStruct00_var_1_4_Pointer)) + (((((((((*(WrapperStruct00_var_1_5_Pointer))) < ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_6_Pointer)))))) > ((*(WrapperStruct00_var_1_7_Pointer)))) ? ((((((*(WrapperStruct00_var_1_5_Pointer))) < ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_6_Pointer)))))) : ((*(WrapperStruct00_var_1_7_Pointer)))))) [L83] EXPR \read(*WrapperStruct00_var_1_9_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L83] COND TRUE (*(WrapperStruct00_var_1_9_Pointer)) [L84] EXPR \read(*WrapperStruct00_var_1_10_Pointer) [L84] EXPR \read(*WrapperStruct00_var_1_6_Pointer) [L84] (*(WrapperStruct00_var_1_8_Pointer)) = (((*(WrapperStruct00_var_1_10_Pointer)) + 23103) - (32 + (*(WrapperStruct00_var_1_6_Pointer)))) [L86] EXPR \read(*WrapperStruct00_var_1_5_Pointer) [L86] EXPR \read(*WrapperStruct00_var_1_10_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L86] COND TRUE ! ((*(WrapperStruct00_var_1_5_Pointer)) > (*(WrapperStruct00_var_1_10_Pointer))) [L87] (*(WrapperStruct00_var_1_16_Pointer)) = (32 - 8) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L91] EXPR \read(*WrapperStruct00_var_1_18_Pointer) [L91] (*(WrapperStruct00_var_1_17_Pointer)) = (*(WrapperStruct00_var_1_18_Pointer)) [L92] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L92] EXPR \read(*WrapperStruct00_var_1_16_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L92] COND FALSE !((*(WrapperStruct00_var_1_1_Pointer)) < (*(WrapperStruct00_var_1_16_Pointer))) [L144] RET step() [L145] CALL, EXPR property() [L135] EXPR (last_1_WrapperStruct00_var_1_11 != last_1_WrapperStruct00_var_1_8) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_4_Pointer)) + (((((((((*(WrapperStruct00_var_1_5_Pointer))) < ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_6_Pointer)))))) > ((*(WrapperStruct00_var_1_7_Pointer)))) ? ((((((*(WrapperStruct00_var_1_5_Pointer))) < ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_6_Pointer)))))) : ((*(WrapperStruct00_var_1_7_Pointer)))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_4_Pointer)))) [L135] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L135] EXPR \read(*WrapperStruct00_var_1_4_Pointer) [L135] EXPR \read(*WrapperStruct00_var_1_5_Pointer) [L135] EXPR \read(*WrapperStruct00_var_1_6_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L135] EXPR (((*(WrapperStruct00_var_1_5_Pointer))) < ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_6_Pointer))) [L135] EXPR \read(*WrapperStruct00_var_1_5_Pointer) [L135] EXPR (((*(WrapperStruct00_var_1_5_Pointer))) < ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_6_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L135] EXPR \read(*WrapperStruct00_var_1_7_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L135] EXPR (((((((*(WrapperStruct00_var_1_5_Pointer))) < ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_6_Pointer)))))) > ((*(WrapperStruct00_var_1_7_Pointer)))) ? ((((((*(WrapperStruct00_var_1_5_Pointer))) < ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_6_Pointer)))))) : ((*(WrapperStruct00_var_1_7_Pointer))) [L135] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L135] EXPR (((((((*(WrapperStruct00_var_1_5_Pointer))) < ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_6_Pointer)))))) > ((*(WrapperStruct00_var_1_7_Pointer)))) ? ((((((*(WrapperStruct00_var_1_5_Pointer))) < ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_6_Pointer)))))) : ((*(WrapperStruct00_var_1_7_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L135] EXPR (last_1_WrapperStruct00_var_1_11 != last_1_WrapperStruct00_var_1_8) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_4_Pointer)) + (((((((((*(WrapperStruct00_var_1_5_Pointer))) < ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_6_Pointer)))))) > ((*(WrapperStruct00_var_1_7_Pointer)))) ? ((((((*(WrapperStruct00_var_1_5_Pointer))) < ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_6_Pointer)))))) : ((*(WrapperStruct00_var_1_7_Pointer)))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_4_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L135] EXPR ((last_1_WrapperStruct00_var_1_11 != last_1_WrapperStruct00_var_1_8) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_4_Pointer)) + (((((((((*(WrapperStruct00_var_1_5_Pointer))) < ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_6_Pointer)))))) > ((*(WrapperStruct00_var_1_7_Pointer)))) ? ((((((*(WrapperStruct00_var_1_5_Pointer))) < ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_6_Pointer)))))) : ((*(WrapperStruct00_var_1_7_Pointer)))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_4_Pointer))))) && ((*(WrapperStruct00_var_1_9_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned short int) (((*(WrapperStruct00_var_1_10_Pointer)) + 23103) - (32 + (*(WrapperStruct00_var_1_6_Pointer)))))) : 1) [L135] EXPR \read(*WrapperStruct00_var_1_9_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L135] EXPR (*(WrapperStruct00_var_1_9_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned short int) (((*(WrapperStruct00_var_1_10_Pointer)) + 23103) - (32 + (*(WrapperStruct00_var_1_6_Pointer)))))) : 1 [L135] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L135] EXPR \read(*WrapperStruct00_var_1_10_Pointer) [L135] EXPR \read(*WrapperStruct00_var_1_6_Pointer) [L135] EXPR (*(WrapperStruct00_var_1_9_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned short int) (((*(WrapperStruct00_var_1_10_Pointer)) + 23103) - (32 + (*(WrapperStruct00_var_1_6_Pointer)))))) : 1 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L135] EXPR ((last_1_WrapperStruct00_var_1_11 != last_1_WrapperStruct00_var_1_8) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_4_Pointer)) + (((((((((*(WrapperStruct00_var_1_5_Pointer))) < ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_6_Pointer)))))) > ((*(WrapperStruct00_var_1_7_Pointer)))) ? ((((((*(WrapperStruct00_var_1_5_Pointer))) < ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_6_Pointer)))))) : ((*(WrapperStruct00_var_1_7_Pointer)))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_4_Pointer))))) && ((*(WrapperStruct00_var_1_9_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned short int) (((*(WrapperStruct00_var_1_10_Pointer)) + 23103) - (32 + (*(WrapperStruct00_var_1_6_Pointer)))))) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L135] EXPR (((last_1_WrapperStruct00_var_1_11 != last_1_WrapperStruct00_var_1_8) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_4_Pointer)) + (((((((((*(WrapperStruct00_var_1_5_Pointer))) < ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_6_Pointer)))))) > ((*(WrapperStruct00_var_1_7_Pointer)))) ? ((((((*(WrapperStruct00_var_1_5_Pointer))) < ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_6_Pointer)))))) : ((*(WrapperStruct00_var_1_7_Pointer)))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_4_Pointer))))) && ((*(WrapperStruct00_var_1_9_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned short int) (((*(WrapperStruct00_var_1_10_Pointer)) + 23103) - (32 + (*(WrapperStruct00_var_1_6_Pointer)))))) : 1)) && (((*(WrapperStruct00_var_1_1_Pointer)) < (*(WrapperStruct00_var_1_16_Pointer))) ? ((((- 8) / ((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_14_Pointer)))) >= (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((signed short int) ((*(WrapperStruct00_var_1_16_Pointer)) - ((*(WrapperStruct00_var_1_15_Pointer)) - (*(WrapperStruct00_var_1_14_Pointer)))))) : 1) : 1) [L135] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L135] EXPR \read(*WrapperStruct00_var_1_16_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L135] EXPR ((*(WrapperStruct00_var_1_1_Pointer)) < (*(WrapperStruct00_var_1_16_Pointer))) ? ((((- 8) / ((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_14_Pointer)))) >= (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((signed short int) ((*(WrapperStruct00_var_1_16_Pointer)) - ((*(WrapperStruct00_var_1_15_Pointer)) - (*(WrapperStruct00_var_1_14_Pointer)))))) : 1) : 1 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L135] EXPR (((last_1_WrapperStruct00_var_1_11 != last_1_WrapperStruct00_var_1_8) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_4_Pointer)) + (((((((((*(WrapperStruct00_var_1_5_Pointer))) < ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_6_Pointer)))))) > ((*(WrapperStruct00_var_1_7_Pointer)))) ? ((((((*(WrapperStruct00_var_1_5_Pointer))) < ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_6_Pointer)))))) : ((*(WrapperStruct00_var_1_7_Pointer)))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_4_Pointer))))) && ((*(WrapperStruct00_var_1_9_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned short int) (((*(WrapperStruct00_var_1_10_Pointer)) + 23103) - (32 + (*(WrapperStruct00_var_1_6_Pointer)))))) : 1)) && (((*(WrapperStruct00_var_1_1_Pointer)) < (*(WrapperStruct00_var_1_16_Pointer))) ? ((((- 8) / ((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_14_Pointer)))) >= (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((signed short int) ((*(WrapperStruct00_var_1_16_Pointer)) - ((*(WrapperStruct00_var_1_15_Pointer)) - (*(WrapperStruct00_var_1_14_Pointer)))))) : 1) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L135] EXPR ((((last_1_WrapperStruct00_var_1_11 != last_1_WrapperStruct00_var_1_8) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_4_Pointer)) + (((((((((*(WrapperStruct00_var_1_5_Pointer))) < ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_6_Pointer)))))) > ((*(WrapperStruct00_var_1_7_Pointer)))) ? ((((((*(WrapperStruct00_var_1_5_Pointer))) < ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_6_Pointer)))))) : ((*(WrapperStruct00_var_1_7_Pointer)))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_4_Pointer))))) && ((*(WrapperStruct00_var_1_9_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned short int) (((*(WrapperStruct00_var_1_10_Pointer)) + 23103) - (32 + (*(WrapperStruct00_var_1_6_Pointer)))))) : 1)) && (((*(WrapperStruct00_var_1_1_Pointer)) < (*(WrapperStruct00_var_1_16_Pointer))) ? ((((- 8) / ((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_14_Pointer)))) >= (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((signed short int) ((*(WrapperStruct00_var_1_16_Pointer)) - ((*(WrapperStruct00_var_1_15_Pointer)) - (*(WrapperStruct00_var_1_14_Pointer)))))) : 1) : 1)) && ((! ((*(WrapperStruct00_var_1_5_Pointer)) > (*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_16_Pointer)) == ((signed short int) (32 - 8))) : ((*(WrapperStruct00_var_1_16_Pointer)) == ((signed short int) ((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_4_Pointer)))))) [L135] EXPR \read(*WrapperStruct00_var_1_5_Pointer) [L135] EXPR \read(*WrapperStruct00_var_1_10_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L135] EXPR (! ((*(WrapperStruct00_var_1_5_Pointer)) > (*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_16_Pointer)) == ((signed short int) (32 - 8))) : ((*(WrapperStruct00_var_1_16_Pointer)) == ((signed short int) ((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_4_Pointer))))) [L135] EXPR \read(*WrapperStruct00_var_1_16_Pointer) [L135] EXPR (! ((*(WrapperStruct00_var_1_5_Pointer)) > (*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_16_Pointer)) == ((signed short int) (32 - 8))) : ((*(WrapperStruct00_var_1_16_Pointer)) == ((signed short int) ((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_4_Pointer))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L135] EXPR ((((last_1_WrapperStruct00_var_1_11 != last_1_WrapperStruct00_var_1_8) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_4_Pointer)) + (((((((((*(WrapperStruct00_var_1_5_Pointer))) < ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_6_Pointer)))))) > ((*(WrapperStruct00_var_1_7_Pointer)))) ? ((((((*(WrapperStruct00_var_1_5_Pointer))) < ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_6_Pointer)))))) : ((*(WrapperStruct00_var_1_7_Pointer)))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_4_Pointer))))) && ((*(WrapperStruct00_var_1_9_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned short int) (((*(WrapperStruct00_var_1_10_Pointer)) + 23103) - (32 + (*(WrapperStruct00_var_1_6_Pointer)))))) : 1)) && (((*(WrapperStruct00_var_1_1_Pointer)) < (*(WrapperStruct00_var_1_16_Pointer))) ? ((((- 8) / ((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_14_Pointer)))) >= (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((signed short int) ((*(WrapperStruct00_var_1_16_Pointer)) - ((*(WrapperStruct00_var_1_15_Pointer)) - (*(WrapperStruct00_var_1_14_Pointer)))))) : 1) : 1)) && ((! ((*(WrapperStruct00_var_1_5_Pointer)) > (*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_16_Pointer)) == ((signed short int) (32 - 8))) : ((*(WrapperStruct00_var_1_16_Pointer)) == ((signed short int) ((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_4_Pointer)))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L135] EXPR (((((last_1_WrapperStruct00_var_1_11 != last_1_WrapperStruct00_var_1_8) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_4_Pointer)) + (((((((((*(WrapperStruct00_var_1_5_Pointer))) < ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_6_Pointer)))))) > ((*(WrapperStruct00_var_1_7_Pointer)))) ? ((((((*(WrapperStruct00_var_1_5_Pointer))) < ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_6_Pointer)))))) : ((*(WrapperStruct00_var_1_7_Pointer)))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_4_Pointer))))) && ((*(WrapperStruct00_var_1_9_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned short int) (((*(WrapperStruct00_var_1_10_Pointer)) + 23103) - (32 + (*(WrapperStruct00_var_1_6_Pointer)))))) : 1)) && (((*(WrapperStruct00_var_1_1_Pointer)) < (*(WrapperStruct00_var_1_16_Pointer))) ? ((((- 8) / ((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_14_Pointer)))) >= (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((signed short int) ((*(WrapperStruct00_var_1_16_Pointer)) - ((*(WrapperStruct00_var_1_15_Pointer)) - (*(WrapperStruct00_var_1_14_Pointer)))))) : 1) : 1)) && ((! ((*(WrapperStruct00_var_1_5_Pointer)) > (*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_16_Pointer)) == ((signed short int) (32 - 8))) : ((*(WrapperStruct00_var_1_16_Pointer)) == ((signed short int) ((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_4_Pointer))))))) && ((*(WrapperStruct00_var_1_17_Pointer)) == ((float) (*(WrapperStruct00_var_1_18_Pointer)))) [L135] EXPR \read(*WrapperStruct00_var_1_17_Pointer) [L135] EXPR \read(*WrapperStruct00_var_1_18_Pointer) [L135] EXPR (((((last_1_WrapperStruct00_var_1_11 != last_1_WrapperStruct00_var_1_8) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_4_Pointer)) + (((((((((*(WrapperStruct00_var_1_5_Pointer))) < ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_6_Pointer)))))) > ((*(WrapperStruct00_var_1_7_Pointer)))) ? ((((((*(WrapperStruct00_var_1_5_Pointer))) < ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_6_Pointer)))))) : ((*(WrapperStruct00_var_1_7_Pointer)))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_4_Pointer))))) && ((*(WrapperStruct00_var_1_9_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned short int) (((*(WrapperStruct00_var_1_10_Pointer)) + 23103) - (32 + (*(WrapperStruct00_var_1_6_Pointer)))))) : 1)) && (((*(WrapperStruct00_var_1_1_Pointer)) < (*(WrapperStruct00_var_1_16_Pointer))) ? ((((- 8) / ((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_14_Pointer)))) >= (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((signed short int) ((*(WrapperStruct00_var_1_16_Pointer)) - ((*(WrapperStruct00_var_1_15_Pointer)) - (*(WrapperStruct00_var_1_14_Pointer)))))) : 1) : 1)) && ((! ((*(WrapperStruct00_var_1_5_Pointer)) > (*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_16_Pointer)) == ((signed short int) (32 - 8))) : ((*(WrapperStruct00_var_1_16_Pointer)) == ((signed short int) ((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_4_Pointer))))))) && ((*(WrapperStruct00_var_1_17_Pointer)) == ((float) (*(WrapperStruct00_var_1_18_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L135-L136] return (((((last_1_WrapperStruct00_var_1_11 != last_1_WrapperStruct00_var_1_8) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_4_Pointer)) + (((((((((*(WrapperStruct00_var_1_5_Pointer))) < ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_6_Pointer)))))) > ((*(WrapperStruct00_var_1_7_Pointer)))) ? ((((((*(WrapperStruct00_var_1_5_Pointer))) < ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_6_Pointer)))))) : ((*(WrapperStruct00_var_1_7_Pointer)))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_4_Pointer))))) && ((*(WrapperStruct00_var_1_9_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned short int) (((*(WrapperStruct00_var_1_10_Pointer)) + 23103) - (32 + (*(WrapperStruct00_var_1_6_Pointer)))))) : 1)) && (((*(WrapperStruct00_var_1_1_Pointer)) < (*(WrapperStruct00_var_1_16_Pointer))) ? ((((- 8) / ((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_14_Pointer)))) >= (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((signed short int) ((*(WrapperStruct00_var_1_16_Pointer)) - ((*(WrapperStruct00_var_1_15_Pointer)) - (*(WrapperStruct00_var_1_14_Pointer)))))) : 1) : 1)) && ((! ((*(WrapperStruct00_var_1_5_Pointer)) > (*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_16_Pointer)) == ((signed short int) (32 - 8))) : ((*(WrapperStruct00_var_1_16_Pointer)) == ((signed short int) ((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_4_Pointer))))))) && ((*(WrapperStruct00_var_1_17_Pointer)) == ((float) (*(WrapperStruct00_var_1_18_Pointer)))) ; [L145] RET, EXPR property() [L145] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] [L19] reach_error() VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:12}, WrapperStruct00_var_1_14_Pointer={4:13}, WrapperStruct00_var_1_15_Pointer={4:14}, WrapperStruct00_var_1_16_Pointer={4:16}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:5}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_11=-4, last_1_WrapperStruct00_var_1_8=64] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 103 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 250.6s, OverallIterations: 37, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 101.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8311 SdHoareTripleChecker+Valid, 65.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8257 mSDsluCounter, 24362 SdHoareTripleChecker+Invalid, 60.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 20370 mSDsCounter, 941 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 36732 IncrementalHoareTripleChecker+Invalid, 37673 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 941 mSolverCounterUnsat, 3992 mSDtfsCounter, 36732 mSolverCounterSat, 0.4s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1409 GetRequests, 689 SyntacticMatches, 30 SemanticMatches, 690 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3681 ImplicationChecksByTransitivity, 51.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=703occurred in iteration=21, InterpolantAutomatonStates: 428, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.9s AutomataMinimizationTime, 36 MinimizatonAttempts, 2494 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 4.9s SatisfiabilityAnalysisTime, 137.0s InterpolantComputationTime, 6235 NumberOfCodeBlocks, 6235 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 6033 ConstructedInterpolants, 0 QuantifiedInterpolants, 125233 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1218 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 38 InterpolantComputations, 36 PerfectInterpolantSequences, 28785/28880 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, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-28 02:52:53,748 WARN L435 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cd99b5b-6820-4803-a9e6-81859ef0faef/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2024-11-28 02:52:53,774 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cd99b5b-6820-4803-a9e6-81859ef0faef/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 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/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cd99b5b-6820-4803-a9e6-81859ef0faef/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cd99b5b-6820-4803-a9e6-81859ef0faef/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cd99b5b-6820-4803-a9e6-81859ef0faef/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cd99b5b-6820-4803-a9e6-81859ef0faef/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-84.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cd99b5b-6820-4803-a9e6-81859ef0faef/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cd99b5b-6820-4803-a9e6-81859ef0faef/bin/uautomizer-verify-aQ6SnzHsRB --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 645cc8cd2ca5c3df18e88a30b2b1ec0d9c7b704a87e37ccd990a4988acc7530a --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 02:52:56,496 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 02:52:56,641 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cd99b5b-6820-4803-a9e6-81859ef0faef/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-28 02:52:56,651 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 02:52:56,654 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 02:52:56,691 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 02:52:56,692 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 02:52:56,692 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 02:52:56,693 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 02:52:56,693 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 02:52:56,694 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 02:52:56,694 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 02:52:56,695 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 02:52:56,695 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 02:52:56,695 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 02:52:56,695 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 02:52:56,695 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-28 02:52:56,695 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 02:52:56,695 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 02:52:56,697 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 02:52:56,697 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-28 02:52:56,697 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 02:52:56,697 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-28 02:52:56,697 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-28 02:52:56,697 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-28 02:52:56,697 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-28 02:52:56,697 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 02:52:56,698 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-28 02:52:56,698 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 02:52:56,698 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 02:52:56,698 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 02:52:56,698 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 02:52:56,698 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 02:52:56,698 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 02:52:56,698 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 02:52:56,698 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 02:52:56,698 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 02:52:56,699 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 02:52:56,699 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 02:52:56,699 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 02:52:56,699 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 02:52:56,699 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 02:52:56,699 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-28 02:52:56,699 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-28 02:52:56,699 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-28 02:52:56,699 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-28 02:52:56,699 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 02:52:56,699 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 02:52:56,699 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 02:52:56,699 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 02:52:56,699 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_9cd99b5b-6820-4803-a9e6-81859ef0faef/bin/uautomizer-verify-aQ6SnzHsRB 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 -> 645cc8cd2ca5c3df18e88a30b2b1ec0d9c7b704a87e37ccd990a4988acc7530a [2024-11-28 02:52:57,033 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 02:52:57,043 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 02:52:57,048 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 02:52:57,050 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 02:52:57,051 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 02:52:57,052 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cd99b5b-6820-4803-a9e6-81859ef0faef/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-84.i [2024-11-28 02:53:00,329 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cd99b5b-6820-4803-a9e6-81859ef0faef/bin/uautomizer-verify-aQ6SnzHsRB/data/d3a0fc1a0/c10b51fd89be48c499012fd5f9c20260/FLAGb4a044fbd [2024-11-28 02:53:00,678 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 02:53:00,680 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cd99b5b-6820-4803-a9e6-81859ef0faef/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-84.i [2024-11-28 02:53:00,695 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cd99b5b-6820-4803-a9e6-81859ef0faef/bin/uautomizer-verify-aQ6SnzHsRB/data/d3a0fc1a0/c10b51fd89be48c499012fd5f9c20260/FLAGb4a044fbd [2024-11-28 02:53:00,719 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cd99b5b-6820-4803-a9e6-81859ef0faef/bin/uautomizer-verify-aQ6SnzHsRB/data/d3a0fc1a0/c10b51fd89be48c499012fd5f9c20260 [2024-11-28 02:53:00,722 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 02:53:00,725 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 02:53:00,728 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 02:53:00,728 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 02:53:00,735 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 02:53:00,736 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:53:00" (1/1) ... [2024-11-28 02:53:00,739 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38f625c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:53:00, skipping insertion in model container [2024-11-28 02:53:00,739 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:53:00" (1/1) ... [2024-11-28 02:53:00,767 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 02:53:00,971 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_9cd99b5b-6820-4803-a9e6-81859ef0faef/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-84.i[917,930] [2024-11-28 02:53:01,100 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 02:53:01,131 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 02:53:01,151 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_9cd99b5b-6820-4803-a9e6-81859ef0faef/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-84.i[917,930] [2024-11-28 02:53:01,251 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 02:53:01,291 INFO L204 MainTranslator]: Completed translation [2024-11-28 02:53:01,291 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:53:01 WrapperNode [2024-11-28 02:53:01,292 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 02:53:01,294 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 02:53:01,295 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 02:53:01,295 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 02:53:01,304 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:53:01" (1/1) ... [2024-11-28 02:53:01,324 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:53:01" (1/1) ... [2024-11-28 02:53:01,375 INFO L138 Inliner]: procedures = 34, calls = 154, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 436 [2024-11-28 02:53:01,376 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 02:53:01,377 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 02:53:01,377 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 02:53:01,377 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 02:53:01,387 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:53:01" (1/1) ... [2024-11-28 02:53:01,388 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:53:01" (1/1) ... [2024-11-28 02:53:01,399 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:53:01" (1/1) ... [2024-11-28 02:53:01,445 INFO L175 MemorySlicer]: Split 123 memory accesses to 2 slices as follows [2, 121]. 98 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 33 writes are split as follows [0, 33]. [2024-11-28 02:53:01,449 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:53:01" (1/1) ... [2024-11-28 02:53:01,449 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:53:01" (1/1) ... [2024-11-28 02:53:01,482 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:53:01" (1/1) ... [2024-11-28 02:53:01,488 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:53:01" (1/1) ... [2024-11-28 02:53:01,495 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:53:01" (1/1) ... [2024-11-28 02:53:01,504 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:53:01" (1/1) ... [2024-11-28 02:53:01,511 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:53:01" (1/1) ... [2024-11-28 02:53:01,521 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 02:53:01,522 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 02:53:01,526 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 02:53:01,526 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 02:53:01,527 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:53:01" (1/1) ... [2024-11-28 02:53:01,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 02:53:01,557 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cd99b5b-6820-4803-a9e6-81859ef0faef/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:53:01,573 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cd99b5b-6820-4803-a9e6-81859ef0faef/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-28 02:53:01,579 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cd99b5b-6820-4803-a9e6-81859ef0faef/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-28 02:53:01,612 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 02:53:01,612 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-28 02:53:01,612 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-28 02:53:01,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-28 02:53:01,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-28 02:53:01,613 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-28 02:53:01,613 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-28 02:53:01,613 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-28 02:53:01,613 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-28 02:53:01,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-28 02:53:01,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-28 02:53:01,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2024-11-28 02:53:01,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2024-11-28 02:53:01,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2024-11-28 02:53:01,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2024-11-28 02:53:01,614 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-28 02:53:01,614 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-28 02:53:01,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2024-11-28 02:53:01,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2024-11-28 02:53:01,614 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 02:53:01,615 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 02:53:01,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-28 02:53:01,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-28 02:53:01,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-28 02:53:01,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-28 02:53:01,812 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 02:53:01,815 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 02:53:02,940 INFO L? ?]: Removed 98 outVars from TransFormulas that were not future-live. [2024-11-28 02:53:02,945 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 02:53:02,957 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 02:53:02,958 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-28 02:53:02,958 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:53:02 BoogieIcfgContainer [2024-11-28 02:53:02,958 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 02:53:02,961 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 02:53:02,961 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 02:53:02,968 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 02:53:02,969 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 02:53:00" (1/3) ... [2024-11-28 02:53:02,969 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b7a64ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:53:02, skipping insertion in model container [2024-11-28 02:53:02,970 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:53:01" (2/3) ... [2024-11-28 02:53:02,970 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b7a64ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:53:02, skipping insertion in model container [2024-11-28 02:53:02,970 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:53:02" (3/3) ... [2024-11-28 02:53:02,971 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-84.i [2024-11-28 02:53:02,988 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 02:53:02,989 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-sp_file-84.i that has 2 procedures, 103 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-28 02:53:03,062 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 02:53:03,078 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;@5886e816, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 02:53:03,080 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-28 02:53:03,084 INFO L276 IsEmpty]: Start isEmpty. Operand has 103 states, 80 states have (on average 1.35) internal successors, (108), 81 states have internal predecessors, (108), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-28 02:53:03,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-28 02:53:03,097 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:53:03,097 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 02:53:03,098 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:53:03,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:53:03,104 INFO L85 PathProgramCache]: Analyzing trace with hash 557809999, now seen corresponding path program 1 times [2024-11-28 02:53:03,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 02:53:03,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [884019090] [2024-11-28 02:53:03,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:53:03,122 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-28 02:53:03,122 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cd99b5b-6820-4803-a9e6-81859ef0faef/bin/uautomizer-verify-aQ6SnzHsRB/mathsat [2024-11-28 02:53:03,127 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cd99b5b-6820-4803-a9e6-81859ef0faef/bin/uautomizer-verify-aQ6SnzHsRB/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-28 02:53:03,128 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cd99b5b-6820-4803-a9e6-81859ef0faef/bin/uautomizer-verify-aQ6SnzHsRB/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-28 02:53:03,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:53:03,674 INFO L256 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-28 02:53:03,683 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:53:03,730 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 390 proven. 0 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2024-11-28 02:53:03,730 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 02:53:03,731 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 02:53:03,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [884019090] [2024-11-28 02:53:03,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [884019090] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:53:03,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:53:03,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 02:53:03,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384867431] [2024-11-28 02:53:03,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:53:03,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-28 02:53:03,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 02:53:03,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-28 02:53:03,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-28 02:53:03,763 INFO L87 Difference]: Start difference. First operand has 103 states, 80 states have (on average 1.35) internal successors, (108), 81 states have internal predecessors, (108), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-28 02:53:03,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:53:03,794 INFO L93 Difference]: Finished difference Result 199 states and 310 transitions. [2024-11-28 02:53:03,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-28 02:53:03,796 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 150 [2024-11-28 02:53:03,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:53:03,803 INFO L225 Difference]: With dead ends: 199 [2024-11-28 02:53:03,803 INFO L226 Difference]: Without dead ends: 99 [2024-11-28 02:53:03,807 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 149 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-28 02:53:03,813 INFO L435 NwaCegarLoop]: 141 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, 141 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-28 02:53:03,813 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 02:53:03,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-28 02:53:03,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-11-28 02:53:03,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 77 states have (on average 1.3116883116883118) internal successors, (101), 77 states have internal predecessors, (101), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-28 02:53:03,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 141 transitions. [2024-11-28 02:53:03,863 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 141 transitions. Word has length 150 [2024-11-28 02:53:03,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:53:03,863 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 141 transitions. [2024-11-28 02:53:03,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-28 02:53:03,864 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 141 transitions. [2024-11-28 02:53:03,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-28 02:53:03,867 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:53:03,868 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 02:53:03,877 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cd99b5b-6820-4803-a9e6-81859ef0faef/bin/uautomizer-verify-aQ6SnzHsRB/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-28 02:53:04,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cd99b5b-6820-4803-a9e6-81859ef0faef/bin/uautomizer-verify-aQ6SnzHsRB/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-28 02:53:04,069 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:53:04,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:53:04,070 INFO L85 PathProgramCache]: Analyzing trace with hash 665716147, now seen corresponding path program 1 times [2024-11-28 02:53:04,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 02:53:04,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1806524487] [2024-11-28 02:53:04,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:53:04,071 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-28 02:53:04,071 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cd99b5b-6820-4803-a9e6-81859ef0faef/bin/uautomizer-verify-aQ6SnzHsRB/mathsat [2024-11-28 02:53:04,075 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cd99b5b-6820-4803-a9e6-81859ef0faef/bin/uautomizer-verify-aQ6SnzHsRB/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-28 02:53:04,076 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cd99b5b-6820-4803-a9e6-81859ef0faef/bin/uautomizer-verify-aQ6SnzHsRB/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-28 02:53:04,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:53:04,531 INFO L256 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-28 02:53:04,538 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:53:04,643 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-28 02:53:04,643 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 02:53:04,644 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 02:53:04,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1806524487] [2024-11-28 02:53:04,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1806524487] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:53:04,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:53:04,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 02:53:04,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793238548] [2024-11-28 02:53:04,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:53:04,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 02:53:04,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 02:53:04,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 02:53:04,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-28 02:53:04,649 INFO L87 Difference]: Start difference. First operand 99 states and 141 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-28 02:53:04,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:53:04,834 INFO L93 Difference]: Finished difference Result 202 states and 289 transitions. [2024-11-28 02:53:04,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 02:53:04,837 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 150 [2024-11-28 02:53:04,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:53:04,841 INFO L225 Difference]: With dead ends: 202 [2024-11-28 02:53:04,842 INFO L226 Difference]: Without dead ends: 106 [2024-11-28 02:53:04,843 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 145 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-28 02:53:04,846 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 1 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 653 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 02:53:04,846 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 653 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 02:53:04,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-28 02:53:04,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2024-11-28 02:53:04,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 83 states have (on average 1.2891566265060241) internal successors, (107), 83 states have internal predecessors, (107), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-28 02:53:04,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 147 transitions. [2024-11-28 02:53:04,875 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 147 transitions. Word has length 150 [2024-11-28 02:53:04,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:53:04,877 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 147 transitions. [2024-11-28 02:53:04,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-28 02:53:04,878 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 147 transitions. [2024-11-28 02:53:04,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-28 02:53:04,881 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:53:04,881 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 02:53:04,890 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cd99b5b-6820-4803-a9e6-81859ef0faef/bin/uautomizer-verify-aQ6SnzHsRB/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-28 02:53:05,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cd99b5b-6820-4803-a9e6-81859ef0faef/bin/uautomizer-verify-aQ6SnzHsRB/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-28 02:53:05,085 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:53:05,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:53:05,086 INFO L85 PathProgramCache]: Analyzing trace with hash 667563189, now seen corresponding path program 1 times [2024-11-28 02:53:05,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 02:53:05,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [52075024] [2024-11-28 02:53:05,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:53:05,087 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-28 02:53:05,087 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cd99b5b-6820-4803-a9e6-81859ef0faef/bin/uautomizer-verify-aQ6SnzHsRB/mathsat [2024-11-28 02:53:05,089 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cd99b5b-6820-4803-a9e6-81859ef0faef/bin/uautomizer-verify-aQ6SnzHsRB/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-28 02:53:05,091 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cd99b5b-6820-4803-a9e6-81859ef0faef/bin/uautomizer-verify-aQ6SnzHsRB/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-28 02:53:05,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:53:05,657 INFO L256 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-28 02:53:05,670 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:53:05,734 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 85 treesize of output 84 [2024-11-28 02:53:06,067 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 153 treesize of output 129 [2024-11-28 02:53:06,693 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-28 02:53:06,696 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 02:53:06,696 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 02:53:06,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [52075024] [2024-11-28 02:53:06,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [52075024] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:53:06,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:53:06,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 02:53:06,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131183008] [2024-11-28 02:53:06,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:53:06,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 02:53:06,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 02:53:06,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 02:53:06,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 02:53:06,699 INFO L87 Difference]: Start difference. First operand 105 states and 147 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-28 02:53:08,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:53:08,967 INFO L93 Difference]: Finished difference Result 314 states and 439 transitions. [2024-11-28 02:53:08,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 02:53:08,969 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 150 [2024-11-28 02:53:08,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:53:08,972 INFO L225 Difference]: With dead ends: 314 [2024-11-28 02:53:08,972 INFO L226 Difference]: Without dead ends: 212 [2024-11-28 02:53:08,973 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-28 02:53:08,974 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 75 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-28 02:53:08,975 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 477 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-28 02:53:08,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2024-11-28 02:53:09,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 177. [2024-11-28 02:53:09,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 133 states have (on average 1.255639097744361) internal successors, (167), 133 states have internal predecessors, (167), 40 states have call successors, (40), 3 states have call predecessors, (40), 3 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-28 02:53:09,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 247 transitions. [2024-11-28 02:53:09,037 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 247 transitions. Word has length 150 [2024-11-28 02:53:09,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:53:09,037 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 247 transitions. [2024-11-28 02:53:09,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-28 02:53:09,038 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 247 transitions. [2024-11-28 02:53:09,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-28 02:53:09,040 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:53:09,040 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 02:53:09,056 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cd99b5b-6820-4803-a9e6-81859ef0faef/bin/uautomizer-verify-aQ6SnzHsRB/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-28 02:53:09,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cd99b5b-6820-4803-a9e6-81859ef0faef/bin/uautomizer-verify-aQ6SnzHsRB/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-28 02:53:09,245 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:53:09,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:53:09,246 INFO L85 PathProgramCache]: Analyzing trace with hash -329940525, now seen corresponding path program 1 times [2024-11-28 02:53:09,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 02:53:09,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [384602679] [2024-11-28 02:53:09,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:53:09,247 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-28 02:53:09,247 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cd99b5b-6820-4803-a9e6-81859ef0faef/bin/uautomizer-verify-aQ6SnzHsRB/mathsat [2024-11-28 02:53:09,249 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cd99b5b-6820-4803-a9e6-81859ef0faef/bin/uautomizer-verify-aQ6SnzHsRB/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-28 02:53:09,251 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cd99b5b-6820-4803-a9e6-81859ef0faef/bin/uautomizer-verify-aQ6SnzHsRB/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-28 02:53:09,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:53:09,928 INFO L256 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 55 conjuncts are in the unsatisfiable core [2024-11-28 02:53:09,960 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:53:10,711 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-28 02:53:12,489 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 21 treesize of output 20 [2024-11-28 02:53:14,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 31 [2024-11-28 02:53:15,821 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-28 02:53:17,335 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 53 [2024-11-28 02:53:18,970 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 53 treesize of output 64 [2024-11-28 02:53:20,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 67 [2024-11-28 02:53:22,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 75 [2024-11-28 02:53:24,556 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 86 [2024-11-28 02:53:26,045 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 36 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 89 [2024-11-28 02:53:28,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 36 disjoint index pairs (out of 36 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 104 [2024-11-28 02:53:28,523 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 45 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 108 [2024-11-28 02:53:28,945 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 45 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 109 [2024-11-28 02:53:29,209 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 45 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 109 [2024-11-28 02:53:29,856 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:53:29,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 36 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 107 treesize of output 59 [2024-11-28 02:53:30,127 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 624 proven. 76 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-28 02:53:30,128 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:54:08,883 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 02:54:08,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [384602679] [2024-11-28 02:54:08,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [384602679] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:54:08,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [104887040] [2024-11-28 02:54:08,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:54:08,883 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-28 02:54:08,884 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cd99b5b-6820-4803-a9e6-81859ef0faef/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 [2024-11-28 02:54:08,886 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cd99b5b-6820-4803-a9e6-81859ef0faef/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-28 02:54:08,887 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cd99b5b-6820-4803-a9e6-81859ef0faef/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2024-11-28 02:54:10,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:54:10,421 INFO L256 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 63 conjuncts are in the unsatisfiable core [2024-11-28 02:54:10,432 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:54:11,467 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-28 02:54:15,218 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2024-11-28 02:54:17,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2024-11-28 02:54:19,871 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2024-11-28 02:54:23,825 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 43 [2024-11-28 02:54:26,623 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 46 [2024-11-28 02:54:28,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2024-11-28 02:54:31,914 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 65 [2024-11-28 02:54:36,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 76 [2024-11-28 02:54:39,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 79 [2024-11-28 02:54:44,020 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 94 [2024-11-28 02:54:44,960 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 36 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 97 [2024-11-28 02:54:46,002 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 36 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 98 [2024-11-28 02:54:46,790 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 36 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 98 [2024-11-28 02:54:48,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 103 treesize of output 55 [2024-11-28 02:54:49,260 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 513 proven. 157 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2024-11-28 02:54:49,260 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 02:55:08,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [104887040] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:55:08,009 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 02:55:08,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 27] total 45 [2024-11-28 02:55:08,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771089761] [2024-11-28 02:55:08,010 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 02:55:08,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2024-11-28 02:55:08,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 02:55:08,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2024-11-28 02:55:08,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=328, Invalid=2748, Unknown=4, NotChecked=0, Total=3080 [2024-11-28 02:55:08,018 INFO L87 Difference]: Start difference. First operand 177 states and 247 transitions. Second operand has 46 states, 44 states have (on average 3.590909090909091) internal successors, (158), 43 states have internal predecessors, (158), 18 states have call successors, (40), 16 states have call predecessors, (40), 18 states have return successors, (40), 18 states have call predecessors, (40), 18 states have call successors, (40) [2024-11-28 02:56:17,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:56:17,553 INFO L93 Difference]: Finished difference Result 492 states and 641 transitions. [2024-11-28 02:56:17,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2024-11-28 02:56:17,555 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 44 states have (on average 3.590909090909091) internal successors, (158), 43 states have internal predecessors, (158), 18 states have call successors, (40), 16 states have call predecessors, (40), 18 states have return successors, (40), 18 states have call predecessors, (40), 18 states have call successors, (40) Word has length 158 [2024-11-28 02:56:17,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:56:17,559 INFO L225 Difference]: With dead ends: 492 [2024-11-28 02:56:17,559 INFO L226 Difference]: Without dead ends: 390 [2024-11-28 02:56:17,563 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 432 GetRequests, 321 SyntacticMatches, 3 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3512 ImplicationChecksByTransitivity, 104.7s TimeCoverageRelationStatistics Valid=1814, Invalid=10172, Unknown=4, NotChecked=0, Total=11990 [2024-11-28 02:56:17,564 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 1447 mSDsluCounter, 1186 mSDsCounter, 0 mSdLazyCounter, 2434 mSolverCounterSat, 339 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 34.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1448 SdHoareTripleChecker+Valid, 1273 SdHoareTripleChecker+Invalid, 2773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 339 IncrementalHoareTripleChecker+Valid, 2434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 35.6s IncrementalHoareTripleChecker+Time [2024-11-28 02:56:17,564 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1448 Valid, 1273 Invalid, 2773 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [339 Valid, 2434 Invalid, 0 Unknown, 0 Unchecked, 35.6s Time] [2024-11-28 02:56:17,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2024-11-28 02:56:17,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 326. [2024-11-28 02:56:17,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 252 states have (on average 1.2301587301587302) internal successors, (310), 253 states have internal predecessors, (310), 57 states have call successors, (57), 16 states have call predecessors, (57), 16 states have return successors, (57), 56 states have call predecessors, (57), 57 states have call successors, (57) [2024-11-28 02:56:17,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 424 transitions. [2024-11-28 02:56:17,677 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 424 transitions. Word has length 158 [2024-11-28 02:56:17,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:56:17,678 INFO L471 AbstractCegarLoop]: Abstraction has 326 states and 424 transitions. [2024-11-28 02:56:17,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 44 states have (on average 3.590909090909091) internal successors, (158), 43 states have internal predecessors, (158), 18 states have call successors, (40), 16 states have call predecessors, (40), 18 states have return successors, (40), 18 states have call predecessors, (40), 18 states have call successors, (40) [2024-11-28 02:56:17,678 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 424 transitions. [2024-11-28 02:56:17,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-28 02:56:17,681 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:56:17,681 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 02:56:17,692 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cd99b5b-6820-4803-a9e6-81859ef0faef/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (6)] Ended with exit code 0 [2024-11-28 02:56:17,888 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cd99b5b-6820-4803-a9e6-81859ef0faef/bin/uautomizer-verify-aQ6SnzHsRB/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-28 02:56:18,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cd99b5b-6820-4803-a9e6-81859ef0faef/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cd99b5b-6820-4803-a9e6-81859ef0faef/bin/uautomizer-verify-aQ6SnzHsRB/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-28 02:56:18,082 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:56:18,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:56:18,083 INFO L85 PathProgramCache]: Analyzing trace with hash 645833076, now seen corresponding path program 1 times [2024-11-28 02:56:18,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 02:56:18,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1088612987] [2024-11-28 02:56:18,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:56:18,084 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-28 02:56:18,084 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cd99b5b-6820-4803-a9e6-81859ef0faef/bin/uautomizer-verify-aQ6SnzHsRB/mathsat [2024-11-28 02:56:18,088 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cd99b5b-6820-4803-a9e6-81859ef0faef/bin/uautomizer-verify-aQ6SnzHsRB/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-28 02:56:18,090 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cd99b5b-6820-4803-a9e6-81859ef0faef/bin/uautomizer-verify-aQ6SnzHsRB/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-28 02:56:18,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:56:18,671 INFO L256 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 72 conjuncts are in the unsatisfiable core [2024-11-28 02:56:18,685 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:56:19,758 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-28 02:56:23,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2024-11-28 02:56:25,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 31 [2024-11-28 02:56:28,528 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-28 02:56:32,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 50 [2024-11-28 02:56:35,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 58 [2024-11-28 02:56:38,714 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 65 treesize of output 61 [2024-11-28 02:56:41,612 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 65 treesize of output 61 [2024-11-28 02:56:46,211 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 65 treesize of output 61 [2024-11-28 02:56:49,354 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 65 treesize of output 61 [2024-11-28 02:56:54,231 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 76 [2024-11-28 02:56:55,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 75 [2024-11-28 02:56:56,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 83 [2024-11-28 02:56:56,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 86 [2024-11-28 02:56:58,232 INFO L349 Elim1Store]: treesize reduction 228, result has 15.9 percent of original size [2024-11-28 02:56:58,233 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 28 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 17 case distinctions, treesize of input 121 treesize of output 156 [2024-11-28 02:57:11,691 WARN L286 SmtUtils]: Spent 9.32s on a formula simplification that was a NOOP. DAG size: 567 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-28 02:57:11,692 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 02:57:11,693 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 17 select indices, 17 select index equivalence classes, 28 disjoint index pairs (out of 136 index pairs), introduced 17 new quantified variables, introduced 136 case distinctions, treesize of input 377 treesize of output 1521