./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-34.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 803cd42f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-34.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 4ff4fe5bed554c7ec6fbe4f6b5cd49cac5ee3ddab40bbec1d152ed8b04a5b8b9 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 12:54:56,569 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 12:54:56,641 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-22 12:54:56,647 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 12:54:56,647 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 12:54:56,676 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 12:54:56,677 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 12:54:56,678 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 12:54:56,678 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 12:54:56,679 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 12:54:56,680 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 12:54:56,680 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 12:54:56,680 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 12:54:56,681 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 12:54:56,682 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 12:54:56,683 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 12:54:56,683 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 12:54:56,683 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 12:54:56,683 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 12:54:56,684 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 12:54:56,684 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 12:54:56,685 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 12:54:56,686 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 12:54:56,687 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 12:54:56,687 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 12:54:56,688 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 12:54:56,688 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 12:54:56,688 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 12:54:56,688 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 12:54:56,688 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 12:54:56,689 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 12:54:56,690 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 12:54:56,690 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 12:54:56,690 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 12:54:56,690 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 12:54:56,691 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 12:54:56,691 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 12:54:56,691 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 12:54:56,691 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 12:54:56,691 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 12:54:56,692 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 12:54:56,694 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 12:54:56,694 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 4ff4fe5bed554c7ec6fbe4f6b5cd49cac5ee3ddab40bbec1d152ed8b04a5b8b9 [2024-11-22 12:54:56,909 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 12:54:56,931 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 12:54:56,934 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 12:54:56,935 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 12:54:56,935 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 12:54:56,936 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-34.i [2024-11-22 12:54:58,182 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 12:54:58,372 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 12:54:58,373 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-34.i [2024-11-22 12:54:58,383 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff9f15f18/4af3e6fa17804676ab092a2cb84ff27b/FLAG575693af8 [2024-11-22 12:54:58,744 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff9f15f18/4af3e6fa17804676ab092a2cb84ff27b [2024-11-22 12:54:58,746 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 12:54:58,748 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 12:54:58,749 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 12:54:58,749 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 12:54:58,755 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 12:54:58,756 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 12:54:58" (1/1) ... [2024-11-22 12:54:58,756 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f6476f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:54:58, skipping insertion in model container [2024-11-22 12:54:58,756 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 12:54:58" (1/1) ... [2024-11-22 12:54:58,781 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 12:54:58,932 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-34.i[916,929] [2024-11-22 12:54:58,999 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 12:54:59,021 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 12:54:59,034 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-34.i[916,929] [2024-11-22 12:54:59,063 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 12:54:59,081 INFO L204 MainTranslator]: Completed translation [2024-11-22 12:54:59,081 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:54:59 WrapperNode [2024-11-22 12:54:59,081 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 12:54:59,082 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 12:54:59,082 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 12:54:59,083 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 12:54:59,088 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:54:59" (1/1) ... [2024-11-22 12:54:59,100 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:54:59" (1/1) ... [2024-11-22 12:54:59,132 INFO L138 Inliner]: procedures = 29, calls = 165, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 481 [2024-11-22 12:54:59,133 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 12:54:59,133 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 12:54:59,133 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 12:54:59,134 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 12:54:59,148 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:54:59" (1/1) ... [2024-11-22 12:54:59,148 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:54:59" (1/1) ... [2024-11-22 12:54:59,152 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:54:59" (1/1) ... [2024-11-22 12:54:59,173 INFO L175 MemorySlicer]: Split 115 memory accesses to 17 slices as follows [2, 7, 6, 8, 14, 6, 6, 6, 6, 5, 6, 6, 8, 6, 8, 6, 9]. 12 percent of accesses are in the largest equivalence class. The 18 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 18 writes are split as follows [0, 1, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1]. [2024-11-22 12:54:59,174 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:54:59" (1/1) ... [2024-11-22 12:54:59,174 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:54:59" (1/1) ... [2024-11-22 12:54:59,195 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:54:59" (1/1) ... [2024-11-22 12:54:59,198 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:54:59" (1/1) ... [2024-11-22 12:54:59,206 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:54:59" (1/1) ... [2024-11-22 12:54:59,210 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:54:59" (1/1) ... [2024-11-22 12:54:59,218 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 12:54:59,219 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 12:54:59,219 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 12:54:59,219 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 12:54:59,220 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:54:59" (1/1) ... [2024-11-22 12:54:59,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 12:54:59,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 12:54:59,259 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-22 12:54:59,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-22 12:54:59,309 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 12:54:59,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-22 12:54:59,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-22 12:54:59,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-22 12:54:59,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-22 12:54:59,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-22 12:54:59,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-22 12:54:59,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-11-22 12:54:59,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-11-22 12:54:59,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2024-11-22 12:54:59,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2024-11-22 12:54:59,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2024-11-22 12:54:59,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2024-11-22 12:54:59,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2024-11-22 12:54:59,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2024-11-22 12:54:59,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2024-11-22 12:54:59,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2024-11-22 12:54:59,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2024-11-22 12:54:59,312 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-22 12:54:59,312 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-22 12:54:59,312 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-22 12:54:59,312 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-22 12:54:59,313 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-22 12:54:59,313 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-11-22 12:54:59,313 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2024-11-22 12:54:59,313 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2024-11-22 12:54:59,313 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#8 [2024-11-22 12:54:59,313 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#9 [2024-11-22 12:54:59,313 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#10 [2024-11-22 12:54:59,313 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#11 [2024-11-22 12:54:59,313 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#12 [2024-11-22 12:54:59,313 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#13 [2024-11-22 12:54:59,313 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#14 [2024-11-22 12:54:59,314 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#15 [2024-11-22 12:54:59,314 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#16 [2024-11-22 12:54:59,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-22 12:54:59,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-22 12:54:59,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-22 12:54:59,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-22 12:54:59,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-11-22 12:54:59,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-11-22 12:54:59,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2024-11-22 12:54:59,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2024-11-22 12:54:59,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#8 [2024-11-22 12:54:59,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#9 [2024-11-22 12:54:59,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#10 [2024-11-22 12:54:59,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#11 [2024-11-22 12:54:59,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#12 [2024-11-22 12:54:59,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#13 [2024-11-22 12:54:59,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#14 [2024-11-22 12:54:59,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#15 [2024-11-22 12:54:59,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#16 [2024-11-22 12:54:59,318 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-22 12:54:59,319 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-22 12:54:59,319 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-22 12:54:59,319 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-22 12:54:59,319 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-22 12:54:59,319 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-22 12:54:59,319 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-11-22 12:54:59,319 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-11-22 12:54:59,319 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2024-11-22 12:54:59,320 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2024-11-22 12:54:59,321 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2024-11-22 12:54:59,321 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2024-11-22 12:54:59,321 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2024-11-22 12:54:59,321 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2024-11-22 12:54:59,321 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2024-11-22 12:54:59,321 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2024-11-22 12:54:59,322 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2024-11-22 12:54:59,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-22 12:54:59,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-22 12:54:59,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-22 12:54:59,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-22 12:54:59,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-22 12:54:59,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-11-22 12:54:59,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2024-11-22 12:54:59,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2024-11-22 12:54:59,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#8 [2024-11-22 12:54:59,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#9 [2024-11-22 12:54:59,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#10 [2024-11-22 12:54:59,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#11 [2024-11-22 12:54:59,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#12 [2024-11-22 12:54:59,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#13 [2024-11-22 12:54:59,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#14 [2024-11-22 12:54:59,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#15 [2024-11-22 12:54:59,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#16 [2024-11-22 12:54:59,324 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-22 12:54:59,324 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-22 12:54:59,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-22 12:54:59,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-22 12:54:59,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-22 12:54:59,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-22 12:54:59,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-22 12:54:59,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-22 12:54:59,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-11-22 12:54:59,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-11-22 12:54:59,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-11-22 12:54:59,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-11-22 12:54:59,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-11-22 12:54:59,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-11-22 12:54:59,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-11-22 12:54:59,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-11-22 12:54:59,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2024-11-22 12:54:59,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2024-11-22 12:54:59,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2024-11-22 12:54:59,325 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 12:54:59,325 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 12:54:59,525 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 12:54:59,527 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 12:54:59,918 INFO L? ?]: Removed 89 outVars from TransFormulas that were not future-live. [2024-11-22 12:54:59,918 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 12:54:59,933 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 12:54:59,933 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-22 12:54:59,933 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:54:59 BoogieIcfgContainer [2024-11-22 12:54:59,933 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 12:54:59,935 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 12:54:59,935 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 12:54:59,938 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 12:54:59,938 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 12:54:58" (1/3) ... [2024-11-22 12:54:59,939 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a85845a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 12:54:59, skipping insertion in model container [2024-11-22 12:54:59,939 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:54:59" (2/3) ... [2024-11-22 12:54:59,939 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a85845a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 12:54:59, skipping insertion in model container [2024-11-22 12:54:59,939 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:54:59" (3/3) ... [2024-11-22 12:54:59,940 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-34.i [2024-11-22 12:54:59,954 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 12:54:59,955 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-22 12:55:00,013 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 12:55:00,021 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;@7e244a69, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 12:55:00,022 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-22 12:55:00,028 INFO L276 IsEmpty]: Start isEmpty. Operand has 120 states, 94 states have (on average 1.372340425531915) internal successors, (129), 95 states have internal predecessors, (129), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-22 12:55:00,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-22 12:55:00,041 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:55:00,042 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:55:00,043 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:55:00,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:55:00,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1856483357, now seen corresponding path program 1 times [2024-11-22 12:55:00,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:55:00,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709341846] [2024-11-22 12:55:00,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:55:00,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:55:00,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:55:00,381 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2024-11-22 12:55:00,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:55:00,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709341846] [2024-11-22 12:55:00,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709341846] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 12:55:00,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1440916322] [2024-11-22 12:55:00,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:55:00,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 12:55:00,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 12:55:00,389 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 12:55:00,391 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-22 12:55:00,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:55:00,679 INFO L255 TraceCheckSpWp]: Trace formula consists of 690 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-22 12:55:00,708 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:55:00,761 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2024-11-22 12:55:00,763 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 12:55:00,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1440916322] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:55:00,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 12:55:00,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-22 12:55:00,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875803255] [2024-11-22 12:55:00,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:55:00,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-22 12:55:00,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:55:00,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-22 12:55:00,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 12:55:00,794 INFO L87 Difference]: Start difference. First operand has 120 states, 94 states have (on average 1.372340425531915) internal successors, (129), 95 states have internal predecessors, (129), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-22 12:55:00,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:55:00,819 INFO L93 Difference]: Finished difference Result 233 states and 367 transitions. [2024-11-22 12:55:00,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-22 12:55:00,822 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 171 [2024-11-22 12:55:00,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:55:00,828 INFO L225 Difference]: With dead ends: 233 [2024-11-22 12:55:00,829 INFO L226 Difference]: Without dead ends: 116 [2024-11-22 12:55:00,832 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 172 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-22 12:55:00,835 INFO L432 NwaCegarLoop]: 168 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, 168 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-22 12:55:00,836 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 12:55:00,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-22 12:55:00,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2024-11-22 12:55:00,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 91 states have (on average 1.3406593406593406) internal successors, (122), 91 states have internal predecessors, (122), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-22 12:55:00,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 168 transitions. [2024-11-22 12:55:00,891 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 168 transitions. Word has length 171 [2024-11-22 12:55:00,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:55:00,892 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 168 transitions. [2024-11-22 12:55:00,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-22 12:55:00,892 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 168 transitions. [2024-11-22 12:55:00,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-22 12:55:00,898 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:55:00,898 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:55:00,906 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-22 12:55:01,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-22 12:55:01,099 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:55:01,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:55:01,100 INFO L85 PathProgramCache]: Analyzing trace with hash 95317121, now seen corresponding path program 1 times [2024-11-22 12:55:01,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:55:01,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432596383] [2024-11-22 12:55:01,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:55:01,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:55:01,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:55:01,349 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-22 12:55:01,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:55:01,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432596383] [2024-11-22 12:55:01,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432596383] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:55:01,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:55:01,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 12:55:01,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234075492] [2024-11-22 12:55:01,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:55:01,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 12:55:01,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:55:01,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 12:55:01,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 12:55:01,357 INFO L87 Difference]: Start difference. First operand 116 states and 168 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-22 12:55:01,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:55:01,385 INFO L93 Difference]: Finished difference Result 230 states and 335 transitions. [2024-11-22 12:55:01,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 12:55:01,386 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 171 [2024-11-22 12:55:01,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:55:01,388 INFO L225 Difference]: With dead ends: 230 [2024-11-22 12:55:01,388 INFO L226 Difference]: Without dead ends: 117 [2024-11-22 12:55:01,389 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 12:55:01,391 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 0 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 12:55:01,391 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 328 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 12:55:01,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-11-22 12:55:01,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2024-11-22 12:55:01,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 92 states have (on average 1.3369565217391304) internal successors, (123), 92 states have internal predecessors, (123), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-22 12:55:01,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 169 transitions. [2024-11-22 12:55:01,403 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 169 transitions. Word has length 171 [2024-11-22 12:55:01,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:55:01,408 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 169 transitions. [2024-11-22 12:55:01,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-22 12:55:01,410 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 169 transitions. [2024-11-22 12:55:01,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-22 12:55:01,415 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:55:01,415 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:55:01,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-22 12:55:01,415 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:55:01,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:55:01,416 INFO L85 PathProgramCache]: Analyzing trace with hash -722331329, now seen corresponding path program 1 times [2024-11-22 12:55:01,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:55:01,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740108271] [2024-11-22 12:55:01,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:55:01,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:55:01,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:55:01,706 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-22 12:55:01,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:55:01,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740108271] [2024-11-22 12:55:01,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740108271] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 12:55:01,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [497070339] [2024-11-22 12:55:01,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:55:01,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 12:55:01,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 12:55:01,712 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 12:55:01,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-22 12:55:01,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:55:01,936 INFO L255 TraceCheckSpWp]: Trace formula consists of 693 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-22 12:55:01,944 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:55:01,996 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-22 12:55:01,996 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 12:55:01,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [497070339] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:55:01,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 12:55:01,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2024-11-22 12:55:01,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770709981] [2024-11-22 12:55:01,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:55:01,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 12:55:01,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:55:01,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 12:55:01,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-22 12:55:01,998 INFO L87 Difference]: Start difference. First operand 117 states and 169 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-22 12:55:02,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:55:02,033 INFO L93 Difference]: Finished difference Result 233 states and 338 transitions. [2024-11-22 12:55:02,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 12:55:02,037 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 171 [2024-11-22 12:55:02,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:55:02,039 INFO L225 Difference]: With dead ends: 233 [2024-11-22 12:55:02,039 INFO L226 Difference]: Without dead ends: 119 [2024-11-22 12:55:02,040 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-22 12:55:02,040 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 0 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 12:55:02,041 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 487 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 12:55:02,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-22 12:55:02,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2024-11-22 12:55:02,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 94 states have (on average 1.3297872340425532) internal successors, (125), 94 states have internal predecessors, (125), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-22 12:55:02,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 171 transitions. [2024-11-22 12:55:02,053 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 171 transitions. Word has length 171 [2024-11-22 12:55:02,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:55:02,054 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 171 transitions. [2024-11-22 12:55:02,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-22 12:55:02,054 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 171 transitions. [2024-11-22 12:55:02,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-22 12:55:02,058 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:55:02,058 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:55:02,067 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-22 12:55:02,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-11-22 12:55:02,259 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:55:02,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:55:02,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1753832815, now seen corresponding path program 1 times [2024-11-22 12:55:02,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:55:02,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270548113] [2024-11-22 12:55:02,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:55:02,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:55:02,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:55:02,384 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-22 12:55:02,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:55:02,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270548113] [2024-11-22 12:55:02,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270548113] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:55:02,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:55:02,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 12:55:02,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530756958] [2024-11-22 12:55:02,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:55:02,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 12:55:02,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:55:02,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 12:55:02,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 12:55:02,387 INFO L87 Difference]: Start difference. First operand 119 states and 171 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-22 12:55:02,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:55:02,414 INFO L93 Difference]: Finished difference Result 285 states and 411 transitions. [2024-11-22 12:55:02,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 12:55:02,417 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 173 [2024-11-22 12:55:02,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:55:02,418 INFO L225 Difference]: With dead ends: 285 [2024-11-22 12:55:02,418 INFO L226 Difference]: Without dead ends: 169 [2024-11-22 12:55:02,419 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 12:55:02,419 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 59 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 12:55:02,420 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 323 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 12:55:02,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-11-22 12:55:02,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 138. [2024-11-22 12:55:02,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 113 states have (on average 1.3539823008849559) internal successors, (153), 113 states have internal predecessors, (153), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-22 12:55:02,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 199 transitions. [2024-11-22 12:55:02,437 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 199 transitions. Word has length 173 [2024-11-22 12:55:02,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:55:02,438 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 199 transitions. [2024-11-22 12:55:02,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-22 12:55:02,438 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 199 transitions. [2024-11-22 12:55:02,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-22 12:55:02,440 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:55:02,440 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:55:02,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-22 12:55:02,441 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:55:02,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:55:02,441 INFO L85 PathProgramCache]: Analyzing trace with hash 310777285, now seen corresponding path program 1 times [2024-11-22 12:55:02,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:55:02,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616654703] [2024-11-22 12:55:02,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:55:02,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:55:02,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:55:02,539 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-22 12:55:02,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:55:02,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616654703] [2024-11-22 12:55:02,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616654703] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:55:02,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:55:02,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 12:55:02,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804987132] [2024-11-22 12:55:02,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:55:02,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 12:55:02,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:55:02,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 12:55:02,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 12:55:02,544 INFO L87 Difference]: Start difference. First operand 138 states and 199 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-22 12:55:02,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:55:02,561 INFO L93 Difference]: Finished difference Result 274 states and 397 transitions. [2024-11-22 12:55:02,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 12:55:02,561 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 176 [2024-11-22 12:55:02,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:55:02,564 INFO L225 Difference]: With dead ends: 274 [2024-11-22 12:55:02,564 INFO L226 Difference]: Without dead ends: 139 [2024-11-22 12:55:02,565 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 12:55:02,565 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 0 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 12:55:02,567 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 327 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 12:55:02,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-11-22 12:55:02,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2024-11-22 12:55:02,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 114 states have (on average 1.3508771929824561) internal successors, (154), 114 states have internal predecessors, (154), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-22 12:55:02,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 200 transitions. [2024-11-22 12:55:02,581 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 200 transitions. Word has length 176 [2024-11-22 12:55:02,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:55:02,582 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 200 transitions. [2024-11-22 12:55:02,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-22 12:55:02,582 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 200 transitions. [2024-11-22 12:55:02,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-22 12:55:02,583 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:55:02,583 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:55:02,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-22 12:55:02,583 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:55:02,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:55:02,584 INFO L85 PathProgramCache]: Analyzing trace with hash -276028729, now seen corresponding path program 1 times [2024-11-22 12:55:02,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:55:02,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301745915] [2024-11-22 12:55:02,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:55:02,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:55:02,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:55:03,241 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-22 12:55:03,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:55:03,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301745915] [2024-11-22 12:55:03,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301745915] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:55:03,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:55:03,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-22 12:55:03,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085827468] [2024-11-22 12:55:03,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:55:03,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-22 12:55:03,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:55:03,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-22 12:55:03,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-22 12:55:03,245 INFO L87 Difference]: Start difference. First operand 139 states and 200 transitions. Second operand has 8 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 3 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) [2024-11-22 12:55:03,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:55:03,469 INFO L93 Difference]: Finished difference Result 271 states and 391 transitions. [2024-11-22 12:55:03,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 12:55:03,470 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 3 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) Word has length 176 [2024-11-22 12:55:03,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:55:03,474 INFO L225 Difference]: With dead ends: 271 [2024-11-22 12:55:03,474 INFO L226 Difference]: Without dead ends: 135 [2024-11-22 12:55:03,474 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2024-11-22 12:55:03,475 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 432 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 165 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 432 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 165 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 12:55:03,475 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [432 Valid, 398 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [165 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 12:55:03,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-11-22 12:55:03,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 133. [2024-11-22 12:55:03,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 108 states have (on average 1.3333333333333333) internal successors, (144), 108 states have internal predecessors, (144), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-22 12:55:03,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 190 transitions. [2024-11-22 12:55:03,490 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 190 transitions. Word has length 176 [2024-11-22 12:55:03,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:55:03,490 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 190 transitions. [2024-11-22 12:55:03,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 3 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) [2024-11-22 12:55:03,490 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 190 transitions. [2024-11-22 12:55:03,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-22 12:55:03,491 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:55:03,492 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:55:03,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-22 12:55:03,492 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:55:03,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:55:03,492 INFO L85 PathProgramCache]: Analyzing trace with hash 31092209, now seen corresponding path program 1 times [2024-11-22 12:55:03,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:55:03,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795103844] [2024-11-22 12:55:03,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:55:03,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:55:03,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:55:04,110 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-22 12:55:04,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:55:04,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795103844] [2024-11-22 12:55:04,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795103844] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:55:04,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:55:04,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-22 12:55:04,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717872008] [2024-11-22 12:55:04,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:55:04,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-22 12:55:04,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:55:04,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-22 12:55:04,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-22 12:55:04,112 INFO L87 Difference]: Start difference. First operand 133 states and 190 transitions. Second operand has 9 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 3 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) [2024-11-22 12:55:04,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:55:04,403 INFO L93 Difference]: Finished difference Result 261 states and 374 transitions. [2024-11-22 12:55:04,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 12:55:04,404 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 3 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) Word has length 178 [2024-11-22 12:55:04,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:55:04,405 INFO L225 Difference]: With dead ends: 261 [2024-11-22 12:55:04,405 INFO L226 Difference]: Without dead ends: 131 [2024-11-22 12:55:04,406 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2024-11-22 12:55:04,406 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 402 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 165 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 402 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 165 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 12:55:04,407 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [402 Valid, 479 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [165 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 12:55:04,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-11-22 12:55:04,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 130. [2024-11-22 12:55:04,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 105 states have (on average 1.3238095238095238) internal successors, (139), 105 states have internal predecessors, (139), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-22 12:55:04,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 185 transitions. [2024-11-22 12:55:04,417 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 185 transitions. Word has length 178 [2024-11-22 12:55:04,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:55:04,417 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 185 transitions. [2024-11-22 12:55:04,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 3 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) [2024-11-22 12:55:04,418 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 185 transitions. [2024-11-22 12:55:04,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-22 12:55:04,419 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:55:04,419 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:55:04,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-22 12:55:04,419 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:55:04,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:55:04,420 INFO L85 PathProgramCache]: Analyzing trace with hash 917305551, now seen corresponding path program 1 times [2024-11-22 12:55:04,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:55:04,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931461226] [2024-11-22 12:55:04,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:55:04,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:55:04,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:55:04,528 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-22 12:55:04,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:55:04,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931461226] [2024-11-22 12:55:04,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931461226] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:55:04,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:55:04,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 12:55:04,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452145492] [2024-11-22 12:55:04,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:55:04,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 12:55:04,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:55:04,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 12:55:04,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 12:55:04,532 INFO L87 Difference]: Start difference. First operand 130 states and 185 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-22 12:55:04,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:55:04,555 INFO L93 Difference]: Finished difference Result 283 states and 402 transitions. [2024-11-22 12:55:04,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 12:55:04,555 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 178 [2024-11-22 12:55:04,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:55:04,557 INFO L225 Difference]: With dead ends: 283 [2024-11-22 12:55:04,557 INFO L226 Difference]: Without dead ends: 156 [2024-11-22 12:55:04,558 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 12:55:04,558 INFO L432 NwaCegarLoop]: 214 mSDtfsCounter, 51 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 12:55:04,561 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 356 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 12:55:04,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-11-22 12:55:04,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 130. [2024-11-22 12:55:04,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 105 states have (on average 1.2952380952380953) internal successors, (136), 105 states have internal predecessors, (136), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-22 12:55:04,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 182 transitions. [2024-11-22 12:55:04,568 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 182 transitions. Word has length 178 [2024-11-22 12:55:04,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:55:04,568 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 182 transitions. [2024-11-22 12:55:04,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-22 12:55:04,569 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 182 transitions. [2024-11-22 12:55:04,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-22 12:55:04,570 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:55:04,570 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:55:04,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-22 12:55:04,570 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:55:04,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:55:04,571 INFO L85 PathProgramCache]: Analyzing trace with hash -49751333, now seen corresponding path program 1 times [2024-11-22 12:55:04,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:55:04,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485957858] [2024-11-22 12:55:04,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:55:04,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:55:04,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:55:05,304 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-22 12:55:05,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:55:05,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485957858] [2024-11-22 12:55:05,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485957858] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:55:05,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:55:05,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-22 12:55:05,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51266047] [2024-11-22 12:55:05,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:55:05,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-22 12:55:05,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:55:05,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-22 12:55:05,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-22 12:55:05,305 INFO L87 Difference]: Start difference. First operand 130 states and 182 transitions. Second operand has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-22 12:55:05,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:55:05,439 INFO L93 Difference]: Finished difference Result 392 states and 549 transitions. [2024-11-22 12:55:05,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-22 12:55:05,440 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 180 [2024-11-22 12:55:05,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:55:05,441 INFO L225 Difference]: With dead ends: 392 [2024-11-22 12:55:05,442 INFO L226 Difference]: Without dead ends: 265 [2024-11-22 12:55:05,442 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2024-11-22 12:55:05,443 INFO L432 NwaCegarLoop]: 252 mSDtfsCounter, 153 mSDsluCounter, 1879 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 2131 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 12:55:05,443 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 2131 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 12:55:05,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2024-11-22 12:55:05,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 163. [2024-11-22 12:55:05,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 138 states have (on average 1.3043478260869565) internal successors, (180), 138 states have internal predecessors, (180), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-22 12:55:05,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 226 transitions. [2024-11-22 12:55:05,457 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 226 transitions. Word has length 180 [2024-11-22 12:55:05,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:55:05,458 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 226 transitions. [2024-11-22 12:55:05,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-22 12:55:05,458 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 226 transitions. [2024-11-22 12:55:05,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-22 12:55:05,459 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:55:05,459 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:55:05,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-22 12:55:05,460 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:55:05,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:55:05,460 INFO L85 PathProgramCache]: Analyzing trace with hash 651313245, now seen corresponding path program 1 times [2024-11-22 12:55:05,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:55:05,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086703962] [2024-11-22 12:55:05,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:55:05,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:55:05,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:55:05,584 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-22 12:55:05,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:55:05,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086703962] [2024-11-22 12:55:05,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086703962] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:55:05,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:55:05,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 12:55:05,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025660276] [2024-11-22 12:55:05,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:55:05,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 12:55:05,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:55:05,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 12:55:05,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 12:55:05,586 INFO L87 Difference]: Start difference. First operand 163 states and 226 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-22 12:55:05,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:55:05,603 INFO L93 Difference]: Finished difference Result 328 states and 456 transitions. [2024-11-22 12:55:05,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 12:55:05,604 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 180 [2024-11-22 12:55:05,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:55:05,605 INFO L225 Difference]: With dead ends: 328 [2024-11-22 12:55:05,605 INFO L226 Difference]: Without dead ends: 168 [2024-11-22 12:55:05,606 INFO L431 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-22 12:55:05,606 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 1 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 12:55:05,606 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 455 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 12:55:05,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-11-22 12:55:05,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 167. [2024-11-22 12:55:05,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 142 states have (on average 1.295774647887324) internal successors, (184), 142 states have internal predecessors, (184), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-22 12:55:05,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 230 transitions. [2024-11-22 12:55:05,615 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 230 transitions. Word has length 180 [2024-11-22 12:55:05,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:55:05,615 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 230 transitions. [2024-11-22 12:55:05,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-22 12:55:05,615 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 230 transitions. [2024-11-22 12:55:05,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-22 12:55:05,616 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:55:05,617 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:55:05,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-22 12:55:05,617 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:55:05,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:55:05,617 INFO L85 PathProgramCache]: Analyzing trace with hash 64507231, now seen corresponding path program 1 times [2024-11-22 12:55:05,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:55:05,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275461613] [2024-11-22 12:55:05,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:55:05,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:55:05,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:55:05,921 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-22 12:55:05,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:55:05,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275461613] [2024-11-22 12:55:05,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275461613] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:55:05,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:55:05,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 12:55:05,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327503242] [2024-11-22 12:55:05,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:55:05,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 12:55:05,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:55:05,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 12:55:05,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-22 12:55:05,923 INFO L87 Difference]: Start difference. First operand 167 states and 230 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-22 12:55:05,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:55:05,967 INFO L93 Difference]: Finished difference Result 419 states and 573 transitions. [2024-11-22 12:55:05,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 12:55:05,967 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 180 [2024-11-22 12:55:05,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:55:05,970 INFO L225 Difference]: With dead ends: 419 [2024-11-22 12:55:05,970 INFO L226 Difference]: Without dead ends: 255 [2024-11-22 12:55:05,970 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-22 12:55:05,971 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 47 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 592 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 12:55:05,971 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 592 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 12:55:05,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2024-11-22 12:55:05,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 225. [2024-11-22 12:55:05,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 200 states have (on average 1.31) internal successors, (262), 200 states have internal predecessors, (262), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-22 12:55:05,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 308 transitions. [2024-11-22 12:55:05,983 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 308 transitions. Word has length 180 [2024-11-22 12:55:05,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:55:05,983 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 308 transitions. [2024-11-22 12:55:05,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-22 12:55:05,983 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 308 transitions. [2024-11-22 12:55:05,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-22 12:55:05,985 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:55:05,985 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:55:05,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-22 12:55:05,986 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:55:05,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:55:05,986 INFO L85 PathProgramCache]: Analyzing trace with hash 90797277, now seen corresponding path program 1 times [2024-11-22 12:55:05,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:55:05,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304093863] [2024-11-22 12:55:05,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:55:05,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:55:06,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:55:06,107 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-22 12:55:06,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:55:06,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304093863] [2024-11-22 12:55:06,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304093863] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:55:06,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:55:06,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 12:55:06,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311992191] [2024-11-22 12:55:06,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:55:06,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 12:55:06,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:55:06,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 12:55:06,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 12:55:06,109 INFO L87 Difference]: Start difference. First operand 225 states and 308 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-22 12:55:06,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:55:06,126 INFO L93 Difference]: Finished difference Result 420 states and 577 transitions. [2024-11-22 12:55:06,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 12:55:06,126 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 180 [2024-11-22 12:55:06,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:55:06,127 INFO L225 Difference]: With dead ends: 420 [2024-11-22 12:55:06,127 INFO L226 Difference]: Without dead ends: 198 [2024-11-22 12:55:06,128 INFO L431 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-22 12:55:06,128 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 1 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 12:55:06,129 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 457 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 12:55:06,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2024-11-22 12:55:06,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2024-11-22 12:55:06,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 173 states have (on average 1.2947976878612717) internal successors, (224), 173 states have internal predecessors, (224), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-22 12:55:06,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 270 transitions. [2024-11-22 12:55:06,137 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 270 transitions. Word has length 180 [2024-11-22 12:55:06,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:55:06,137 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 270 transitions. [2024-11-22 12:55:06,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-22 12:55:06,138 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 270 transitions. [2024-11-22 12:55:06,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-22 12:55:06,139 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:55:06,139 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:55:06,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-22 12:55:06,139 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:55:06,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:55:06,139 INFO L85 PathProgramCache]: Analyzing trace with hash 1987735265, now seen corresponding path program 1 times [2024-11-22 12:55:06,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:55:06,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334751421] [2024-11-22 12:55:06,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:55:06,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:55:06,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:55:06,462 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-22 12:55:06,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:55:06,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334751421] [2024-11-22 12:55:06,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334751421] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:55:06,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:55:06,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 12:55:06,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441468125] [2024-11-22 12:55:06,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:55:06,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 12:55:06,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:55:06,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 12:55:06,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-22 12:55:06,464 INFO L87 Difference]: Start difference. First operand 198 states and 270 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-22 12:55:06,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:55:06,540 INFO L93 Difference]: Finished difference Result 529 states and 715 transitions. [2024-11-22 12:55:06,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-22 12:55:06,541 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 180 [2024-11-22 12:55:06,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:55:06,543 INFO L225 Difference]: With dead ends: 529 [2024-11-22 12:55:06,543 INFO L226 Difference]: Without dead ends: 334 [2024-11-22 12:55:06,543 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-22 12:55:06,544 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 110 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 12:55:06,545 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 579 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 12:55:06,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2024-11-22 12:55:06,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 326. [2024-11-22 12:55:06,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 298 states have (on average 1.3053691275167785) internal successors, (389), 299 states have internal predecessors, (389), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-22 12:55:06,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 439 transitions. [2024-11-22 12:55:06,561 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 439 transitions. Word has length 180 [2024-11-22 12:55:06,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:55:06,561 INFO L471 AbstractCegarLoop]: Abstraction has 326 states and 439 transitions. [2024-11-22 12:55:06,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-22 12:55:06,561 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 439 transitions. [2024-11-22 12:55:06,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-22 12:55:06,562 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:55:06,563 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:55:06,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-22 12:55:06,563 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:55:06,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:55:06,563 INFO L85 PathProgramCache]: Analyzing trace with hash 2014025311, now seen corresponding path program 1 times [2024-11-22 12:55:06,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:55:06,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77242335] [2024-11-22 12:55:06,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:55:06,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:55:06,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:55:06,818 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-22 12:55:06,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:55:06,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77242335] [2024-11-22 12:55:06,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77242335] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:55:06,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:55:06,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 12:55:06,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130405610] [2024-11-22 12:55:06,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:55:06,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 12:55:06,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:55:06,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 12:55:06,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-22 12:55:06,820 INFO L87 Difference]: Start difference. First operand 326 states and 439 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-22 12:55:06,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:55:06,883 INFO L93 Difference]: Finished difference Result 621 states and 836 transitions. [2024-11-22 12:55:06,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-22 12:55:06,883 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 180 [2024-11-22 12:55:06,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:55:06,885 INFO L225 Difference]: With dead ends: 621 [2024-11-22 12:55:06,885 INFO L226 Difference]: Without dead ends: 298 [2024-11-22 12:55:06,885 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-22 12:55:06,886 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 136 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 12:55:06,886 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 620 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 12:55:06,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2024-11-22 12:55:06,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 295. [2024-11-22 12:55:06,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 267 states have (on average 1.2958801498127341) internal successors, (346), 268 states have internal predecessors, (346), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-22 12:55:06,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 396 transitions. [2024-11-22 12:55:06,897 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 396 transitions. Word has length 180 [2024-11-22 12:55:06,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:55:06,897 INFO L471 AbstractCegarLoop]: Abstraction has 295 states and 396 transitions. [2024-11-22 12:55:06,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-22 12:55:06,897 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 396 transitions. [2024-11-22 12:55:06,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-22 12:55:06,899 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:55:06,899 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:55:06,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-22 12:55:06,899 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:55:06,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:55:06,899 INFO L85 PathProgramCache]: Analyzing trace with hash -921028637, now seen corresponding path program 1 times [2024-11-22 12:55:06,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:55:06,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797084227] [2024-11-22 12:55:06,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:55:06,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:55:06,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:55:07,127 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-22 12:55:07,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:55:07,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797084227] [2024-11-22 12:55:07,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797084227] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:55:07,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:55:07,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 12:55:07,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24930802] [2024-11-22 12:55:07,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:55:07,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 12:55:07,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:55:07,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 12:55:07,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-22 12:55:07,129 INFO L87 Difference]: Start difference. First operand 295 states and 396 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-22 12:55:07,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:55:07,202 INFO L93 Difference]: Finished difference Result 594 states and 794 transitions. [2024-11-22 12:55:07,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 12:55:07,203 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 180 [2024-11-22 12:55:07,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:55:07,204 INFO L225 Difference]: With dead ends: 594 [2024-11-22 12:55:07,204 INFO L226 Difference]: Without dead ends: 302 [2024-11-22 12:55:07,205 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-22 12:55:07,205 INFO L432 NwaCegarLoop]: 205 mSDtfsCounter, 111 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 12:55:07,205 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 545 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 12:55:07,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2024-11-22 12:55:07,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 266. [2024-11-22 12:55:07,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 240 states have (on average 1.2875) internal successors, (309), 240 states have internal predecessors, (309), 23 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-22 12:55:07,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 355 transitions. [2024-11-22 12:55:07,215 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 355 transitions. Word has length 180 [2024-11-22 12:55:07,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:55:07,216 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 355 transitions. [2024-11-22 12:55:07,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-22 12:55:07,216 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 355 transitions. [2024-11-22 12:55:07,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-22 12:55:07,217 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:55:07,217 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:55:07,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-22 12:55:07,218 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:55:07,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:55:07,218 INFO L85 PathProgramCache]: Analyzing trace with hash 2094074981, now seen corresponding path program 1 times [2024-11-22 12:55:07,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:55:07,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510007635] [2024-11-22 12:55:07,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:55:07,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:55:07,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:55:07,453 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-22 12:55:07,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:55:07,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510007635] [2024-11-22 12:55:07,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510007635] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:55:07,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:55:07,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 12:55:07,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631937972] [2024-11-22 12:55:07,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:55:07,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 12:55:07,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:55:07,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 12:55:07,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-22 12:55:07,455 INFO L87 Difference]: Start difference. First operand 266 states and 355 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-22 12:55:07,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:55:07,520 INFO L93 Difference]: Finished difference Result 536 states and 711 transitions. [2024-11-22 12:55:07,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 12:55:07,520 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 180 [2024-11-22 12:55:07,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:55:07,522 INFO L225 Difference]: With dead ends: 536 [2024-11-22 12:55:07,522 INFO L226 Difference]: Without dead ends: 273 [2024-11-22 12:55:07,522 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-22 12:55:07,523 INFO L432 NwaCegarLoop]: 205 mSDtfsCounter, 133 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 739 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 12:55:07,523 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 739 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 12:55:07,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2024-11-22 12:55:07,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 237. [2024-11-22 12:55:07,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 211 states have (on average 1.2701421800947867) internal successors, (268), 211 states have internal predecessors, (268), 23 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-22 12:55:07,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 314 transitions. [2024-11-22 12:55:07,532 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 314 transitions. Word has length 180 [2024-11-22 12:55:07,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:55:07,533 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 314 transitions. [2024-11-22 12:55:07,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-22 12:55:07,533 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 314 transitions. [2024-11-22 12:55:07,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-22 12:55:07,534 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:55:07,534 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:55:07,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-22 12:55:07,534 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:55:07,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:55:07,535 INFO L85 PathProgramCache]: Analyzing trace with hash 2120365027, now seen corresponding path program 1 times [2024-11-22 12:55:07,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:55:07,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952591648] [2024-11-22 12:55:07,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:55:07,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:55:07,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:55:07,764 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-22 12:55:07,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:55:07,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952591648] [2024-11-22 12:55:07,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952591648] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:55:07,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:55:07,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 12:55:07,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76431686] [2024-11-22 12:55:07,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:55:07,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 12:55:07,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:55:07,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 12:55:07,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-22 12:55:07,766 INFO L87 Difference]: Start difference. First operand 237 states and 314 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-22 12:55:07,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:55:07,804 INFO L93 Difference]: Finished difference Result 495 states and 655 transitions. [2024-11-22 12:55:07,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 12:55:07,805 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 180 [2024-11-22 12:55:07,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:55:07,806 INFO L225 Difference]: With dead ends: 495 [2024-11-22 12:55:07,806 INFO L226 Difference]: Without dead ends: 261 [2024-11-22 12:55:07,806 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-22 12:55:07,807 INFO L432 NwaCegarLoop]: 194 mSDtfsCounter, 91 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 12:55:07,807 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 524 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 12:55:07,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2024-11-22 12:55:07,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 235. [2024-11-22 12:55:07,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 209 states have (on average 1.263157894736842) internal successors, (264), 209 states have internal predecessors, (264), 23 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-22 12:55:07,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 310 transitions. [2024-11-22 12:55:07,817 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 310 transitions. Word has length 180 [2024-11-22 12:55:07,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:55:07,817 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 310 transitions. [2024-11-22 12:55:07,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-22 12:55:07,817 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 310 transitions. [2024-11-22 12:55:07,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-22 12:55:07,819 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:55:07,819 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:55:07,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-22 12:55:07,819 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:55:07,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:55:07,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1533559013, now seen corresponding path program 1 times [2024-11-22 12:55:07,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:55:07,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604929173] [2024-11-22 12:55:07,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:55:07,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:55:07,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:55:08,126 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-22 12:55:08,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:55:08,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604929173] [2024-11-22 12:55:08,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604929173] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:55:08,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:55:08,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 12:55:08,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033308686] [2024-11-22 12:55:08,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:55:08,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 12:55:08,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:55:08,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 12:55:08,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-22 12:55:08,129 INFO L87 Difference]: Start difference. First operand 235 states and 310 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-22 12:55:08,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:55:08,198 INFO L93 Difference]: Finished difference Result 503 states and 660 transitions. [2024-11-22 12:55:08,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 12:55:08,198 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 180 [2024-11-22 12:55:08,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:55:08,200 INFO L225 Difference]: With dead ends: 503 [2024-11-22 12:55:08,200 INFO L226 Difference]: Without dead ends: 271 [2024-11-22 12:55:08,200 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-22 12:55:08,201 INFO L432 NwaCegarLoop]: 205 mSDtfsCounter, 105 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 738 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 12:55:08,201 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 738 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 12:55:08,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2024-11-22 12:55:08,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 235. [2024-11-22 12:55:08,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 209 states have (on average 1.2583732057416268) internal successors, (263), 209 states have internal predecessors, (263), 23 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-22 12:55:08,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 309 transitions. [2024-11-22 12:55:08,210 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 309 transitions. Word has length 180 [2024-11-22 12:55:08,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:55:08,211 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 309 transitions. [2024-11-22 12:55:08,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-22 12:55:08,211 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 309 transitions. [2024-11-22 12:55:08,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-22 12:55:08,212 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:55:08,212 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:55:08,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-22 12:55:08,212 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:55:08,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:55:08,212 INFO L85 PathProgramCache]: Analyzing trace with hash -2060343705, now seen corresponding path program 1 times [2024-11-22 12:55:08,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:55:08,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374773315] [2024-11-22 12:55:08,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:55:08,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:55:08,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:55:08,992 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-22 12:55:08,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:55:08,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374773315] [2024-11-22 12:55:08,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374773315] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:55:08,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:55:08,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-22 12:55:08,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72899519] [2024-11-22 12:55:08,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:55:08,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-22 12:55:08,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:55:08,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-22 12:55:08,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-22 12:55:08,995 INFO L87 Difference]: Start difference. First operand 235 states and 309 transitions. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-22 12:55:09,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:55:09,217 INFO L93 Difference]: Finished difference Result 512 states and 673 transitions. [2024-11-22 12:55:09,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-22 12:55:09,218 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 180 [2024-11-22 12:55:09,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:55:09,219 INFO L225 Difference]: With dead ends: 512 [2024-11-22 12:55:09,219 INFO L226 Difference]: Without dead ends: 280 [2024-11-22 12:55:09,220 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2024-11-22 12:55:09,220 INFO L432 NwaCegarLoop]: 227 mSDtfsCounter, 71 mSDsluCounter, 1421 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 1648 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 12:55:09,221 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 1648 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 12:55:09,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2024-11-22 12:55:09,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 277. [2024-11-22 12:55:09,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 244 states have (on average 1.2622950819672132) internal successors, (308), 245 states have internal predecessors, (308), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-22 12:55:09,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 364 transitions. [2024-11-22 12:55:09,234 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 364 transitions. Word has length 180 [2024-11-22 12:55:09,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:55:09,234 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 364 transitions. [2024-11-22 12:55:09,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-22 12:55:09,234 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 364 transitions. [2024-11-22 12:55:09,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-22 12:55:09,236 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:55:09,236 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:55:09,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-22 12:55:09,236 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:55:09,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:55:09,236 INFO L85 PathProgramCache]: Analyzing trace with hash -371150636, now seen corresponding path program 1 times [2024-11-22 12:55:09,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:55:09,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940023712] [2024-11-22 12:55:09,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:55:09,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:55:09,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:55:09,376 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-22 12:55:09,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:55:09,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940023712] [2024-11-22 12:55:09,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940023712] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:55:09,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:55:09,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 12:55:09,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692107616] [2024-11-22 12:55:09,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:55:09,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 12:55:09,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:55:09,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 12:55:09,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 12:55:09,380 INFO L87 Difference]: Start difference. First operand 277 states and 364 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-22 12:55:09,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:55:09,482 INFO L93 Difference]: Finished difference Result 724 states and 952 transitions. [2024-11-22 12:55:09,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 12:55:09,482 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 180 [2024-11-22 12:55:09,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:55:09,485 INFO L225 Difference]: With dead ends: 724 [2024-11-22 12:55:09,486 INFO L226 Difference]: Without dead ends: 450 [2024-11-22 12:55:09,486 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-22 12:55:09,487 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 119 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 12:55:09,487 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 453 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 12:55:09,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2024-11-22 12:55:09,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 340. [2024-11-22 12:55:09,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 282 states have (on average 1.2375886524822695) internal successors, (349), 283 states have internal predecessors, (349), 51 states have call successors, (51), 6 states have call predecessors, (51), 6 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) [2024-11-22 12:55:09,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 451 transitions. [2024-11-22 12:55:09,507 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 451 transitions. Word has length 180 [2024-11-22 12:55:09,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:55:09,507 INFO L471 AbstractCegarLoop]: Abstraction has 340 states and 451 transitions. [2024-11-22 12:55:09,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-22 12:55:09,507 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 451 transitions. [2024-11-22 12:55:09,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-11-22 12:55:09,508 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:55:09,508 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:55:09,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-22 12:55:09,509 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:55:09,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:55:09,509 INFO L85 PathProgramCache]: Analyzing trace with hash -1236375162, now seen corresponding path program 1 times [2024-11-22 12:55:09,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:55:09,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736098251] [2024-11-22 12:55:09,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:55:09,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:55:09,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:55:09,644 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-22 12:55:09,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:55:09,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736098251] [2024-11-22 12:55:09,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736098251] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 12:55:09,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [906107044] [2024-11-22 12:55:09,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:55:09,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 12:55:09,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 12:55:09,646 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 12:55:09,647 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-22 12:55:09,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:55:09,897 INFO L255 TraceCheckSpWp]: Trace formula consists of 714 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-22 12:55:09,900 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:55:09,924 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-22 12:55:09,924 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 12:55:09,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [906107044] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:55:09,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 12:55:09,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2024-11-22 12:55:09,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944636058] [2024-11-22 12:55:09,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:55:09,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 12:55:09,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:55:09,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 12:55:09,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-22 12:55:09,927 INFO L87 Difference]: Start difference. First operand 340 states and 451 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-22 12:55:09,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:55:09,960 INFO L93 Difference]: Finished difference Result 620 states and 820 transitions. [2024-11-22 12:55:09,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 12:55:09,960 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 182 [2024-11-22 12:55:09,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:55:09,962 INFO L225 Difference]: With dead ends: 620 [2024-11-22 12:55:09,962 INFO L226 Difference]: Without dead ends: 346 [2024-11-22 12:55:09,963 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 183 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-22 12:55:09,963 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 0 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 12:55:09,963 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 604 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 12:55:09,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2024-11-22 12:55:09,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 346. [2024-11-22 12:55:09,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 288 states have (on average 1.2326388888888888) internal successors, (355), 289 states have internal predecessors, (355), 51 states have call successors, (51), 6 states have call predecessors, (51), 6 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) [2024-11-22 12:55:09,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 457 transitions. [2024-11-22 12:55:09,984 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 457 transitions. Word has length 182 [2024-11-22 12:55:09,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:55:09,985 INFO L471 AbstractCegarLoop]: Abstraction has 346 states and 457 transitions. [2024-11-22 12:55:09,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-22 12:55:09,985 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 457 transitions. [2024-11-22 12:55:09,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-22 12:55:09,986 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:55:09,986 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:55:09,996 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-22 12:55:10,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 12:55:10,187 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:55:10,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:55:10,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1917092673, now seen corresponding path program 1 times [2024-11-22 12:55:10,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:55:10,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943577506] [2024-11-22 12:55:10,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:55:10,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:55:10,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:55:10,550 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-22 12:55:10,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:55:10,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943577506] [2024-11-22 12:55:10,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943577506] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:55:10,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:55:10,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-22 12:55:10,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840278598] [2024-11-22 12:55:10,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:55:10,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 12:55:10,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:55:10,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 12:55:10,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-22 12:55:10,552 INFO L87 Difference]: Start difference. First operand 346 states and 457 transitions. Second operand has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-22 12:55:10,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:55:10,652 INFO L93 Difference]: Finished difference Result 625 states and 818 transitions. [2024-11-22 12:55:10,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-22 12:55:10,652 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 184 [2024-11-22 12:55:10,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:55:10,655 INFO L225 Difference]: With dead ends: 625 [2024-11-22 12:55:10,655 INFO L226 Difference]: Without dead ends: 623 [2024-11-22 12:55:10,655 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-22 12:55:10,655 INFO L432 NwaCegarLoop]: 216 mSDtfsCounter, 107 mSDsluCounter, 999 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 1215 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 12:55:10,656 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 1215 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 12:55:10,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2024-11-22 12:55:10,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 620. [2024-11-22 12:55:10,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 620 states, 534 states have (on average 1.2378277153558053) internal successors, (661), 537 states have internal predecessors, (661), 75 states have call successors, (75), 10 states have call predecessors, (75), 10 states have return successors, (75), 72 states have call predecessors, (75), 75 states have call successors, (75) [2024-11-22 12:55:10,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 811 transitions. [2024-11-22 12:55:10,685 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 811 transitions. Word has length 184 [2024-11-22 12:55:10,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:55:10,685 INFO L471 AbstractCegarLoop]: Abstraction has 620 states and 811 transitions. [2024-11-22 12:55:10,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-22 12:55:10,685 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 811 transitions. [2024-11-22 12:55:10,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-22 12:55:10,686 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:55:10,687 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:55:10,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-22 12:55:10,687 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:55:10,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:55:10,687 INFO L85 PathProgramCache]: Analyzing trace with hash 1073087171, now seen corresponding path program 1 times [2024-11-22 12:55:10,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:55:10,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632854499] [2024-11-22 12:55:10,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:55:10,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:55:10,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 12:55:10,751 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-22 12:55:10,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 12:55:10,914 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-22 12:55:10,914 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-22 12:55:10,915 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-22 12:55:10,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-22 12:55:10,918 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 12:55:11,140 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-22 12:55:11,142 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 12:55:11 BoogieIcfgContainer [2024-11-22 12:55:11,142 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-22 12:55:11,143 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-22 12:55:11,143 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-22 12:55:11,143 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-22 12:55:11,143 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:54:59" (3/4) ... [2024-11-22 12:55:11,145 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-22 12:55:11,146 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-22 12:55:11,146 INFO L158 Benchmark]: Toolchain (without parser) took 12399.28ms. Allocated memory was 163.6MB in the beginning and 551.6MB in the end (delta: 388.0MB). Free memory was 130.8MB in the beginning and 479.5MB in the end (delta: -348.6MB). Peak memory consumption was 37.9MB. Max. memory is 16.1GB. [2024-11-22 12:55:11,147 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 121.6MB. Free memory was 83.4MB in the beginning and 83.3MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 12:55:11,147 INFO L158 Benchmark]: CACSL2BoogieTranslator took 333.08ms. Allocated memory is still 163.6MB. Free memory was 130.8MB in the beginning and 114.8MB in the end (delta: 16.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-22 12:55:11,147 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.55ms. Allocated memory is still 163.6MB. Free memory was 114.8MB in the beginning and 111.3MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-22 12:55:11,147 INFO L158 Benchmark]: Boogie Preprocessor took 84.95ms. Allocated memory is still 163.6MB. Free memory was 111.3MB in the beginning and 105.7MB in the end (delta: 5.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-22 12:55:11,147 INFO L158 Benchmark]: RCFGBuilder took 714.53ms. Allocated memory is still 163.6MB. Free memory was 105.7MB in the beginning and 108.8MB in the end (delta: -3.2MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-11-22 12:55:11,148 INFO L158 Benchmark]: TraceAbstraction took 11207.28ms. Allocated memory was 163.6MB in the beginning and 551.6MB in the end (delta: 388.0MB). Free memory was 107.8MB in the beginning and 480.5MB in the end (delta: -372.7MB). Peak memory consumption was 319.4MB. Max. memory is 16.1GB. [2024-11-22 12:55:11,148 INFO L158 Benchmark]: Witness Printer took 3.54ms. Allocated memory is still 551.6MB. Free memory is still 479.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 12:55:11,149 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.21ms. Allocated memory is still 121.6MB. Free memory was 83.4MB in the beginning and 83.3MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 333.08ms. Allocated memory is still 163.6MB. Free memory was 130.8MB in the beginning and 114.8MB in the end (delta: 16.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.55ms. Allocated memory is still 163.6MB. Free memory was 114.8MB in the beginning and 111.3MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 84.95ms. Allocated memory is still 163.6MB. Free memory was 111.3MB in the beginning and 105.7MB in the end (delta: 5.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 714.53ms. Allocated memory is still 163.6MB. Free memory was 105.7MB in the beginning and 108.8MB in the end (delta: -3.2MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 11207.28ms. Allocated memory was 163.6MB in the beginning and 551.6MB in the end (delta: 388.0MB). Free memory was 107.8MB in the beginning and 480.5MB in the end (delta: -372.7MB). Peak memory consumption was 319.4MB. Max. memory is 16.1GB. * Witness Printer took 3.54ms. Allocated memory is still 551.6MB. Free memory is still 479.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 122. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 16.6; [L22] double var_1_1 = 16.6; [L23] double* var_1_1_Pointer = &(var_1_1); [L24] unsigned char var_1_2 = 1; [L24] unsigned char var_1_2 = 1; [L25] unsigned char* var_1_2_Pointer = &(var_1_2); [L26] unsigned char var_1_3 = 1; [L26] unsigned char var_1_3 = 1; [L27] unsigned char* var_1_3_Pointer = &(var_1_3); [L28] double var_1_4 = 10.6; [L28] double var_1_4 = 10.6; [L29] double* var_1_4_Pointer = &(var_1_4); [L30] unsigned char var_1_5 = 0; [L30] unsigned char var_1_5 = 0; [L31] unsigned char* var_1_5_Pointer = &(var_1_5); [L32] unsigned char var_1_7 = 1; [L32] unsigned char var_1_7 = 1; [L33] unsigned char* var_1_7_Pointer = &(var_1_7); [L34] unsigned char var_1_8 = 0; [L34] unsigned char var_1_8 = 0; [L35] unsigned char* var_1_8_Pointer = &(var_1_8); [L36] unsigned char var_1_9 = 0; [L36] unsigned char var_1_9 = 0; [L37] unsigned char* var_1_9_Pointer = &(var_1_9); [L38] signed char var_1_10 = 10; [L38] signed char var_1_10 = 10; [L39] signed char* var_1_10_Pointer = &(var_1_10); [L40] unsigned char var_1_11 = 100; [L40] unsigned char var_1_11 = 100; [L41] unsigned char* var_1_11_Pointer = &(var_1_11); [L42] unsigned char var_1_12 = 64; [L42] unsigned char var_1_12 = 64; [L43] unsigned char* var_1_12_Pointer = &(var_1_12); [L44] unsigned char var_1_13 = 100; [L44] unsigned char var_1_13 = 100; [L45] unsigned char* var_1_13_Pointer = &(var_1_13); [L46] signed char var_1_14 = -4; [L46] signed char var_1_14 = -4; [L47] signed char* var_1_14_Pointer = &(var_1_14); [L48] signed char var_1_15 = 32; [L48] signed char var_1_15 = 32; [L49] signed char* var_1_15_Pointer = &(var_1_15); [L50] signed char var_1_16 = 4; [L50] signed char var_1_16 = 4; [L51] signed char* var_1_16_Pointer = &(var_1_16); [L52] signed char var_1_17 = 64; [L52] signed char var_1_17 = 64; [L53] signed char* var_1_17_Pointer = &(var_1_17); [L54] unsigned char last_1_var_1_5 = 0; VAL [isInitial=0, last_1_var_1_5=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L126] isInitial = 1 [L127] FCALL initially() [L128] COND TRUE 1 [L129] CALL updateLastVariables() [L119] EXPR \read(var_1_5) [L119] last_1_var_1_5 = var_1_5 [L129] RET updateLastVariables() [L130] CALL updateVariables() [L82] var_1_2 = __VERIFIER_nondet_uchar() [L83] EXPR \read(var_1_2) VAL [isInitial=1, last_1_var_1_5=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L83] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L83] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_5=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L84] EXPR \read(var_1_2) VAL [isInitial=1, last_1_var_1_5=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L84] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L84] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_5=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L85] var_1_3 = __VERIFIER_nondet_uchar() [L86] EXPR \read(var_1_3) VAL [isInitial=1, last_1_var_1_5=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L86] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L86] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_5=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L87] EXPR \read(var_1_3) VAL [isInitial=1, last_1_var_1_5=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L87] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L87] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, last_1_var_1_5=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L88] var_1_4 = __VERIFIER_nondet_double() [L89] EXPR \read(var_1_4) [L89] EXPR var_1_4 >= -922337.2036854765600e+13F && var_1_4 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_5=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L89] EXPR var_1_4 >= -922337.2036854765600e+13F && var_1_4 <= -1.0e-20F [L89] EXPR \read(var_1_4) [L89] EXPR var_1_4 >= -922337.2036854765600e+13F && var_1_4 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_5=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L89] EXPR (var_1_4 >= -922337.2036854765600e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_5=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L89] EXPR (var_1_4 >= -922337.2036854765600e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_5=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L89] CALL assume_abort_if_not((var_1_4 >= -922337.2036854765600e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L89] RET assume_abort_if_not((var_1_4 >= -922337.2036854765600e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_5=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L90] var_1_7 = __VERIFIER_nondet_uchar() [L91] EXPR \read(var_1_7) VAL [isInitial=1, last_1_var_1_5=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L91] CALL assume_abort_if_not(var_1_7 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L91] RET assume_abort_if_not(var_1_7 >= 1) VAL [isInitial=1, last_1_var_1_5=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L92] EXPR \read(var_1_7) VAL [isInitial=1, last_1_var_1_5=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L92] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L92] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, last_1_var_1_5=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L93] var_1_8 = __VERIFIER_nondet_uchar() [L94] EXPR \read(var_1_8) VAL [isInitial=1, last_1_var_1_5=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L94] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L94] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_5=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L95] EXPR \read(var_1_8) VAL [isInitial=1, last_1_var_1_5=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L95] CALL assume_abort_if_not(var_1_8 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L95] RET assume_abort_if_not(var_1_8 <= 0) VAL [isInitial=1, last_1_var_1_5=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L96] var_1_9 = __VERIFIER_nondet_uchar() [L97] EXPR \read(var_1_9) VAL [isInitial=1, last_1_var_1_5=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L97] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L97] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_5=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L98] EXPR \read(var_1_9) VAL [isInitial=1, last_1_var_1_5=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L98] CALL assume_abort_if_not(var_1_9 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L98] RET assume_abort_if_not(var_1_9 <= 0) VAL [isInitial=1, last_1_var_1_5=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L99] var_1_11 = __VERIFIER_nondet_uchar() [L100] EXPR \read(var_1_11) VAL [isInitial=1, last_1_var_1_5=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L100] CALL assume_abort_if_not(var_1_11 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L100] RET assume_abort_if_not(var_1_11 >= 63) VAL [isInitial=1, last_1_var_1_5=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L101] EXPR \read(var_1_11) VAL [isInitial=1, last_1_var_1_5=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L101] CALL assume_abort_if_not(var_1_11 <= 128) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L101] RET assume_abort_if_not(var_1_11 <= 128) VAL [isInitial=1, last_1_var_1_5=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L102] var_1_12 = __VERIFIER_nondet_uchar() [L103] EXPR \read(var_1_12) VAL [isInitial=1, last_1_var_1_5=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L103] CALL assume_abort_if_not(var_1_12 >= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L103] RET assume_abort_if_not(var_1_12 >= 64) VAL [isInitial=1, last_1_var_1_5=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L104] EXPR \read(var_1_12) VAL [isInitial=1, last_1_var_1_5=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L104] CALL assume_abort_if_not(var_1_12 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L104] RET assume_abort_if_not(var_1_12 <= 127) VAL [isInitial=1, last_1_var_1_5=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L105] var_1_13 = __VERIFIER_nondet_uchar() [L106] EXPR \read(var_1_13) VAL [isInitial=1, last_1_var_1_5=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L106] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L106] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_5=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L107] EXPR \read(var_1_13) VAL [isInitial=1, last_1_var_1_5=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L107] CALL assume_abort_if_not(var_1_13 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L107] RET assume_abort_if_not(var_1_13 <= 127) VAL [isInitial=1, last_1_var_1_5=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L108] var_1_14 = __VERIFIER_nondet_char() [L109] EXPR \read(var_1_14) VAL [isInitial=1, last_1_var_1_5=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L109] CALL assume_abort_if_not(var_1_14 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L109] RET assume_abort_if_not(var_1_14 >= -63) VAL [isInitial=1, last_1_var_1_5=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L110] EXPR \read(var_1_14) VAL [isInitial=1, last_1_var_1_5=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L110] CALL assume_abort_if_not(var_1_14 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L110] RET assume_abort_if_not(var_1_14 <= 63) VAL [isInitial=1, last_1_var_1_5=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L111] var_1_15 = __VERIFIER_nondet_char() [L112] EXPR \read(var_1_15) VAL [isInitial=1, last_1_var_1_5=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L112] CALL assume_abort_if_not(var_1_15 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L112] RET assume_abort_if_not(var_1_15 >= -63) VAL [isInitial=1, last_1_var_1_5=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L113] EXPR \read(var_1_15) VAL [isInitial=1, last_1_var_1_5=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L113] CALL assume_abort_if_not(var_1_15 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L113] RET assume_abort_if_not(var_1_15 <= 63) VAL [isInitial=1, last_1_var_1_5=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L114] var_1_16 = __VERIFIER_nondet_char() [L115] EXPR \read(var_1_16) VAL [isInitial=1, last_1_var_1_5=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L115] CALL assume_abort_if_not(var_1_16 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L115] RET assume_abort_if_not(var_1_16 >= -127) VAL [isInitial=1, last_1_var_1_5=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L116] EXPR \read(var_1_16) VAL [isInitial=1, last_1_var_1_5=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L116] CALL assume_abort_if_not(var_1_16 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L116] RET assume_abort_if_not(var_1_16 <= 126) VAL [isInitial=1, last_1_var_1_5=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L130] RET updateVariables() [L131] CALL step() [L58] COND FALSE !(\read(last_1_var_1_5)) VAL [isInitial=1, last_1_var_1_5=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L63] EXPR \read(*var_1_1_Pointer) [L63] EXPR \read(*var_1_4_Pointer) [L63] EXPR \read(*var_1_1_Pointer) VAL [isInitial=1, last_1_var_1_5=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L63] COND FALSE !((*(var_1_1_Pointer)) >= (- ((*(var_1_4_Pointer)) * (*(var_1_1_Pointer))))) [L66] EXPR \read(*var_1_3_Pointer) [L66] (*(var_1_3_Pointer)) || (256 >= ((*(var_1_17_Pointer)) + 4)) VAL [isInitial=1, last_1_var_1_5=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L66] (*(var_1_3_Pointer)) || (256 >= ((*(var_1_17_Pointer)) + 4)) VAL [isInitial=1, last_1_var_1_5=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L66] COND TRUE (*(var_1_3_Pointer)) || (256 >= ((*(var_1_17_Pointer)) + 4)) [L67] EXPR \read(*var_1_2_Pointer) [L67] EXPR (*(var_1_2_Pointer)) || (*(var_1_3_Pointer)) VAL [isInitial=1, last_1_var_1_5=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L67] EXPR (*(var_1_2_Pointer)) || (*(var_1_3_Pointer)) VAL [isInitial=1, last_1_var_1_5=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L67] EXPR ((*(var_1_2_Pointer)) || (*(var_1_3_Pointer))) || (*(var_1_7_Pointer)) VAL [isInitial=1, last_1_var_1_5=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L67] EXPR ((*(var_1_2_Pointer)) || (*(var_1_3_Pointer))) || (*(var_1_7_Pointer)) VAL [isInitial=1, last_1_var_1_5=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L67] (*(var_1_5_Pointer)) = (((*(var_1_2_Pointer)) || (*(var_1_3_Pointer))) || (*(var_1_7_Pointer))) [L71] EXPR \read(*var_1_11_Pointer) [L71] EXPR \read(*var_1_12_Pointer) [L71] EXPR \read(*var_1_13_Pointer) VAL [isInitial=1, last_1_var_1_5=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L71] EXPR (((*(var_1_13_Pointer))) < (1)) ? ((*(var_1_13_Pointer))) : (1) [L71] EXPR \read(*var_1_13_Pointer) [L71] EXPR (((*(var_1_13_Pointer))) < (1)) ? ((*(var_1_13_Pointer))) : (1) VAL [isInitial=1, last_1_var_1_5=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L71] signed long int stepLocal_1 = ((*(var_1_11_Pointer)) + (*(var_1_12_Pointer))) - (((((*(var_1_13_Pointer))) < (1)) ? ((*(var_1_13_Pointer))) : (1))); [L72] EXPR \read(*var_1_17_Pointer) [L72] signed char stepLocal_0 = (*(var_1_17_Pointer)); [L73] COND FALSE !(-10 >= stepLocal_0) VAL [isInitial=1, last_1_var_1_5=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L131] RET step() [L132] CALL, EXPR property() [L122] EXPR last_1_var_1_5 ? (last_1_var_1_5 ? ((*(var_1_1_Pointer)) == ((double) (((((*(var_1_4_Pointer))) < 0 ) ? -((*(var_1_4_Pointer))) : ((*(var_1_4_Pointer))))))) : 1) : 1 [L122] EXPR last_1_var_1_5 ? (last_1_var_1_5 ? ((*(var_1_1_Pointer)) == ((double) (((((*(var_1_4_Pointer))) < 0 ) ? -((*(var_1_4_Pointer))) : ((*(var_1_4_Pointer))))))) : 1) : 1 VAL [isInitial=1, last_1_var_1_5=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L122] EXPR (last_1_var_1_5 ? (last_1_var_1_5 ? ((*(var_1_1_Pointer)) == ((double) (((((*(var_1_4_Pointer))) < 0 ) ? -((*(var_1_4_Pointer))) : ((*(var_1_4_Pointer))))))) : 1) : 1) && (((*(var_1_3_Pointer)) || (256 >= ((*(var_1_17_Pointer)) + 4))) ? ((*(var_1_5_Pointer)) == ((unsigned char) (((*(var_1_2_Pointer)) || (*(var_1_3_Pointer))) || (*(var_1_7_Pointer))))) : ((*(var_1_5_Pointer)) == ((unsigned char) (! (! ((*(var_1_8_Pointer)) || (*(var_1_9_Pointer)))))))) VAL [isInitial=1, last_1_var_1_5=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L122] EXPR (last_1_var_1_5 ? (last_1_var_1_5 ? ((*(var_1_1_Pointer)) == ((double) (((((*(var_1_4_Pointer))) < 0 ) ? -((*(var_1_4_Pointer))) : ((*(var_1_4_Pointer))))))) : 1) : 1) && (((*(var_1_3_Pointer)) || (256 >= ((*(var_1_17_Pointer)) + 4))) ? ((*(var_1_5_Pointer)) == ((unsigned char) (((*(var_1_2_Pointer)) || (*(var_1_3_Pointer))) || (*(var_1_7_Pointer))))) : ((*(var_1_5_Pointer)) == ((unsigned char) (! (! ((*(var_1_8_Pointer)) || (*(var_1_9_Pointer)))))))) [L122] EXPR \read(*var_1_3_Pointer) [L122] EXPR (*(var_1_3_Pointer)) || (256 >= ((*(var_1_17_Pointer)) + 4)) VAL [isInitial=1, last_1_var_1_5=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L122] EXPR (*(var_1_3_Pointer)) || (256 >= ((*(var_1_17_Pointer)) + 4)) VAL [isInitial=1, last_1_var_1_5=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L122] EXPR ((*(var_1_3_Pointer)) || (256 >= ((*(var_1_17_Pointer)) + 4))) ? ((*(var_1_5_Pointer)) == ((unsigned char) (((*(var_1_2_Pointer)) || (*(var_1_3_Pointer))) || (*(var_1_7_Pointer))))) : ((*(var_1_5_Pointer)) == ((unsigned char) (! (! ((*(var_1_8_Pointer)) || (*(var_1_9_Pointer))))))) [L122] EXPR \read(*var_1_5_Pointer) [L122] EXPR \read(*var_1_2_Pointer) [L122] EXPR (*(var_1_2_Pointer)) || (*(var_1_3_Pointer)) VAL [isInitial=1, last_1_var_1_5=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L122] EXPR (*(var_1_2_Pointer)) || (*(var_1_3_Pointer)) VAL [isInitial=1, last_1_var_1_5=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L122] EXPR ((*(var_1_2_Pointer)) || (*(var_1_3_Pointer))) || (*(var_1_7_Pointer)) VAL [isInitial=1, last_1_var_1_5=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L122] EXPR ((*(var_1_2_Pointer)) || (*(var_1_3_Pointer))) || (*(var_1_7_Pointer)) VAL [isInitial=1, last_1_var_1_5=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L122] EXPR ((*(var_1_3_Pointer)) || (256 >= ((*(var_1_17_Pointer)) + 4))) ? ((*(var_1_5_Pointer)) == ((unsigned char) (((*(var_1_2_Pointer)) || (*(var_1_3_Pointer))) || (*(var_1_7_Pointer))))) : ((*(var_1_5_Pointer)) == ((unsigned char) (! (! ((*(var_1_8_Pointer)) || (*(var_1_9_Pointer))))))) VAL [isInitial=1, last_1_var_1_5=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L122] EXPR (last_1_var_1_5 ? (last_1_var_1_5 ? ((*(var_1_1_Pointer)) == ((double) (((((*(var_1_4_Pointer))) < 0 ) ? -((*(var_1_4_Pointer))) : ((*(var_1_4_Pointer))))))) : 1) : 1) && (((*(var_1_3_Pointer)) || (256 >= ((*(var_1_17_Pointer)) + 4))) ? ((*(var_1_5_Pointer)) == ((unsigned char) (((*(var_1_2_Pointer)) || (*(var_1_3_Pointer))) || (*(var_1_7_Pointer))))) : ((*(var_1_5_Pointer)) == ((unsigned char) (! (! ((*(var_1_8_Pointer)) || (*(var_1_9_Pointer)))))))) VAL [isInitial=1, last_1_var_1_5=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L122] EXPR ((last_1_var_1_5 ? (last_1_var_1_5 ? ((*(var_1_1_Pointer)) == ((double) (((((*(var_1_4_Pointer))) < 0 ) ? -((*(var_1_4_Pointer))) : ((*(var_1_4_Pointer))))))) : 1) : 1) && (((*(var_1_3_Pointer)) || (256 >= ((*(var_1_17_Pointer)) + 4))) ? ((*(var_1_5_Pointer)) == ((unsigned char) (((*(var_1_2_Pointer)) || (*(var_1_3_Pointer))) || (*(var_1_7_Pointer))))) : ((*(var_1_5_Pointer)) == ((unsigned char) (! (! ((*(var_1_8_Pointer)) || (*(var_1_9_Pointer))))))))) && ((-10 >= (*(var_1_17_Pointer))) ? (((((*(var_1_11_Pointer)) + (*(var_1_12_Pointer))) - (((((*(var_1_13_Pointer))) < (1)) ? ((*(var_1_13_Pointer))) : (1)))) > (~ (*(var_1_17_Pointer)))) ? ((*(var_1_10_Pointer)) == ((signed char) ((*(var_1_14_Pointer)) + (*(var_1_15_Pointer))))) : ((*(var_1_10_Pointer)) == ((signed char) (*(var_1_16_Pointer))))) : 1) VAL [isInitial=1, last_1_var_1_5=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L122] EXPR ((last_1_var_1_5 ? (last_1_var_1_5 ? ((*(var_1_1_Pointer)) == ((double) (((((*(var_1_4_Pointer))) < 0 ) ? -((*(var_1_4_Pointer))) : ((*(var_1_4_Pointer))))))) : 1) : 1) && (((*(var_1_3_Pointer)) || (256 >= ((*(var_1_17_Pointer)) + 4))) ? ((*(var_1_5_Pointer)) == ((unsigned char) (((*(var_1_2_Pointer)) || (*(var_1_3_Pointer))) || (*(var_1_7_Pointer))))) : ((*(var_1_5_Pointer)) == ((unsigned char) (! (! ((*(var_1_8_Pointer)) || (*(var_1_9_Pointer))))))))) && ((-10 >= (*(var_1_17_Pointer))) ? (((((*(var_1_11_Pointer)) + (*(var_1_12_Pointer))) - (((((*(var_1_13_Pointer))) < (1)) ? ((*(var_1_13_Pointer))) : (1)))) > (~ (*(var_1_17_Pointer)))) ? ((*(var_1_10_Pointer)) == ((signed char) ((*(var_1_14_Pointer)) + (*(var_1_15_Pointer))))) : ((*(var_1_10_Pointer)) == ((signed char) (*(var_1_16_Pointer))))) : 1) [L122] EXPR \read(*var_1_17_Pointer) VAL [isInitial=1, last_1_var_1_5=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L122] EXPR (-10 >= (*(var_1_17_Pointer))) ? (((((*(var_1_11_Pointer)) + (*(var_1_12_Pointer))) - (((((*(var_1_13_Pointer))) < (1)) ? ((*(var_1_13_Pointer))) : (1)))) > (~ (*(var_1_17_Pointer)))) ? ((*(var_1_10_Pointer)) == ((signed char) ((*(var_1_14_Pointer)) + (*(var_1_15_Pointer))))) : ((*(var_1_10_Pointer)) == ((signed char) (*(var_1_16_Pointer))))) : 1 [L122] EXPR (-10 >= (*(var_1_17_Pointer))) ? (((((*(var_1_11_Pointer)) + (*(var_1_12_Pointer))) - (((((*(var_1_13_Pointer))) < (1)) ? ((*(var_1_13_Pointer))) : (1)))) > (~ (*(var_1_17_Pointer)))) ? ((*(var_1_10_Pointer)) == ((signed char) ((*(var_1_14_Pointer)) + (*(var_1_15_Pointer))))) : ((*(var_1_10_Pointer)) == ((signed char) (*(var_1_16_Pointer))))) : 1 VAL [isInitial=1, last_1_var_1_5=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L122] EXPR ((last_1_var_1_5 ? (last_1_var_1_5 ? ((*(var_1_1_Pointer)) == ((double) (((((*(var_1_4_Pointer))) < 0 ) ? -((*(var_1_4_Pointer))) : ((*(var_1_4_Pointer))))))) : 1) : 1) && (((*(var_1_3_Pointer)) || (256 >= ((*(var_1_17_Pointer)) + 4))) ? ((*(var_1_5_Pointer)) == ((unsigned char) (((*(var_1_2_Pointer)) || (*(var_1_3_Pointer))) || (*(var_1_7_Pointer))))) : ((*(var_1_5_Pointer)) == ((unsigned char) (! (! ((*(var_1_8_Pointer)) || (*(var_1_9_Pointer))))))))) && ((-10 >= (*(var_1_17_Pointer))) ? (((((*(var_1_11_Pointer)) + (*(var_1_12_Pointer))) - (((((*(var_1_13_Pointer))) < (1)) ? ((*(var_1_13_Pointer))) : (1)))) > (~ (*(var_1_17_Pointer)))) ? ((*(var_1_10_Pointer)) == ((signed char) ((*(var_1_14_Pointer)) + (*(var_1_15_Pointer))))) : ((*(var_1_10_Pointer)) == ((signed char) (*(var_1_16_Pointer))))) : 1) VAL [isInitial=1, last_1_var_1_5=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L122] EXPR (((last_1_var_1_5 ? (last_1_var_1_5 ? ((*(var_1_1_Pointer)) == ((double) (((((*(var_1_4_Pointer))) < 0 ) ? -((*(var_1_4_Pointer))) : ((*(var_1_4_Pointer))))))) : 1) : 1) && (((*(var_1_3_Pointer)) || (256 >= ((*(var_1_17_Pointer)) + 4))) ? ((*(var_1_5_Pointer)) == ((unsigned char) (((*(var_1_2_Pointer)) || (*(var_1_3_Pointer))) || (*(var_1_7_Pointer))))) : ((*(var_1_5_Pointer)) == ((unsigned char) (! (! ((*(var_1_8_Pointer)) || (*(var_1_9_Pointer))))))))) && ((-10 >= (*(var_1_17_Pointer))) ? (((((*(var_1_11_Pointer)) + (*(var_1_12_Pointer))) - (((((*(var_1_13_Pointer))) < (1)) ? ((*(var_1_13_Pointer))) : (1)))) > (~ (*(var_1_17_Pointer)))) ? ((*(var_1_10_Pointer)) == ((signed char) ((*(var_1_14_Pointer)) + (*(var_1_15_Pointer))))) : ((*(var_1_10_Pointer)) == ((signed char) (*(var_1_16_Pointer))))) : 1)) && (((*(var_1_1_Pointer)) >= (- ((*(var_1_4_Pointer)) * (*(var_1_1_Pointer))))) ? ((*(var_1_17_Pointer)) == ((signed char) (*(var_1_15_Pointer)))) : 1) VAL [isInitial=1, last_1_var_1_5=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L122] EXPR (((last_1_var_1_5 ? (last_1_var_1_5 ? ((*(var_1_1_Pointer)) == ((double) (((((*(var_1_4_Pointer))) < 0 ) ? -((*(var_1_4_Pointer))) : ((*(var_1_4_Pointer))))))) : 1) : 1) && (((*(var_1_3_Pointer)) || (256 >= ((*(var_1_17_Pointer)) + 4))) ? ((*(var_1_5_Pointer)) == ((unsigned char) (((*(var_1_2_Pointer)) || (*(var_1_3_Pointer))) || (*(var_1_7_Pointer))))) : ((*(var_1_5_Pointer)) == ((unsigned char) (! (! ((*(var_1_8_Pointer)) || (*(var_1_9_Pointer))))))))) && ((-10 >= (*(var_1_17_Pointer))) ? (((((*(var_1_11_Pointer)) + (*(var_1_12_Pointer))) - (((((*(var_1_13_Pointer))) < (1)) ? ((*(var_1_13_Pointer))) : (1)))) > (~ (*(var_1_17_Pointer)))) ? ((*(var_1_10_Pointer)) == ((signed char) ((*(var_1_14_Pointer)) + (*(var_1_15_Pointer))))) : ((*(var_1_10_Pointer)) == ((signed char) (*(var_1_16_Pointer))))) : 1)) && (((*(var_1_1_Pointer)) >= (- ((*(var_1_4_Pointer)) * (*(var_1_1_Pointer))))) ? ((*(var_1_17_Pointer)) == ((signed char) (*(var_1_15_Pointer)))) : 1) [L122] EXPR \read(*var_1_1_Pointer) [L122] EXPR \read(*var_1_4_Pointer) [L122] EXPR \read(*var_1_1_Pointer) VAL [isInitial=1, last_1_var_1_5=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L122] EXPR ((*(var_1_1_Pointer)) >= (- ((*(var_1_4_Pointer)) * (*(var_1_1_Pointer))))) ? ((*(var_1_17_Pointer)) == ((signed char) (*(var_1_15_Pointer)))) : 1 [L122] EXPR \read(*var_1_17_Pointer) [L122] EXPR \read(*var_1_15_Pointer) [L122] EXPR ((*(var_1_1_Pointer)) >= (- ((*(var_1_4_Pointer)) * (*(var_1_1_Pointer))))) ? ((*(var_1_17_Pointer)) == ((signed char) (*(var_1_15_Pointer)))) : 1 VAL [isInitial=1, last_1_var_1_5=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L122] EXPR (((last_1_var_1_5 ? (last_1_var_1_5 ? ((*(var_1_1_Pointer)) == ((double) (((((*(var_1_4_Pointer))) < 0 ) ? -((*(var_1_4_Pointer))) : ((*(var_1_4_Pointer))))))) : 1) : 1) && (((*(var_1_3_Pointer)) || (256 >= ((*(var_1_17_Pointer)) + 4))) ? ((*(var_1_5_Pointer)) == ((unsigned char) (((*(var_1_2_Pointer)) || (*(var_1_3_Pointer))) || (*(var_1_7_Pointer))))) : ((*(var_1_5_Pointer)) == ((unsigned char) (! (! ((*(var_1_8_Pointer)) || (*(var_1_9_Pointer))))))))) && ((-10 >= (*(var_1_17_Pointer))) ? (((((*(var_1_11_Pointer)) + (*(var_1_12_Pointer))) - (((((*(var_1_13_Pointer))) < (1)) ? ((*(var_1_13_Pointer))) : (1)))) > (~ (*(var_1_17_Pointer)))) ? ((*(var_1_10_Pointer)) == ((signed char) ((*(var_1_14_Pointer)) + (*(var_1_15_Pointer))))) : ((*(var_1_10_Pointer)) == ((signed char) (*(var_1_16_Pointer))))) : 1)) && (((*(var_1_1_Pointer)) >= (- ((*(var_1_4_Pointer)) * (*(var_1_1_Pointer))))) ? ((*(var_1_17_Pointer)) == ((signed char) (*(var_1_15_Pointer)))) : 1) VAL [isInitial=1, last_1_var_1_5=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L122-L123] return (((last_1_var_1_5 ? (last_1_var_1_5 ? ((*(var_1_1_Pointer)) == ((double) (((((*(var_1_4_Pointer))) < 0 ) ? -((*(var_1_4_Pointer))) : ((*(var_1_4_Pointer))))))) : 1) : 1) && (((*(var_1_3_Pointer)) || (256 >= ((*(var_1_17_Pointer)) + 4))) ? ((*(var_1_5_Pointer)) == ((unsigned char) (((*(var_1_2_Pointer)) || (*(var_1_3_Pointer))) || (*(var_1_7_Pointer))))) : ((*(var_1_5_Pointer)) == ((unsigned char) (! (! ((*(var_1_8_Pointer)) || (*(var_1_9_Pointer))))))))) && ((-10 >= (*(var_1_17_Pointer))) ? (((((*(var_1_11_Pointer)) + (*(var_1_12_Pointer))) - (((((*(var_1_13_Pointer))) < (1)) ? ((*(var_1_13_Pointer))) : (1)))) > (~ (*(var_1_17_Pointer)))) ? ((*(var_1_10_Pointer)) == ((signed char) ((*(var_1_14_Pointer)) + (*(var_1_15_Pointer))))) : ((*(var_1_10_Pointer)) == ((signed char) (*(var_1_16_Pointer))))) : 1)) && (((*(var_1_1_Pointer)) >= (- ((*(var_1_4_Pointer)) * (*(var_1_1_Pointer))))) ? ((*(var_1_17_Pointer)) == ((signed char) (*(var_1_15_Pointer)))) : 1) ; [L132] RET, EXPR property() [L132] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_5=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L19] reach_error() VAL [isInitial=1, last_1_var_1_5=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_14={16:0}, var_1_14_Pointer={16:0}, var_1_15={17:0}, var_1_15_Pointer={17:0}, var_1_16={18:0}, var_1_16_Pointer={18:0}, var_1_17={19:0}, var_1_17_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 120 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.9s, OverallIterations: 23, TraceHistogramMax: 23, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2129 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2129 mSDsluCounter, 14166 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10236 mSDsCounter, 442 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1026 IncrementalHoareTripleChecker+Invalid, 1468 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 442 mSolverCounterUnsat, 3930 mSDtfsCounter, 1026 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 682 GetRequests, 569 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=620occurred in iteration=22, InterpolantAutomatonStates: 120, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 22 MinimizatonAttempts, 454 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 5.8s InterpolantComputationTime, 4628 NumberOfCodeBlocks, 4628 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 4419 ConstructedInterpolants, 0 QuantifiedInterpolants, 7227 SizeOfPredicates, 0 NumberOfNonLiveVariables, 2097 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 25 InterpolantComputations, 22 PerfectInterpolantSequences, 25124/25300 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-22 12:55:11,168 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-34.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 4ff4fe5bed554c7ec6fbe4f6b5cd49cac5ee3ddab40bbec1d152ed8b04a5b8b9 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 12:55:13,045 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 12:55:13,108 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-22 12:55:13,112 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 12:55:13,113 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 12:55:13,140 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 12:55:13,142 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 12:55:13,142 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 12:55:13,142 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 12:55:13,143 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 12:55:13,143 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 12:55:13,143 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 12:55:13,144 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 12:55:13,144 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 12:55:13,145 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 12:55:13,146 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 12:55:13,146 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 12:55:13,147 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 12:55:13,147 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 12:55:13,147 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 12:55:13,147 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 12:55:13,150 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 12:55:13,150 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 12:55:13,150 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-22 12:55:13,150 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-22 12:55:13,150 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 12:55:13,150 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-22 12:55:13,150 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 12:55:13,151 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 12:55:13,151 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 12:55:13,151 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 12:55:13,151 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 12:55:13,151 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 12:55:13,151 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 12:55:13,152 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 12:55:13,160 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 12:55:13,161 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 12:55:13,161 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 12:55:13,161 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-22 12:55:13,161 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-22 12:55:13,161 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 12:55:13,162 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 12:55:13,162 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 12:55:13,162 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 12:55:13,163 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 4ff4fe5bed554c7ec6fbe4f6b5cd49cac5ee3ddab40bbec1d152ed8b04a5b8b9 [2024-11-22 12:55:13,453 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 12:55:13,471 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 12:55:13,474 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 12:55:13,476 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 12:55:13,476 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 12:55:13,477 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-34.i [2024-11-22 12:55:14,781 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 12:55:14,966 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 12:55:14,966 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-34.i [2024-11-22 12:55:14,977 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/482f66a3d/0faf0be97eea4235b68711300a201658/FLAG812e55d8e [2024-11-22 12:55:14,992 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/482f66a3d/0faf0be97eea4235b68711300a201658 [2024-11-22 12:55:14,995 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 12:55:14,996 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 12:55:14,999 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 12:55:14,999 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 12:55:15,003 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 12:55:15,004 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 12:55:14" (1/1) ... [2024-11-22 12:55:15,005 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69f064c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:55:15, skipping insertion in model container [2024-11-22 12:55:15,005 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 12:55:14" (1/1) ... [2024-11-22 12:55:15,028 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 12:55:15,191 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-34.i[916,929] [2024-11-22 12:55:15,252 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 12:55:15,273 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 12:55:15,285 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-34.i[916,929] [2024-11-22 12:55:15,323 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 12:55:15,345 INFO L204 MainTranslator]: Completed translation [2024-11-22 12:55:15,345 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:55:15 WrapperNode [2024-11-22 12:55:15,345 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 12:55:15,346 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 12:55:15,346 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 12:55:15,346 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 12:55:15,352 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:55:15" (1/1) ... [2024-11-22 12:55:15,366 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:55:15" (1/1) ... [2024-11-22 12:55:15,410 INFO L138 Inliner]: procedures = 30, calls = 165, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 478 [2024-11-22 12:55:15,410 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 12:55:15,411 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 12:55:15,411 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 12:55:15,411 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 12:55:15,421 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:55:15" (1/1) ... [2024-11-22 12:55:15,421 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:55:15" (1/1) ... [2024-11-22 12:55:15,426 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:55:15" (1/1) ... [2024-11-22 12:55:15,462 INFO L175 MemorySlicer]: Split 115 memory accesses to 17 slices as follows [2, 7, 6, 8, 14, 6, 6, 6, 6, 5, 6, 6, 8, 6, 8, 6, 9]. 12 percent of accesses are in the largest equivalence class. The 18 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 18 writes are split as follows [0, 1, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1]. [2024-11-22 12:55:15,463 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:55:15" (1/1) ... [2024-11-22 12:55:15,463 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:55:15" (1/1) ... [2024-11-22 12:55:15,487 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:55:15" (1/1) ... [2024-11-22 12:55:15,494 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:55:15" (1/1) ... [2024-11-22 12:55:15,502 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:55:15" (1/1) ... [2024-11-22 12:55:15,509 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:55:15" (1/1) ... [2024-11-22 12:55:15,522 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 12:55:15,526 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 12:55:15,526 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 12:55:15,526 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 12:55:15,527 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:55:15" (1/1) ... [2024-11-22 12:55:15,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 12:55:15,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 12:55:15,567 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-22 12:55:15,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-22 12:55:15,606 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 12:55:15,607 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-22 12:55:15,607 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-22 12:55:15,607 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2024-11-22 12:55:15,607 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2024-11-22 12:55:15,607 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2024-11-22 12:55:15,607 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2024-11-22 12:55:15,607 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#6 [2024-11-22 12:55:15,607 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#7 [2024-11-22 12:55:15,607 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#8 [2024-11-22 12:55:15,607 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#9 [2024-11-22 12:55:15,607 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#10 [2024-11-22 12:55:15,608 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#11 [2024-11-22 12:55:15,608 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#12 [2024-11-22 12:55:15,608 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#13 [2024-11-22 12:55:15,608 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#14 [2024-11-22 12:55:15,608 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#15 [2024-11-22 12:55:15,608 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#16 [2024-11-22 12:55:15,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-22 12:55:15,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-22 12:55:15,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2024-11-22 12:55:15,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2024-11-22 12:55:15,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2024-11-22 12:55:15,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2024-11-22 12:55:15,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#6 [2024-11-22 12:55:15,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#7 [2024-11-22 12:55:15,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#8 [2024-11-22 12:55:15,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#9 [2024-11-22 12:55:15,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#10 [2024-11-22 12:55:15,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#11 [2024-11-22 12:55:15,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#12 [2024-11-22 12:55:15,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#13 [2024-11-22 12:55:15,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#14 [2024-11-22 12:55:15,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#15 [2024-11-22 12:55:15,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#16 [2024-11-22 12:55:15,609 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-22 12:55:15,609 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-22 12:55:15,609 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-22 12:55:15,610 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-22 12:55:15,610 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-11-22 12:55:15,610 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-11-22 12:55:15,610 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2024-11-22 12:55:15,610 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7 [2024-11-22 12:55:15,610 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#8 [2024-11-22 12:55:15,610 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#9 [2024-11-22 12:55:15,610 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#10 [2024-11-22 12:55:15,610 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#11 [2024-11-22 12:55:15,610 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#12 [2024-11-22 12:55:15,610 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#13 [2024-11-22 12:55:15,610 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#14 [2024-11-22 12:55:15,610 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#15 [2024-11-22 12:55:15,610 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#16 [2024-11-22 12:55:15,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-22 12:55:15,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-22 12:55:15,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-22 12:55:15,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-22 12:55:15,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-22 12:55:15,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-11-22 12:55:15,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2024-11-22 12:55:15,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2024-11-22 12:55:15,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#8 [2024-11-22 12:55:15,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#9 [2024-11-22 12:55:15,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#10 [2024-11-22 12:55:15,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#11 [2024-11-22 12:55:15,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#12 [2024-11-22 12:55:15,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#13 [2024-11-22 12:55:15,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#14 [2024-11-22 12:55:15,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#15 [2024-11-22 12:55:15,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#16 [2024-11-22 12:55:15,612 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-11-22 12:55:15,612 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-11-22 12:55:15,612 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2024-11-22 12:55:15,612 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2024-11-22 12:55:15,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2024-11-22 12:55:15,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2024-11-22 12:55:15,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#6 [2024-11-22 12:55:15,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#7 [2024-11-22 12:55:15,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#8 [2024-11-22 12:55:15,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#9 [2024-11-22 12:55:15,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#10 [2024-11-22 12:55:15,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#11 [2024-11-22 12:55:15,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#12 [2024-11-22 12:55:15,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#13 [2024-11-22 12:55:15,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#14 [2024-11-22 12:55:15,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#15 [2024-11-22 12:55:15,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#16 [2024-11-22 12:55:15,614 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-22 12:55:15,614 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-22 12:55:15,614 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 12:55:15,614 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 12:55:15,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-22 12:55:15,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-22 12:55:15,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-22 12:55:15,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-22 12:55:15,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-11-22 12:55:15,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-11-22 12:55:15,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2024-11-22 12:55:15,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7 [2024-11-22 12:55:15,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#8 [2024-11-22 12:55:15,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#9 [2024-11-22 12:55:15,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#10 [2024-11-22 12:55:15,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#11 [2024-11-22 12:55:15,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#12 [2024-11-22 12:55:15,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#13 [2024-11-22 12:55:15,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#14 [2024-11-22 12:55:15,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#15 [2024-11-22 12:55:15,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#16 [2024-11-22 12:55:15,768 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 12:55:15,770 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 12:55:24,383 INFO L? ?]: Removed 91 outVars from TransFormulas that were not future-live. [2024-11-22 12:55:24,384 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 12:55:24,399 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 12:55:24,400 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-22 12:55:24,400 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:55:24 BoogieIcfgContainer [2024-11-22 12:55:24,400 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 12:55:24,402 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 12:55:24,402 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 12:55:24,405 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 12:55:24,405 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 12:55:14" (1/3) ... [2024-11-22 12:55:24,406 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@315e5e15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 12:55:24, skipping insertion in model container [2024-11-22 12:55:24,406 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:55:15" (2/3) ... [2024-11-22 12:55:24,406 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@315e5e15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 12:55:24, skipping insertion in model container [2024-11-22 12:55:24,407 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:55:24" (3/3) ... [2024-11-22 12:55:24,408 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-34.i [2024-11-22 12:55:24,422 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 12:55:24,423 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-22 12:55:24,476 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 12:55:24,482 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;@1f395af0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 12:55:24,482 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-22 12:55:24,485 INFO L276 IsEmpty]: Start isEmpty. Operand has 120 states, 94 states have (on average 1.372340425531915) internal successors, (129), 95 states have internal predecessors, (129), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-22 12:55:24,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-22 12:55:24,495 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:55:24,496 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:55:24,496 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:55:24,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:55:24,500 INFO L85 PathProgramCache]: Analyzing trace with hash -1856483357, now seen corresponding path program 1 times [2024-11-22 12:55:24,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:55:24,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [853273957] [2024-11-22 12:55:24,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:55:24,510 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-22 12:55:24,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:55:24,512 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-22 12:55:24,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-22 12:55:24,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:55:24,934 INFO L255 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-22 12:55:24,946 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:55:24,977 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 524 proven. 0 refuted. 0 times theorem prover too weak. 488 trivial. 0 not checked. [2024-11-22 12:55:24,978 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 12:55:24,978 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:55:24,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [853273957] [2024-11-22 12:55:24,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [853273957] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:55:24,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:55:24,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 12:55:24,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635741711] [2024-11-22 12:55:24,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:55:24,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-22 12:55:24,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:55:25,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-22 12:55:25,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 12:55:25,008 INFO L87 Difference]: Start difference. First operand has 120 states, 94 states have (on average 1.372340425531915) internal successors, (129), 95 states have internal predecessors, (129), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-22 12:55:25,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:55:25,041 INFO L93 Difference]: Finished difference Result 233 states and 367 transitions. [2024-11-22 12:55:25,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-22 12:55:25,043 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 171 [2024-11-22 12:55:25,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:55:25,048 INFO L225 Difference]: With dead ends: 233 [2024-11-22 12:55:25,048 INFO L226 Difference]: Without dead ends: 116 [2024-11-22 12:55:25,051 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 170 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-22 12:55:25,053 INFO L432 NwaCegarLoop]: 168 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, 168 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-22 12:55:25,054 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 12:55:25,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-22 12:55:25,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2024-11-22 12:55:25,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 91 states have (on average 1.3406593406593406) internal successors, (122), 91 states have internal predecessors, (122), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-22 12:55:25,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 168 transitions. [2024-11-22 12:55:25,108 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 168 transitions. Word has length 171 [2024-11-22 12:55:25,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:55:25,108 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 168 transitions. [2024-11-22 12:55:25,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-22 12:55:25,109 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 168 transitions. [2024-11-22 12:55:25,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-22 12:55:25,113 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:55:25,113 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:55:25,129 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-22 12:55:25,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-22 12:55:25,314 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:55:25,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:55:25,315 INFO L85 PathProgramCache]: Analyzing trace with hash 95317121, now seen corresponding path program 1 times [2024-11-22 12:55:25,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:55:25,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1098684246] [2024-11-22 12:55:25,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:55:25,316 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-22 12:55:25,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:55:25,317 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-22 12:55:25,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-22 12:55:25,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:55:25,706 INFO L255 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-22 12:55:25,714 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:55:25,771 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-22 12:55:25,771 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 12:55:25,771 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:55:25,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1098684246] [2024-11-22 12:55:25,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1098684246] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:55:25,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:55:25,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 12:55:25,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045891968] [2024-11-22 12:55:25,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:55:25,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 12:55:25,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:55:25,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 12:55:25,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 12:55:25,777 INFO L87 Difference]: Start difference. First operand 116 states and 168 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-22 12:55:25,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:55:25,818 INFO L93 Difference]: Finished difference Result 227 states and 330 transitions. [2024-11-22 12:55:25,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 12:55:25,818 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 171 [2024-11-22 12:55:25,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:55:25,820 INFO L225 Difference]: With dead ends: 227 [2024-11-22 12:55:25,820 INFO L226 Difference]: Without dead ends: 114 [2024-11-22 12:55:25,821 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 12:55:25,821 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 0 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 12:55:25,822 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 321 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 12:55:25,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-22 12:55:25,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2024-11-22 12:55:25,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 89 states have (on average 1.3258426966292134) internal successors, (118), 89 states have internal predecessors, (118), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-22 12:55:25,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 164 transitions. [2024-11-22 12:55:25,830 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 164 transitions. Word has length 171 [2024-11-22 12:55:25,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:55:25,832 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 164 transitions. [2024-11-22 12:55:25,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-22 12:55:25,832 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 164 transitions. [2024-11-22 12:55:25,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-22 12:55:25,834 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:55:25,834 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:55:25,845 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-22 12:55:26,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-22 12:55:26,035 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:55:26,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:55:26,035 INFO L85 PathProgramCache]: Analyzing trace with hash -1527252011, now seen corresponding path program 1 times [2024-11-22 12:55:26,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:55:26,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [97199128] [2024-11-22 12:55:26,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:55:26,036 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-22 12:55:26,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:55:26,038 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-22 12:55:26,039 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-22 12:55:26,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:55:26,440 INFO L255 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-22 12:55:26,444 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:55:26,504 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-22 12:55:26,504 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 12:55:26,504 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:55:26,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [97199128] [2024-11-22 12:55:26,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [97199128] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:55:26,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:55:26,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 12:55:26,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283843748] [2024-11-22 12:55:26,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:55:26,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 12:55:26,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:55:26,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 12:55:26,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 12:55:26,506 INFO L87 Difference]: Start difference. First operand 114 states and 164 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-22 12:55:26,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:55:26,583 INFO L93 Difference]: Finished difference Result 227 states and 328 transitions. [2024-11-22 12:55:26,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 12:55:26,584 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 173 [2024-11-22 12:55:26,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:55:26,585 INFO L225 Difference]: With dead ends: 227 [2024-11-22 12:55:26,585 INFO L226 Difference]: Without dead ends: 116 [2024-11-22 12:55:26,586 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 170 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-22 12:55:26,587 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 0 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 12:55:26,587 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 475 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 12:55:26,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-22 12:55:26,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2024-11-22 12:55:26,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 91 states have (on average 1.3186813186813187) internal successors, (120), 91 states have internal predecessors, (120), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-22 12:55:26,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 166 transitions. [2024-11-22 12:55:26,595 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 166 transitions. Word has length 173 [2024-11-22 12:55:26,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:55:26,596 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 166 transitions. [2024-11-22 12:55:26,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-22 12:55:26,596 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 166 transitions. [2024-11-22 12:55:26,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-22 12:55:26,598 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:55:26,598 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:55:26,609 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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)] Forceful destruction successful, exit code 0 [2024-11-22 12:55:26,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-22 12:55:26,799 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:55:26,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:55:26,799 INFO L85 PathProgramCache]: Analyzing trace with hash 2106472359, now seen corresponding path program 1 times [2024-11-22 12:55:26,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:55:26,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1643234555] [2024-11-22 12:55:26,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:55:26,800 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-22 12:55:26,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:55:26,802 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-22 12:55:26,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-22 12:55:27,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:55:27,179 INFO L255 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-22 12:55:27,183 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:55:27,278 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 17 treesize of output 9 [2024-11-22 12:55:28,045 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-22 12:55:28,046 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 12:55:28,046 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:55:28,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1643234555] [2024-11-22 12:55:28,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1643234555] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:55:28,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:55:28,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 12:55:28,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529426641] [2024-11-22 12:55:28,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:55:28,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 12:55:28,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:55:28,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 12:55:28,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 12:55:28,048 INFO L87 Difference]: Start difference. First operand 116 states and 166 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-22 12:55:28,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:55:28,200 INFO L93 Difference]: Finished difference Result 344 states and 494 transitions. [2024-11-22 12:55:28,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 12:55:28,200 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 175 [2024-11-22 12:55:28,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:55:28,202 INFO L225 Difference]: With dead ends: 344 [2024-11-22 12:55:28,202 INFO L226 Difference]: Without dead ends: 231 [2024-11-22 12:55:28,203 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-22 12:55:28,204 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 112 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 12:55:28,204 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 468 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 12:55:28,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2024-11-22 12:55:28,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 191. [2024-11-22 12:55:28,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 142 states have (on average 1.2746478873239437) internal successors, (181), 142 states have internal predecessors, (181), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-22 12:55:28,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 273 transitions. [2024-11-22 12:55:28,220 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 273 transitions. Word has length 175 [2024-11-22 12:55:28,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:55:28,221 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 273 transitions. [2024-11-22 12:55:28,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-22 12:55:28,221 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 273 transitions. [2024-11-22 12:55:28,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-22 12:55:28,222 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:55:28,225 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:55:28,238 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-22 12:55:28,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-22 12:55:28,430 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:55:28,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:55:28,430 INFO L85 PathProgramCache]: Analyzing trace with hash 617898223, now seen corresponding path program 1 times [2024-11-22 12:55:28,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:55:28,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2039066029] [2024-11-22 12:55:28,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:55:28,431 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-22 12:55:28,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:55:28,433 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-22 12:55:28,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-22 12:55:28,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:55:28,821 INFO L255 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-22 12:55:28,825 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:55:30,095 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 19 proven. 297 refuted. 0 times theorem prover too weak. 696 trivial. 0 not checked. [2024-11-22 12:55:30,096 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 12:55:30,418 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-22 12:55:30,418 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:55:30,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2039066029] [2024-11-22 12:55:30,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2039066029] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-22 12:55:30,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 12:55:30,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 12 [2024-11-22 12:55:30,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226001925] [2024-11-22 12:55:30,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:55:30,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 12:55:30,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:55:30,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 12:55:30,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-22 12:55:30,420 INFO L87 Difference]: Start difference. First operand 191 states and 273 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-22 12:55:30,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:55:30,546 INFO L93 Difference]: Finished difference Result 389 states and 551 transitions. [2024-11-22 12:55:30,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 12:55:30,546 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 178 [2024-11-22 12:55:30,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:55:30,548 INFO L225 Difference]: With dead ends: 389 [2024-11-22 12:55:30,548 INFO L226 Difference]: Without dead ends: 260 [2024-11-22 12:55:30,548 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 344 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-11-22 12:55:30,549 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 116 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 12:55:30,549 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 445 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 12:55:30,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2024-11-22 12:55:30,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 257. [2024-11-22 12:55:30,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 204 states have (on average 1.2941176470588236) internal successors, (264), 205 states have internal predecessors, (264), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-22 12:55:30,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 360 transitions. [2024-11-22 12:55:30,570 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 360 transitions. Word has length 178 [2024-11-22 12:55:30,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:55:30,570 INFO L471 AbstractCegarLoop]: Abstraction has 257 states and 360 transitions. [2024-11-22 12:55:30,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-22 12:55:30,571 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 360 transitions. [2024-11-22 12:55:30,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-22 12:55:30,572 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:55:30,572 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:55:30,584 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-22 12:55:30,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-22 12:55:30,773 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:55:30,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:55:30,774 INFO L85 PathProgramCache]: Analyzing trace with hash -49751333, now seen corresponding path program 1 times [2024-11-22 12:55:30,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:55:30,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [745770621] [2024-11-22 12:55:30,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:55:30,774 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-22 12:55:30,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:55:30,775 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-22 12:55:30,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-22 12:55:31,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:55:31,128 INFO L255 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-22 12:55:31,133 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:55:32,055 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-22 12:55:32,276 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 17 treesize of output 9 [2024-11-22 12:55:32,509 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 21 proven. 151 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-22 12:55:32,509 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 12:55:33,655 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-22 12:55:33,655 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:55:33,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [745770621] [2024-11-22 12:55:33,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [745770621] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-22 12:55:33,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 12:55:33,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16] total 23 [2024-11-22 12:55:33,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428654085] [2024-11-22 12:55:33,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:55:33,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-22 12:55:33,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:55:33,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-22 12:55:33,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=446, Unknown=0, NotChecked=0, Total=506 [2024-11-22 12:55:33,657 INFO L87 Difference]: Start difference. First operand 257 states and 360 transitions. Second operand has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-22 12:55:34,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:55:34,616 INFO L93 Difference]: Finished difference Result 568 states and 796 transitions. [2024-11-22 12:55:34,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-22 12:55:34,617 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 180 [2024-11-22 12:55:34,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:55:34,620 INFO L225 Difference]: With dead ends: 568 [2024-11-22 12:55:34,621 INFO L226 Difference]: Without dead ends: 377 [2024-11-22 12:55:34,621 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 337 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=85, Invalid=727, Unknown=0, NotChecked=0, Total=812 [2024-11-22 12:55:34,622 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 56 mSDsluCounter, 1254 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 1397 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-22 12:55:34,622 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 1397 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-22 12:55:34,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2024-11-22 12:55:34,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 331. [2024-11-22 12:55:34,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 278 states have (on average 1.3201438848920863) internal successors, (367), 279 states have internal predecessors, (367), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-22 12:55:34,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 463 transitions. [2024-11-22 12:55:34,637 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 463 transitions. Word has length 180 [2024-11-22 12:55:34,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:55:34,638 INFO L471 AbstractCegarLoop]: Abstraction has 331 states and 463 transitions. [2024-11-22 12:55:34,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-22 12:55:34,638 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 463 transitions. [2024-11-22 12:55:34,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-22 12:55:34,639 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:55:34,639 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:55:34,652 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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)] Forceful destruction successful, exit code 0 [2024-11-22 12:55:34,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-22 12:55:34,840 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:55:34,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:55:34,841 INFO L85 PathProgramCache]: Analyzing trace with hash 651313245, now seen corresponding path program 1 times [2024-11-22 12:55:34,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:55:34,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [260268054] [2024-11-22 12:55:34,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:55:34,842 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-22 12:55:34,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:55:34,844 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-22 12:55:34,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (8)] Waiting until timeout for monitored process [2024-11-22 12:55:35,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:55:35,217 INFO L255 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-22 12:55:35,220 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:55:36,228 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 21 proven. 151 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-22 12:55:36,229 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 12:55:36,635 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-22 12:55:36,635 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:55:36,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [260268054] [2024-11-22 12:55:36,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [260268054] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-22 12:55:36,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 12:55:36,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 13 [2024-11-22 12:55:36,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559605553] [2024-11-22 12:55:36,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:55:36,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 12:55:36,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:55:36,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 12:55:36,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-11-22 12:55:36,636 INFO L87 Difference]: Start difference. First operand 331 states and 463 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-22 12:55:36,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:55:36,866 INFO L93 Difference]: Finished difference Result 702 states and 982 transitions. [2024-11-22 12:55:36,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-22 12:55:36,867 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 180 [2024-11-22 12:55:36,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:55:36,870 INFO L225 Difference]: With dead ends: 702 [2024-11-22 12:55:36,871 INFO L226 Difference]: Without dead ends: 437 [2024-11-22 12:55:36,873 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 347 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2024-11-22 12:55:36,873 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 49 mSDsluCounter, 588 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 740 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 12:55:36,873 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 740 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 12:55:36,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2024-11-22 12:55:36,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 389. [2024-11-22 12:55:36,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 336 states have (on average 1.3154761904761905) internal successors, (442), 337 states have internal predecessors, (442), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-22 12:55:36,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 538 transitions. [2024-11-22 12:55:36,891 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 538 transitions. Word has length 180 [2024-11-22 12:55:36,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:55:36,891 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 538 transitions. [2024-11-22 12:55:36,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-22 12:55:36,892 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 538 transitions. [2024-11-22 12:55:36,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-22 12:55:36,893 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:55:36,893 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:55:36,905 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (8)] Ended with exit code 0 [2024-11-22 12:55:37,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-22 12:55:37,094 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:55:37,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:55:37,094 INFO L85 PathProgramCache]: Analyzing trace with hash 90797277, now seen corresponding path program 1 times [2024-11-22 12:55:37,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:55:37,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1487015726] [2024-11-22 12:55:37,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:55:37,095 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-22 12:55:37,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:55:37,096 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-22 12:55:37,097 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (9)] Waiting until timeout for monitored process [2024-11-22 12:55:37,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:55:37,438 INFO L255 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-22 12:55:37,441 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:55:37,459 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-22 12:55:37,460 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 12:55:37,460 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:55:37,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1487015726] [2024-11-22 12:55:37,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1487015726] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:55:37,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:55:37,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 12:55:37,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646264522] [2024-11-22 12:55:37,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:55:37,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 12:55:37,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:55:37,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 12:55:37,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 12:55:37,463 INFO L87 Difference]: Start difference. First operand 389 states and 538 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-22 12:55:37,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:55:37,490 INFO L93 Difference]: Finished difference Result 662 states and 915 transitions. [2024-11-22 12:55:37,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 12:55:37,493 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 180 [2024-11-22 12:55:37,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:55:37,496 INFO L225 Difference]: With dead ends: 662 [2024-11-22 12:55:37,496 INFO L226 Difference]: Without dead ends: 339 [2024-11-22 12:55:37,496 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 177 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-22 12:55:37,497 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 1 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 12:55:37,497 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 463 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 12:55:37,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2024-11-22 12:55:37,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 335. [2024-11-22 12:55:37,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 282 states have (on average 1.2872340425531914) internal successors, (363), 283 states have internal predecessors, (363), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-22 12:55:37,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 459 transitions. [2024-11-22 12:55:37,506 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 459 transitions. Word has length 180 [2024-11-22 12:55:37,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:55:37,508 INFO L471 AbstractCegarLoop]: Abstraction has 335 states and 459 transitions. [2024-11-22 12:55:37,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-22 12:55:37,514 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 459 transitions. [2024-11-22 12:55:37,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-22 12:55:37,515 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:55:37,515 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:55:37,527 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (9)] Forceful destruction successful, exit code 0 [2024-11-22 12:55:37,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-22 12:55:37,716 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:55:37,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:55:37,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1873476701, now seen corresponding path program 1 times [2024-11-22 12:55:37,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:55:37,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1581135348] [2024-11-22 12:55:37,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:55:37,717 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-22 12:55:37,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:55:37,718 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-22 12:55:37,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (10)] Waiting until timeout for monitored process [2024-11-22 12:55:38,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:55:38,059 INFO L255 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-22 12:55:38,063 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:55:38,700 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 21 proven. 151 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-22 12:55:38,700 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 12:55:38,892 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-22 12:55:38,893 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:55:38,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1581135348] [2024-11-22 12:55:38,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1581135348] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-22 12:55:38,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 12:55:38,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 11 [2024-11-22 12:55:38,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268144846] [2024-11-22 12:55:38,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:55:38,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 12:55:38,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:55:38,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 12:55:38,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-22 12:55:38,894 INFO L87 Difference]: Start difference. First operand 335 states and 459 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-22 12:55:38,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:55:38,985 INFO L93 Difference]: Finished difference Result 638 states and 875 transitions. [2024-11-22 12:55:38,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 12:55:38,986 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 180 [2024-11-22 12:55:38,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:55:38,988 INFO L225 Difference]: With dead ends: 638 [2024-11-22 12:55:38,988 INFO L226 Difference]: Without dead ends: 369 [2024-11-22 12:55:38,989 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 349 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-22 12:55:38,989 INFO L432 NwaCegarLoop]: 197 mSDtfsCounter, 93 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 12:55:38,989 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 532 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 12:55:38,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2024-11-22 12:55:38,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 331. [2024-11-22 12:55:38,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 278 states have (on average 1.2841726618705036) internal successors, (357), 279 states have internal predecessors, (357), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-22 12:55:38,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 453 transitions. [2024-11-22 12:55:39,000 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 453 transitions. Word has length 180 [2024-11-22 12:55:39,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:55:39,001 INFO L471 AbstractCegarLoop]: Abstraction has 331 states and 453 transitions. [2024-11-22 12:55:39,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-22 12:55:39,001 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 453 transitions. [2024-11-22 12:55:39,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-22 12:55:39,003 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:55:39,003 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:55:39,019 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (10)] Forceful destruction successful, exit code 0 [2024-11-22 12:55:39,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-22 12:55:39,204 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:55:39,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:55:39,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1286670687, now seen corresponding path program 1 times [2024-11-22 12:55:39,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:55:39,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1261434173] [2024-11-22 12:55:39,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:55:39,205 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-22 12:55:39,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:55:39,206 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-22 12:55:39,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (11)] Waiting until timeout for monitored process [2024-11-22 12:55:39,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:55:39,569 INFO L255 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-22 12:55:39,573 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:55:40,949 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-22 12:55:41,214 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 17 treesize of output 9 [2024-11-22 12:55:41,507 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 19 proven. 297 refuted. 0 times theorem prover too weak. 696 trivial. 0 not checked. [2024-11-22 12:55:41,507 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 12:55:42,609 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-22 12:55:42,610 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:55:42,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1261434173] [2024-11-22 12:55:42,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1261434173] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-22 12:55:42,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 12:55:42,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [18] total 25 [2024-11-22 12:55:42,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712617194] [2024-11-22 12:55:42,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:55:42,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-22 12:55:42,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:55:42,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-22 12:55:42,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=536, Unknown=0, NotChecked=0, Total=600 [2024-11-22 12:55:42,611 INFO L87 Difference]: Start difference. First operand 331 states and 453 transitions. Second operand has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-22 12:55:43,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:55:43,519 INFO L93 Difference]: Finished difference Result 719 states and 979 transitions. [2024-11-22 12:55:43,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-22 12:55:43,519 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 180 [2024-11-22 12:55:43,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:55:43,521 INFO L225 Difference]: With dead ends: 719 [2024-11-22 12:55:43,521 INFO L226 Difference]: Without dead ends: 454 [2024-11-22 12:55:43,522 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 335 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=92, Invalid=838, Unknown=0, NotChecked=0, Total=930 [2024-11-22 12:55:43,522 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 62 mSDsluCounter, 1626 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 1822 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-22 12:55:43,523 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 1822 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-22 12:55:43,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2024-11-22 12:55:43,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 385. [2024-11-22 12:55:43,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 332 states have (on average 1.3042168674698795) internal successors, (433), 333 states have internal predecessors, (433), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-22 12:55:43,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 529 transitions. [2024-11-22 12:55:43,537 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 529 transitions. Word has length 180 [2024-11-22 12:55:43,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:55:43,537 INFO L471 AbstractCegarLoop]: Abstraction has 385 states and 529 transitions. [2024-11-22 12:55:43,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-22 12:55:43,538 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 529 transitions. [2024-11-22 12:55:43,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-22 12:55:43,538 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:55:43,539 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:55:43,551 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (11)] Forceful destruction successful, exit code 0 [2024-11-22 12:55:43,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-22 12:55:43,739 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:55:43,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:55:43,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1987735265, now seen corresponding path program 1 times [2024-11-22 12:55:43,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:55:43,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [201220151] [2024-11-22 12:55:43,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:55:43,740 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-22 12:55:43,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:55:43,741 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-22 12:55:43,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (12)] Waiting until timeout for monitored process [2024-11-22 12:55:44,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:55:44,095 INFO L255 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-22 12:55:44,099 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:55:45,096 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 19 proven. 297 refuted. 0 times theorem prover too weak. 696 trivial. 0 not checked. [2024-11-22 12:55:45,097 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 12:55:45,451 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-22 12:55:45,452 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:55:45,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [201220151] [2024-11-22 12:55:45,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [201220151] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-22 12:55:45,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 12:55:45,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 13 [2024-11-22 12:55:45,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759859265] [2024-11-22 12:55:45,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:55:45,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 12:55:45,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:55:45,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 12:55:45,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-11-22 12:55:45,453 INFO L87 Difference]: Start difference. First operand 385 states and 529 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-22 12:55:45,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:55:45,704 INFO L93 Difference]: Finished difference Result 743 states and 1015 transitions. [2024-11-22 12:55:45,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-22 12:55:45,705 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 180 [2024-11-22 12:55:45,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:55:45,708 INFO L225 Difference]: With dead ends: 743 [2024-11-22 12:55:45,708 INFO L226 Difference]: Without dead ends: 424 [2024-11-22 12:55:45,709 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 347 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2024-11-22 12:55:45,710 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 58 mSDsluCounter, 582 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 733 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 12:55:45,710 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 733 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 12:55:45,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2024-11-22 12:55:45,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 387. [2024-11-22 12:55:45,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 387 states, 334 states have (on average 1.2994011976047903) internal successors, (434), 335 states have internal predecessors, (434), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-22 12:55:45,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 530 transitions. [2024-11-22 12:55:45,725 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 530 transitions. Word has length 180 [2024-11-22 12:55:45,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:55:45,726 INFO L471 AbstractCegarLoop]: Abstraction has 387 states and 530 transitions. [2024-11-22 12:55:45,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-22 12:55:45,726 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 530 transitions. [2024-11-22 12:55:45,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-22 12:55:45,728 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:55:45,728 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:55:45,740 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (12)] Ended with exit code 0 [2024-11-22 12:55:45,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-22 12:55:45,929 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:55:45,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:55:45,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1427219297, now seen corresponding path program 1 times [2024-11-22 12:55:45,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:55:45,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [713905614] [2024-11-22 12:55:45,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:55:45,931 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-22 12:55:45,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:55:45,933 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-22 12:55:45,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (13)] Waiting until timeout for monitored process [2024-11-22 12:55:46,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:55:46,333 INFO L255 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-22 12:55:46,337 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:55:47,766 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 19 proven. 297 refuted. 0 times theorem prover too weak. 696 trivial. 0 not checked. [2024-11-22 12:55:47,766 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 12:55:48,151 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-22 12:55:48,151 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:55:48,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [713905614] [2024-11-22 12:55:48,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [713905614] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-22 12:55:48,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 12:55:48,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 13 [2024-11-22 12:55:48,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821502168] [2024-11-22 12:55:48,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:55:48,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 12:55:48,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:55:48,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 12:55:48,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-11-22 12:55:48,152 INFO L87 Difference]: Start difference. First operand 387 states and 530 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-22 12:55:48,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:55:48,450 INFO L93 Difference]: Finished difference Result 711 states and 970 transitions. [2024-11-22 12:55:48,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-22 12:55:48,451 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 180 [2024-11-22 12:55:48,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:55:48,453 INFO L225 Difference]: With dead ends: 711 [2024-11-22 12:55:48,453 INFO L226 Difference]: Without dead ends: 390 [2024-11-22 12:55:48,454 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 347 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2024-11-22 12:55:48,454 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 71 mSDsluCounter, 610 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 774 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 12:55:48,454 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 774 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 12:55:48,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2024-11-22 12:55:48,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 358. [2024-11-22 12:55:48,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 305 states have (on average 1.2885245901639344) internal successors, (393), 306 states have internal predecessors, (393), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-22 12:55:48,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 489 transitions. [2024-11-22 12:55:48,466 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 489 transitions. Word has length 180 [2024-11-22 12:55:48,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:55:48,467 INFO L471 AbstractCegarLoop]: Abstraction has 358 states and 489 transitions. [2024-11-22 12:55:48,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-22 12:55:48,468 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 489 transitions. [2024-11-22 12:55:48,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-22 12:55:48,468 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:55:48,469 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:55:48,481 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (13)] Ended with exit code 0 [2024-11-22 12:55:48,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-22 12:55:48,673 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:55:48,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:55:48,673 INFO L85 PathProgramCache]: Analyzing trace with hash -921028637, now seen corresponding path program 1 times [2024-11-22 12:55:48,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:55:48,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1130138211] [2024-11-22 12:55:48,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:55:48,674 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-22 12:55:48,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:55:48,675 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-22 12:55:48,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (14)] Waiting until timeout for monitored process [2024-11-22 12:55:49,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:55:49,059 INFO L255 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-22 12:55:49,063 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:55:50,287 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 19 proven. 297 refuted. 0 times theorem prover too weak. 696 trivial. 0 not checked. [2024-11-22 12:55:50,287 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 12:55:50,655 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-22 12:55:50,655 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:55:50,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1130138211] [2024-11-22 12:55:50,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1130138211] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-22 12:55:50,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 12:55:50,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 12 [2024-11-22 12:55:50,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762442188] [2024-11-22 12:55:50,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:55:50,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 12:55:50,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:55:50,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 12:55:50,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-11-22 12:55:50,657 INFO L87 Difference]: Start difference. First operand 358 states and 489 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-22 12:55:50,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:55:50,925 INFO L93 Difference]: Finished difference Result 626 states and 850 transitions. [2024-11-22 12:55:50,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 12:55:50,927 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 180 [2024-11-22 12:55:50,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:55:50,929 INFO L225 Difference]: With dead ends: 626 [2024-11-22 12:55:50,929 INFO L226 Difference]: Without dead ends: 334 [2024-11-22 12:55:50,929 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 348 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2024-11-22 12:55:50,930 INFO L432 NwaCegarLoop]: 208 mSDtfsCounter, 137 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 749 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 12:55:50,930 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 749 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 12:55:50,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2024-11-22 12:55:50,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 298. [2024-11-22 12:55:50,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 247 states have (on average 1.271255060728745) internal successors, (314), 247 states have internal predecessors, (314), 46 states have call successors, (46), 4 states have call predecessors, (46), 4 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-22 12:55:50,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 406 transitions. [2024-11-22 12:55:50,943 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 406 transitions. Word has length 180 [2024-11-22 12:55:50,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:55:50,943 INFO L471 AbstractCegarLoop]: Abstraction has 298 states and 406 transitions. [2024-11-22 12:55:50,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-22 12:55:50,948 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 406 transitions. [2024-11-22 12:55:50,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-22 12:55:50,949 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:55:50,949 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:55:50,963 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (14)] Forceful destruction successful, exit code 0 [2024-11-22 12:55:51,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-22 12:55:51,150 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:55:51,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:55:51,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1481544605, now seen corresponding path program 1 times [2024-11-22 12:55:51,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:55:51,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1863738774] [2024-11-22 12:55:51,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:55:51,151 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-22 12:55:51,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:55:51,152 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-22 12:55:51,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (15)] Waiting until timeout for monitored process [2024-11-22 12:55:51,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:55:51,546 INFO L255 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-22 12:55:51,550 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:55:52,469 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 19 proven. 297 refuted. 0 times theorem prover too weak. 696 trivial. 0 not checked. [2024-11-22 12:55:52,470 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 12:55:52,678 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-22 12:55:52,678 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:55:52,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1863738774] [2024-11-22 12:55:52,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1863738774] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-22 12:55:52,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 12:55:52,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 11 [2024-11-22 12:55:52,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932758052] [2024-11-22 12:55:52,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:55:52,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 12:55:52,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:55:52,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 12:55:52,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-22 12:55:52,679 INFO L87 Difference]: Start difference. First operand 298 states and 406 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-22 12:55:52,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:55:52,789 INFO L93 Difference]: Finished difference Result 566 states and 765 transitions. [2024-11-22 12:55:52,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 12:55:52,789 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 180 [2024-11-22 12:55:52,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:55:52,791 INFO L225 Difference]: With dead ends: 566 [2024-11-22 12:55:52,791 INFO L226 Difference]: Without dead ends: 334 [2024-11-22 12:55:52,791 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 349 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-22 12:55:52,792 INFO L432 NwaCegarLoop]: 207 mSDtfsCounter, 59 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 698 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 12:55:52,792 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 698 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 12:55:52,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2024-11-22 12:55:52,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 298. [2024-11-22 12:55:52,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 247 states have (on average 1.263157894736842) internal successors, (312), 247 states have internal predecessors, (312), 46 states have call successors, (46), 4 states have call predecessors, (46), 4 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-22 12:55:52,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 404 transitions. [2024-11-22 12:55:52,805 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 404 transitions. Word has length 180 [2024-11-22 12:55:52,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:55:52,805 INFO L471 AbstractCegarLoop]: Abstraction has 298 states and 404 transitions. [2024-11-22 12:55:52,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-22 12:55:52,806 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 404 transitions. [2024-11-22 12:55:52,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-22 12:55:52,807 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:55:52,807 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:55:52,821 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (15)] Ended with exit code 0 [2024-11-22 12:55:53,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-22 12:55:53,009 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:55:53,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:55:53,009 INFO L85 PathProgramCache]: Analyzing trace with hash 1533559013, now seen corresponding path program 1 times [2024-11-22 12:55:53,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:55:53,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1585813865] [2024-11-22 12:55:53,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:55:53,009 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-22 12:55:53,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:55:53,010 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-22 12:55:53,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (16)] Waiting until timeout for monitored process [2024-11-22 12:55:53,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:55:53,387 INFO L255 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-22 12:55:53,391 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:55:54,237 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 19 proven. 297 refuted. 0 times theorem prover too weak. 696 trivial. 0 not checked. [2024-11-22 12:55:54,237 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 12:55:54,553 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-22 12:55:54,554 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:55:54,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1585813865] [2024-11-22 12:55:54,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1585813865] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-22 12:55:54,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 12:55:54,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 12 [2024-11-22 12:55:54,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698402007] [2024-11-22 12:55:54,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:55:54,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 12:55:54,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:55:54,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 12:55:54,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-11-22 12:55:54,555 INFO L87 Difference]: Start difference. First operand 298 states and 404 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-22 12:55:54,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:55:54,783 INFO L93 Difference]: Finished difference Result 566 states and 761 transitions. [2024-11-22 12:55:54,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 12:55:54,784 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 180 [2024-11-22 12:55:54,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:55:54,785 INFO L225 Difference]: With dead ends: 566 [2024-11-22 12:55:54,785 INFO L226 Difference]: Without dead ends: 334 [2024-11-22 12:55:54,788 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 348 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2024-11-22 12:55:54,788 INFO L432 NwaCegarLoop]: 207 mSDtfsCounter, 56 mSDsluCounter, 685 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 892 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 12:55:54,788 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 892 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 12:55:54,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2024-11-22 12:55:54,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 298. [2024-11-22 12:55:54,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 247 states have (on average 1.2591093117408907) internal successors, (311), 247 states have internal predecessors, (311), 46 states have call successors, (46), 4 states have call predecessors, (46), 4 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-22 12:55:54,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 403 transitions. [2024-11-22 12:55:54,799 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 403 transitions. Word has length 180 [2024-11-22 12:55:54,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:55:54,799 INFO L471 AbstractCegarLoop]: Abstraction has 298 states and 403 transitions. [2024-11-22 12:55:54,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-22 12:55:54,799 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 403 transitions. [2024-11-22 12:55:54,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-22 12:55:54,800 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:55:54,800 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:55:54,812 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (16)] Ended with exit code 0 [2024-11-22 12:55:55,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-22 12:55:55,001 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:55:55,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:55:55,001 INFO L85 PathProgramCache]: Analyzing trace with hash -2060343705, now seen corresponding path program 1 times [2024-11-22 12:55:55,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:55:55,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [901801638] [2024-11-22 12:55:55,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:55:55,002 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-22 12:55:55,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:55:55,003 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-22 12:55:55,003 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (17)] Waiting until timeout for monitored process [2024-11-22 12:55:55,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:55:55,376 INFO L255 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-22 12:55:55,379 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:55:56,527 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-22 12:55:56,637 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 17 treesize of output 9 [2024-11-22 12:55:56,695 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 42 treesize of output 26 [2024-11-22 12:55:56,796 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 31 proven. 456 refuted. 0 times theorem prover too weak. 525 trivial. 0 not checked. [2024-11-22 12:55:56,797 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 12:55:57,544 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-22 12:55:57,544 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:55:57,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [901801638] [2024-11-22 12:55:57,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [901801638] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-22 12:55:57,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 12:55:57,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [18] total 24 [2024-11-22 12:55:57,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926913659] [2024-11-22 12:55:57,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:55:57,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-22 12:55:57,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:55:57,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-22 12:55:57,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=487, Unknown=0, NotChecked=0, Total=552 [2024-11-22 12:55:57,545 INFO L87 Difference]: Start difference. First operand 298 states and 403 transitions. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-22 12:55:58,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:55:58,211 INFO L93 Difference]: Finished difference Result 575 states and 774 transitions. [2024-11-22 12:55:58,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-22 12:55:58,212 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 180 [2024-11-22 12:55:58,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:55:58,213 INFO L225 Difference]: With dead ends: 575 [2024-11-22 12:55:58,213 INFO L226 Difference]: Without dead ends: 343 [2024-11-22 12:55:58,214 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 336 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=87, Invalid=725, Unknown=0, NotChecked=0, Total=812 [2024-11-22 12:55:58,214 INFO L432 NwaCegarLoop]: 230 mSDtfsCounter, 72 mSDsluCounter, 1441 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 1671 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-22 12:55:58,215 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 1671 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-22 12:55:58,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2024-11-22 12:55:58,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 340. [2024-11-22 12:55:58,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 282 states have (on average 1.2624113475177305) internal successors, (356), 283 states have internal predecessors, (356), 51 states have call successors, (51), 6 states have call predecessors, (51), 6 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) [2024-11-22 12:55:58,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 458 transitions. [2024-11-22 12:55:58,226 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 458 transitions. Word has length 180 [2024-11-22 12:55:58,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:55:58,226 INFO L471 AbstractCegarLoop]: Abstraction has 340 states and 458 transitions. [2024-11-22 12:55:58,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-22 12:55:58,227 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 458 transitions. [2024-11-22 12:55:58,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-11-22 12:55:58,227 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:55:58,227 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:55:58,243 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (17)] Ended with exit code 0 [2024-11-22 12:55:58,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-22 12:55:58,428 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:55:58,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:55:58,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1236375162, now seen corresponding path program 1 times [2024-11-22 12:55:58,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:55:58,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [496587854] [2024-11-22 12:55:58,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:55:58,429 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-22 12:55:58,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:55:58,431 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-22 12:55:58,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (18)] Waiting until timeout for monitored process [2024-11-22 12:55:58,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:55:58,791 INFO L255 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-22 12:55:58,793 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:55:58,815 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-22 12:55:58,815 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 12:55:58,815 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:55:58,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [496587854] [2024-11-22 12:55:58,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [496587854] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:55:58,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:55:58,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 12:55:58,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163069230] [2024-11-22 12:55:58,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:55:58,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 12:55:58,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:55:58,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 12:55:58,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 12:55:58,816 INFO L87 Difference]: Start difference. First operand 340 states and 458 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-22 12:55:59,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:55:59,168 INFO L93 Difference]: Finished difference Result 620 states and 834 transitions. [2024-11-22 12:55:59,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 12:55:59,169 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 182 [2024-11-22 12:55:59,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:55:59,171 INFO L225 Difference]: With dead ends: 620 [2024-11-22 12:55:59,171 INFO L226 Difference]: Without dead ends: 346 [2024-11-22 12:55:59,171 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 178 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-22 12:55:59,171 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 0 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 612 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-22 12:55:59,172 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 612 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-22 12:55:59,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2024-11-22 12:55:59,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 346. [2024-11-22 12:55:59,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 288 states have (on average 1.2569444444444444) internal successors, (362), 289 states have internal predecessors, (362), 51 states have call successors, (51), 6 states have call predecessors, (51), 6 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) [2024-11-22 12:55:59,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 464 transitions. [2024-11-22 12:55:59,180 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 464 transitions. Word has length 182 [2024-11-22 12:55:59,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:55:59,180 INFO L471 AbstractCegarLoop]: Abstraction has 346 states and 464 transitions. [2024-11-22 12:55:59,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-22 12:55:59,180 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 464 transitions. [2024-11-22 12:55:59,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-22 12:55:59,181 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:55:59,181 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:55:59,193 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (18)] Forceful destruction successful, exit code 0 [2024-11-22 12:55:59,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-22 12:55:59,382 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:55:59,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:55:59,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1917092673, now seen corresponding path program 1 times [2024-11-22 12:55:59,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:55:59,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1366458996] [2024-11-22 12:55:59,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:55:59,383 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-22 12:55:59,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:55:59,386 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-22 12:55:59,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (19)] Waiting until timeout for monitored process [2024-11-22 12:55:59,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:55:59,955 INFO L255 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-22 12:55:59,959 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:56:01,501 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 17 treesize of output 13 [2024-11-22 12:56:02,085 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 72 treesize of output 52 [2024-11-22 12:56:02,093 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 42 treesize of output 30 [2024-11-22 12:56:02,316 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 59 proven. 246 refuted. 0 times theorem prover too weak. 707 trivial. 0 not checked. [2024-11-22 12:56:02,316 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 12:56:03,101 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-22 12:56:03,101 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:56:03,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1366458996] [2024-11-22 12:56:03,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1366458996] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-22 12:56:03,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 12:56:03,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [16] total 21 [2024-11-22 12:56:03,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239679838] [2024-11-22 12:56:03,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:56:03,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 12:56:03,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:56:03,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 12:56:03,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=366, Unknown=0, NotChecked=0, Total=420 [2024-11-22 12:56:03,102 INFO L87 Difference]: Start difference. First operand 346 states and 464 transitions. Second operand has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-22 12:56:05,455 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-22 12:56:09,042 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-22 12:56:09,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:56:09,386 INFO L93 Difference]: Finished difference Result 625 states and 831 transitions. [2024-11-22 12:56:09,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-22 12:56:09,387 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 184 [2024-11-22 12:56:09,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:56:09,389 INFO L225 Difference]: With dead ends: 625 [2024-11-22 12:56:09,389 INFO L226 Difference]: Without dead ends: 623 [2024-11-22 12:56:09,390 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 347 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=70, Invalid=530, Unknown=0, NotChecked=0, Total=600 [2024-11-22 12:56:09,391 INFO L432 NwaCegarLoop]: 218 mSDtfsCounter, 108 mSDsluCounter, 1009 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 1227 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2024-11-22 12:56:09,391 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 1227 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 6.1s Time] [2024-11-22 12:56:09,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2024-11-22 12:56:09,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 620. [2024-11-22 12:56:09,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 620 states, 534 states have (on average 1.2621722846441947) internal successors, (674), 537 states have internal predecessors, (674), 75 states have call successors, (75), 10 states have call predecessors, (75), 10 states have return successors, (75), 72 states have call predecessors, (75), 75 states have call successors, (75) [2024-11-22 12:56:09,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 824 transitions. [2024-11-22 12:56:09,407 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 824 transitions. Word has length 184 [2024-11-22 12:56:09,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:56:09,408 INFO L471 AbstractCegarLoop]: Abstraction has 620 states and 824 transitions. [2024-11-22 12:56:09,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-22 12:56:09,409 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 824 transitions. [2024-11-22 12:56:09,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-22 12:56:09,410 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:56:09,410 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 12:56:09,428 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (19)] Ended with exit code 0 [2024-11-22 12:56:09,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-22 12:56:09,611 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:56:09,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:56:09,611 INFO L85 PathProgramCache]: Analyzing trace with hash 1073087171, now seen corresponding path program 1 times [2024-11-22 12:56:09,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:56:09,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1731277497] [2024-11-22 12:56:09,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:56:09,612 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-22 12:56:09,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:56:09,614 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-22 12:56:09,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 (20)] Waiting until timeout for monitored process [2024-11-22 12:56:10,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:56:10,462 INFO L255 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-22 12:56:10,465 INFO L278 TraceCheckSpWp]: Computing forward predicates...