./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-97.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-97.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 7188c6f24541aba260187a36aa9df009a62318807d29ed8104d2cc5db8c5a63b --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 11:43:42,552 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 11:43:42,608 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 11:43:42,612 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 11:43:42,612 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 11:43:42,635 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 11:43:42,635 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 11:43:42,635 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 11:43:42,636 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 11:43:42,636 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 11:43:42,636 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 11:43:42,636 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 11:43:42,637 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 11:43:42,637 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 11:43:42,637 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 11:43:42,638 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 11:43:42,640 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 11:43:42,640 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 11:43:42,641 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 11:43:42,641 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 11:43:42,641 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 11:43:42,641 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 11:43:42,641 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 11:43:42,642 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 11:43:42,642 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 11:43:42,642 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 11:43:42,642 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 11:43:42,642 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 11:43:42,643 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 11:43:42,643 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 11:43:42,643 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 11:43:42,643 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 11:43:42,643 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:43:42,644 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 11:43:42,644 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 11:43:42,644 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 11:43:42,644 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 11:43:42,644 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 11:43:42,644 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 11:43:42,645 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 11:43:42,645 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 11:43:42,645 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 11:43:42,645 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 -> 7188c6f24541aba260187a36aa9df009a62318807d29ed8104d2cc5db8c5a63b [2024-10-24 11:43:42,850 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 11:43:42,874 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 11:43:42,876 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 11:43:42,878 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 11:43:42,878 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 11:43:42,879 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-97.i [2024-10-24 11:43:44,066 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 11:43:44,225 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 11:43:44,225 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-97.i [2024-10-24 11:43:44,234 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c72ac1b8b/dc3cecdc0e664e21a51572060fc19f84/FLAG63e568787 [2024-10-24 11:43:44,247 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c72ac1b8b/dc3cecdc0e664e21a51572060fc19f84 [2024-10-24 11:43:44,249 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 11:43:44,250 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 11:43:44,252 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 11:43:44,252 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 11:43:44,256 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 11:43:44,257 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:43:44" (1/1) ... [2024-10-24 11:43:44,258 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e8af8e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:43:44, skipping insertion in model container [2024-10-24 11:43:44,259 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:43:44" (1/1) ... [2024-10-24 11:43:44,283 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 11:43:44,420 WARN L248 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-97.i[916,929] [2024-10-24 11:43:44,479 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:43:44,488 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 11:43:44,497 WARN L248 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-97.i[916,929] [2024-10-24 11:43:44,513 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:43:44,529 INFO L204 MainTranslator]: Completed translation [2024-10-24 11:43:44,529 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:43:44 WrapperNode [2024-10-24 11:43:44,529 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 11:43:44,530 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 11:43:44,530 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 11:43:44,530 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 11:43:44,537 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:43:44" (1/1) ... [2024-10-24 11:43:44,546 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:43:44" (1/1) ... [2024-10-24 11:43:44,570 INFO L138 Inliner]: procedures = 29, calls = 159, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 473 [2024-10-24 11:43:44,571 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 11:43:44,571 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 11:43:44,572 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 11:43:44,572 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 11:43:44,584 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:43:44" (1/1) ... [2024-10-24 11:43:44,587 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:43:44" (1/1) ... [2024-10-24 11:43:44,590 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:43:44" (1/1) ... [2024-10-24 11:43:44,613 INFO L175 MemorySlicer]: Split 116 memory accesses to 16 slices as follows [2, 7, 8, 6, 6, 7, 8, 10, 11, 8, 6, 7, 6, 9, 8, 7]. 9 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 19 writes are split as follows [0, 3, 1, 1, 1, 2, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1]. [2024-10-24 11:43:44,613 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:43:44" (1/1) ... [2024-10-24 11:43:44,614 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:43:44" (1/1) ... [2024-10-24 11:43:44,629 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:43:44" (1/1) ... [2024-10-24 11:43:44,632 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:43:44" (1/1) ... [2024-10-24 11:43:44,635 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:43:44" (1/1) ... [2024-10-24 11:43:44,637 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:43:44" (1/1) ... [2024-10-24 11:43:44,643 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 11:43:44,647 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 11:43:44,647 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 11:43:44,647 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 11:43:44,647 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:43:44" (1/1) ... [2024-10-24 11:43:44,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:43:44,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:43:44,677 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-10-24 11:43:44,679 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-10-24 11:43:44,720 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 11:43:44,720 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-24 11:43:44,721 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-24 11:43:44,721 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-10-24 11:43:44,722 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-10-24 11:43:44,722 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-10-24 11:43:44,722 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-10-24 11:43:44,722 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2024-10-24 11:43:44,722 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2024-10-24 11:43:44,723 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#8 [2024-10-24 11:43:44,724 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#9 [2024-10-24 11:43:44,724 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#10 [2024-10-24 11:43:44,724 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#11 [2024-10-24 11:43:44,724 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#12 [2024-10-24 11:43:44,724 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#13 [2024-10-24 11:43:44,724 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#14 [2024-10-24 11:43:44,724 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#15 [2024-10-24 11:43:44,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-24 11:43:44,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-24 11:43:44,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-24 11:43:44,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-24 11:43:44,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-24 11:43:44,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-10-24 11:43:44,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-10-24 11:43:44,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-10-24 11:43:44,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2024-10-24 11:43:44,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2024-10-24 11:43:44,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2024-10-24 11:43:44,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2024-10-24 11:43:44,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2024-10-24 11:43:44,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2024-10-24 11:43:44,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2024-10-24 11:43:44,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2024-10-24 11:43:44,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-24 11:43:44,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-24 11:43:44,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-10-24 11:43:44,729 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-10-24 11:43:44,729 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-10-24 11:43:44,729 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-10-24 11:43:44,729 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2024-10-24 11:43:44,729 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2024-10-24 11:43:44,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#8 [2024-10-24 11:43:44,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#9 [2024-10-24 11:43:44,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#10 [2024-10-24 11:43:44,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#11 [2024-10-24 11:43:44,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#12 [2024-10-24 11:43:44,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#13 [2024-10-24 11:43:44,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#14 [2024-10-24 11:43:44,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#15 [2024-10-24 11:43:44,731 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-24 11:43:44,731 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-24 11:43:44,731 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-24 11:43:44,731 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-24 11:43:44,731 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-24 11:43:44,731 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-10-24 11:43:44,731 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-10-24 11:43:44,732 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-10-24 11:43:44,732 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2024-10-24 11:43:44,732 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2024-10-24 11:43:44,732 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2024-10-24 11:43:44,732 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2024-10-24 11:43:44,732 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2024-10-24 11:43:44,732 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2024-10-24 11:43:44,732 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2024-10-24 11:43:44,732 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2024-10-24 11:43:44,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-24 11:43:44,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-24 11:43:44,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-10-24 11:43:44,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-10-24 11:43:44,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-10-24 11:43:44,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-10-24 11:43:44,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2024-10-24 11:43:44,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2024-10-24 11:43:44,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#8 [2024-10-24 11:43:44,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#9 [2024-10-24 11:43:44,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#10 [2024-10-24 11:43:44,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#11 [2024-10-24 11:43:44,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#12 [2024-10-24 11:43:44,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#13 [2024-10-24 11:43:44,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#14 [2024-10-24 11:43:44,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#15 [2024-10-24 11:43:44,734 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 11:43:44,735 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 11:43:44,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 11:43:44,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-24 11:43:44,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-24 11:43:44,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-24 11:43:44,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-24 11:43:44,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-24 11:43:44,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-10-24 11:43:44,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-10-24 11:43:44,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-10-24 11:43:44,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-10-24 11:43:44,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-10-24 11:43:44,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-10-24 11:43:44,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-10-24 11:43:44,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-10-24 11:43:44,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2024-10-24 11:43:44,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2024-10-24 11:43:44,737 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 11:43:44,737 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 11:43:44,896 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 11:43:44,897 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 11:43:45,248 INFO L? ?]: Removed 86 outVars from TransFormulas that were not future-live. [2024-10-24 11:43:45,248 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 11:43:45,281 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 11:43:45,282 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 11:43:45,282 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:43:45 BoogieIcfgContainer [2024-10-24 11:43:45,282 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 11:43:45,284 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 11:43:45,284 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 11:43:45,287 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 11:43:45,287 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:43:44" (1/3) ... [2024-10-24 11:43:45,288 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5eabfe84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:43:45, skipping insertion in model container [2024-10-24 11:43:45,288 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:43:44" (2/3) ... [2024-10-24 11:43:45,288 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5eabfe84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:43:45, skipping insertion in model container [2024-10-24 11:43:45,289 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:43:45" (3/3) ... [2024-10-24 11:43:45,289 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-97.i [2024-10-24 11:43:45,302 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 11:43:45,302 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 11:43:45,351 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 11:43:45,358 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;@5e775dc5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 11:43:45,358 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 11:43:45,361 INFO L276 IsEmpty]: Start isEmpty. Operand has 101 states, 81 states have (on average 1.4320987654320987) internal successors, (116), 82 states have internal predecessors, (116), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-24 11:43:45,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-24 11:43:45,371 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:43:45,372 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:43:45,372 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:43:45,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:43:45,376 INFO L85 PathProgramCache]: Analyzing trace with hash -872643146, now seen corresponding path program 1 times [2024-10-24 11:43:45,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:43:45,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104900865] [2024-10-24 11:43:45,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:43:45,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:43:45,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:45,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:43:45,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:45,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:43:45,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:45,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:43:45,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:45,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:43:45,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:45,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:43:45,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:45,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:43:45,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:45,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:43:45,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:45,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:43:45,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:45,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:43:45,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:45,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:43:45,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:45,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:43:45,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:45,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:43:45,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:45,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:43:45,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:45,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:43:45,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:45,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:43:45,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:45,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 11:43:45,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:45,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:43:45,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:45,745 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-24 11:43:45,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:43:45,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104900865] [2024-10-24 11:43:45,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104900865] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:43:45,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:43:45,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 11:43:45,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921758406] [2024-10-24 11:43:45,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:43:45,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 11:43:45,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:43:45,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 11:43:45,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:43:45,815 INFO L87 Difference]: Start difference. First operand has 101 states, 81 states have (on average 1.4320987654320987) internal successors, (116), 82 states have internal predecessors, (116), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-24 11:43:45,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:43:45,891 INFO L93 Difference]: Finished difference Result 199 states and 315 transitions. [2024-10-24 11:43:45,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 11:43:45,897 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 129 [2024-10-24 11:43:45,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:43:45,908 INFO L225 Difference]: With dead ends: 199 [2024-10-24 11:43:45,908 INFO L226 Difference]: Without dead ends: 99 [2024-10-24 11:43:45,912 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 53 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-10-24 11:43:45,916 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:43:45,917 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 141 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:43:45,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-10-24 11:43:45,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-10-24 11:43:45,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 80 states have (on average 1.3875) internal successors, (111), 80 states have internal predecessors, (111), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-24 11:43:45,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 145 transitions. [2024-10-24 11:43:45,958 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 145 transitions. Word has length 129 [2024-10-24 11:43:45,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:43:45,959 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 145 transitions. [2024-10-24 11:43:45,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-24 11:43:45,959 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 145 transitions. [2024-10-24 11:43:45,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-24 11:43:45,962 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:43:45,963 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:43:45,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 11:43:45,963 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:43:45,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:43:45,964 INFO L85 PathProgramCache]: Analyzing trace with hash -716066796, now seen corresponding path program 1 times [2024-10-24 11:43:45,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:43:45,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739987447] [2024-10-24 11:43:45,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:43:45,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:43:46,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:46,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:43:46,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:46,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:43:46,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:46,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:43:46,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:46,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:43:46,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:46,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:43:46,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:46,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:43:46,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:46,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:43:46,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:46,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:43:46,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:46,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:43:46,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:46,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:43:46,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:46,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:43:46,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:46,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:43:46,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:46,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:43:46,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:46,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:43:46,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:46,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:43:46,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:46,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 11:43:46,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:46,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:43:46,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:46,396 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-24 11:43:46,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:43:46,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739987447] [2024-10-24 11:43:46,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739987447] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:43:46,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:43:46,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:43:46,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096848664] [2024-10-24 11:43:46,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:43:46,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:43:46,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:43:46,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:43:46,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:43:46,402 INFO L87 Difference]: Start difference. First operand 99 states and 145 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 11:43:46,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:43:46,440 INFO L93 Difference]: Finished difference Result 199 states and 292 transitions. [2024-10-24 11:43:46,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:43:46,441 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 129 [2024-10-24 11:43:46,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:43:46,443 INFO L225 Difference]: With dead ends: 199 [2024-10-24 11:43:46,443 INFO L226 Difference]: Without dead ends: 101 [2024-10-24 11:43:46,443 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 37 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-10-24 11:43:46,444 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 0 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:43:46,445 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 410 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:43:46,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-10-24 11:43:46,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2024-10-24 11:43:46,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 82 states have (on average 1.3780487804878048) internal successors, (113), 82 states have internal predecessors, (113), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-24 11:43:46,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 147 transitions. [2024-10-24 11:43:46,454 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 147 transitions. Word has length 129 [2024-10-24 11:43:46,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:43:46,455 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 147 transitions. [2024-10-24 11:43:46,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 11:43:46,455 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 147 transitions. [2024-10-24 11:43:46,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-24 11:43:46,457 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:43:46,457 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:43:46,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 11:43:46,457 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:43:46,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:43:46,458 INFO L85 PathProgramCache]: Analyzing trace with hash 595986690, now seen corresponding path program 1 times [2024-10-24 11:43:46,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:43:46,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43609038] [2024-10-24 11:43:46,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:43:46,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:43:46,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:46,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:43:46,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:46,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:43:46,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:46,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:43:46,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:46,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:43:46,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:46,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:43:46,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:46,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:43:46,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:46,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:43:46,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:46,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:43:46,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:46,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:43:46,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:46,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:43:46,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:46,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:43:46,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:46,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:43:46,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:46,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:43:46,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:46,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:43:46,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:46,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:43:46,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:46,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 11:43:46,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:46,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:43:46,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:46,653 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-24 11:43:46,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:43:46,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43609038] [2024-10-24 11:43:46,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43609038] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:43:46,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:43:46,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:43:46,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046049298] [2024-10-24 11:43:46,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:43:46,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:43:46,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:43:46,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:43:46,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:43:46,657 INFO L87 Difference]: Start difference. First operand 101 states and 147 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 11:43:46,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:43:46,710 INFO L93 Difference]: Finished difference Result 204 states and 297 transitions. [2024-10-24 11:43:46,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:43:46,710 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 131 [2024-10-24 11:43:46,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:43:46,711 INFO L225 Difference]: With dead ends: 204 [2024-10-24 11:43:46,712 INFO L226 Difference]: Without dead ends: 104 [2024-10-24 11:43:46,712 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 36 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-10-24 11:43:46,713 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 1 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:43:46,713 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 407 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:43:46,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-10-24 11:43:46,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2024-10-24 11:43:46,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 84 states have (on average 1.369047619047619) internal successors, (115), 84 states have internal predecessors, (115), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-24 11:43:46,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 149 transitions. [2024-10-24 11:43:46,721 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 149 transitions. Word has length 131 [2024-10-24 11:43:46,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:43:46,721 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 149 transitions. [2024-10-24 11:43:46,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 11:43:46,722 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 149 transitions. [2024-10-24 11:43:46,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-24 11:43:46,723 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:43:46,723 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:43:46,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 11:43:46,723 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:43:46,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:43:46,724 INFO L85 PathProgramCache]: Analyzing trace with hash -213359936, now seen corresponding path program 1 times [2024-10-24 11:43:46,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:43:46,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003658325] [2024-10-24 11:43:46,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:43:46,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:43:46,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:46,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:43:46,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:46,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:43:46,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:46,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:43:46,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:46,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:43:46,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:46,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:43:46,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:46,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:43:46,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:46,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:43:46,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:46,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:43:46,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:46,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:43:46,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:46,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:43:46,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:46,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:43:46,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:46,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:43:46,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:46,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:43:46,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:46,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:43:46,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:46,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:43:46,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:46,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 11:43:46,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:46,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:43:46,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:46,856 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-24 11:43:46,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:43:46,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003658325] [2024-10-24 11:43:46,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003658325] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:43:46,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:43:46,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:43:46,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904000433] [2024-10-24 11:43:46,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:43:46,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:43:46,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:43:46,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:43:46,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:43:46,858 INFO L87 Difference]: Start difference. First operand 103 states and 149 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 11:43:46,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:43:46,897 INFO L93 Difference]: Finished difference Result 208 states and 301 transitions. [2024-10-24 11:43:46,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:43:46,897 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 131 [2024-10-24 11:43:46,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:43:46,899 INFO L225 Difference]: With dead ends: 208 [2024-10-24 11:43:46,899 INFO L226 Difference]: Without dead ends: 106 [2024-10-24 11:43:46,899 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 36 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-10-24 11:43:46,900 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 1 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:43:46,901 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 408 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:43:46,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-10-24 11:43:46,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2024-10-24 11:43:46,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 86 states have (on average 1.3604651162790697) internal successors, (117), 86 states have internal predecessors, (117), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-24 11:43:46,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 151 transitions. [2024-10-24 11:43:46,907 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 151 transitions. Word has length 131 [2024-10-24 11:43:46,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:43:46,908 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 151 transitions. [2024-10-24 11:43:46,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 11:43:46,908 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 151 transitions. [2024-10-24 11:43:46,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-24 11:43:46,909 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:43:46,910 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:43:46,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 11:43:46,910 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:43:46,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:43:46,910 INFO L85 PathProgramCache]: Analyzing trace with hash -156101634, now seen corresponding path program 1 times [2024-10-24 11:43:46,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:43:46,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260946417] [2024-10-24 11:43:46,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:43:46,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:43:46,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:47,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:43:47,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:47,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:43:47,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:47,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:43:47,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:47,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:43:47,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:47,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:43:47,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:47,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:43:47,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:47,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:43:47,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:47,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:43:47,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:47,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:43:47,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:47,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:43:47,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:47,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:43:47,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:47,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:43:47,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:47,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:43:47,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:47,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:43:47,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:47,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:43:47,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:47,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 11:43:47,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:47,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:43:47,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:47,047 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-24 11:43:47,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:43:47,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260946417] [2024-10-24 11:43:47,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260946417] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:43:47,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:43:47,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:43:47,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929158623] [2024-10-24 11:43:47,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:43:47,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:43:47,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:43:47,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:43:47,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:43:47,050 INFO L87 Difference]: Start difference. First operand 105 states and 151 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 11:43:47,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:43:47,078 INFO L93 Difference]: Finished difference Result 212 states and 305 transitions. [2024-10-24 11:43:47,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:43:47,079 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 131 [2024-10-24 11:43:47,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:43:47,080 INFO L225 Difference]: With dead ends: 212 [2024-10-24 11:43:47,082 INFO L226 Difference]: Without dead ends: 108 [2024-10-24 11:43:47,083 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 36 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-10-24 11:43:47,084 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 1 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:43:47,084 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 411 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:43:47,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-10-24 11:43:47,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2024-10-24 11:43:47,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 88 states have (on average 1.3522727272727273) internal successors, (119), 88 states have internal predecessors, (119), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-24 11:43:47,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 153 transitions. [2024-10-24 11:43:47,090 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 153 transitions. Word has length 131 [2024-10-24 11:43:47,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:43:47,090 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 153 transitions. [2024-10-24 11:43:47,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 11:43:47,091 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 153 transitions. [2024-10-24 11:43:47,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-24 11:43:47,095 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:43:47,095 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:43:47,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 11:43:47,095 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:43:47,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:43:47,095 INFO L85 PathProgramCache]: Analyzing trace with hash -156042052, now seen corresponding path program 1 times [2024-10-24 11:43:47,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:43:47,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788859114] [2024-10-24 11:43:47,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:43:47,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:43:47,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:47,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:43:47,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:47,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:43:47,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:47,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:43:47,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:47,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:43:47,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:47,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:43:47,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:47,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:43:47,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:47,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:43:47,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:47,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:43:47,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:47,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:43:47,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:47,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:43:47,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:47,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:43:47,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:47,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:43:47,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:47,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:43:47,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:47,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:43:47,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:47,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:43:47,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:47,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 11:43:47,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:47,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:43:47,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:47,503 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-24 11:43:47,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:43:47,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788859114] [2024-10-24 11:43:47,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788859114] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:43:47,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:43:47,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 11:43:47,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964856191] [2024-10-24 11:43:47,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:43:47,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:43:47,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:43:47,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:43:47,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:43:47,505 INFO L87 Difference]: Start difference. First operand 107 states and 153 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 11:43:47,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:43:47,705 INFO L93 Difference]: Finished difference Result 301 states and 428 transitions. [2024-10-24 11:43:47,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 11:43:47,706 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 131 [2024-10-24 11:43:47,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:43:47,707 INFO L225 Difference]: With dead ends: 301 [2024-10-24 11:43:47,707 INFO L226 Difference]: Without dead ends: 195 [2024-10-24 11:43:47,708 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-24 11:43:47,708 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 253 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:43:47,709 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 611 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 11:43:47,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-10-24 11:43:47,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 109. [2024-10-24 11:43:47,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 90 states have (on average 1.3444444444444446) internal successors, (121), 90 states have internal predecessors, (121), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-24 11:43:47,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 155 transitions. [2024-10-24 11:43:47,716 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 155 transitions. Word has length 131 [2024-10-24 11:43:47,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:43:47,717 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 155 transitions. [2024-10-24 11:43:47,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 11:43:47,721 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 155 transitions. [2024-10-24 11:43:47,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-24 11:43:47,722 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:43:47,722 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:43:47,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 11:43:47,722 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:43:47,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:43:47,723 INFO L85 PathProgramCache]: Analyzing trace with hash -541804589, now seen corresponding path program 1 times [2024-10-24 11:43:47,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:43:47,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320099204] [2024-10-24 11:43:47,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:43:47,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:43:47,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:48,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:43:48,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:48,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:43:48,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:48,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:43:48,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:48,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:43:48,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:48,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:43:48,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:48,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:43:48,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:48,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:43:48,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:48,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:43:48,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:48,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:43:48,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:48,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:43:48,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:48,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:43:48,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:48,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:43:48,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:48,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:43:48,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:48,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:43:48,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:48,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:43:48,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:48,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 11:43:48,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:48,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:43:48,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:48,447 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 36 proven. 12 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-10-24 11:43:48,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:43:48,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320099204] [2024-10-24 11:43:48,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320099204] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 11:43:48,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [47663397] [2024-10-24 11:43:48,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:43:48,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 11:43:48,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:43:48,450 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-10-24 11:43:48,451 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-10-24 11:43:48,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:48,671 INFO L255 TraceCheckSpWp]: Trace formula consists of 603 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-24 11:43:48,680 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:43:48,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-24 11:43:49,017 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 37 treesize of output 25 [2024-10-24 11:43:49,039 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 11 treesize of output 7 [2024-10-24 11:43:49,061 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 4 proven. 252 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2024-10-24 11:43:49,061 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:43:49,109 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 24 treesize of output 20 [2024-10-24 11:43:49,118 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:43:49,118 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 36 [2024-10-24 11:43:49,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 36 treesize of output 32 [2024-10-24 11:43:49,376 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 36 proven. 12 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-10-24 11:43:49,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [47663397] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 11:43:49,377 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 11:43:49,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 19 [2024-10-24 11:43:49,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752884635] [2024-10-24 11:43:49,377 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 11:43:49,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-24 11:43:49,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:43:49,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-24 11:43:49,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2024-10-24 11:43:49,379 INFO L87 Difference]: Start difference. First operand 109 states and 155 transitions. Second operand has 19 states, 15 states have (on average 5.0) internal successors, (75), 18 states have internal predecessors, (75), 6 states have call successors, (36), 3 states have call predecessors, (36), 5 states have return successors, (36), 3 states have call predecessors, (36), 6 states have call successors, (36) [2024-10-24 11:43:50,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:43:50,186 INFO L93 Difference]: Finished difference Result 335 states and 471 transitions. [2024-10-24 11:43:50,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-24 11:43:50,186 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 15 states have (on average 5.0) internal successors, (75), 18 states have internal predecessors, (75), 6 states have call successors, (36), 3 states have call predecessors, (36), 5 states have return successors, (36), 3 states have call predecessors, (36), 6 states have call successors, (36) Word has length 131 [2024-10-24 11:43:50,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:43:50,188 INFO L225 Difference]: With dead ends: 335 [2024-10-24 11:43:50,188 INFO L226 Difference]: Without dead ends: 227 [2024-10-24 11:43:50,188 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 287 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=329, Invalid=1393, Unknown=0, NotChecked=0, Total=1722 [2024-10-24 11:43:50,189 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 684 mSDsluCounter, 1209 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 212 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 684 SdHoareTripleChecker+Valid, 1358 SdHoareTripleChecker+Invalid, 714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 212 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 11:43:50,191 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [684 Valid, 1358 Invalid, 714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [212 Valid, 502 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 11:43:50,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2024-10-24 11:43:50,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 128. [2024-10-24 11:43:50,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 108 states have (on average 1.3518518518518519) internal successors, (146), 108 states have internal predecessors, (146), 17 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-24 11:43:50,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 180 transitions. [2024-10-24 11:43:50,207 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 180 transitions. Word has length 131 [2024-10-24 11:43:50,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:43:50,208 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 180 transitions. [2024-10-24 11:43:50,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 15 states have (on average 5.0) internal successors, (75), 18 states have internal predecessors, (75), 6 states have call successors, (36), 3 states have call predecessors, (36), 5 states have return successors, (36), 3 states have call predecessors, (36), 6 states have call successors, (36) [2024-10-24 11:43:50,208 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 180 transitions. [2024-10-24 11:43:50,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-24 11:43:50,209 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:43:50,209 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:43:50,224 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 11:43:50,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 11:43:50,411 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:43:50,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:43:50,411 INFO L85 PathProgramCache]: Analyzing trace with hash 1947724373, now seen corresponding path program 1 times [2024-10-24 11:43:50,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:43:50,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476039697] [2024-10-24 11:43:50,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:43:50,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:43:50,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:50,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:43:50,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:50,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:43:50,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:50,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:43:50,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:50,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:43:50,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:50,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:43:50,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:50,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:43:50,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:50,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:43:50,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:50,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:43:50,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:50,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:43:50,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:50,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:43:50,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:50,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:43:50,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:50,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:43:50,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:50,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:43:50,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:50,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:43:50,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:50,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:43:50,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:50,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 11:43:50,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:50,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:43:50,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:50,874 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 30 proven. 18 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-10-24 11:43:50,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:43:50,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476039697] [2024-10-24 11:43:50,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476039697] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 11:43:50,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1636968871] [2024-10-24 11:43:50,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:43:50,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 11:43:50,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:43:50,876 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-10-24 11:43:50,877 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-10-24 11:43:51,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:51,085 INFO L255 TraceCheckSpWp]: Trace formula consists of 600 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-24 11:43:51,094 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:43:51,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-24 11:43:51,339 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 37 treesize of output 25 [2024-10-24 11:43:51,345 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 6 proven. 298 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2024-10-24 11:43:51,345 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:43:51,479 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 36 treesize of output 32 [2024-10-24 11:43:51,562 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 30 proven. 18 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-10-24 11:43:51,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1636968871] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 11:43:51,562 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 11:43:51,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 14 [2024-10-24 11:43:51,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506788085] [2024-10-24 11:43:51,563 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 11:43:51,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-24 11:43:51,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:43:51,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-24 11:43:51,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2024-10-24 11:43:51,564 INFO L87 Difference]: Start difference. First operand 128 states and 180 transitions. Second operand has 14 states, 10 states have (on average 6.4) internal successors, (64), 13 states have internal predecessors, (64), 6 states have call successors, (36), 3 states have call predecessors, (36), 5 states have return successors, (36), 3 states have call predecessors, (36), 6 states have call successors, (36) [2024-10-24 11:43:51,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:43:51,992 INFO L93 Difference]: Finished difference Result 281 states and 394 transitions. [2024-10-24 11:43:51,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-24 11:43:51,992 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 10 states have (on average 6.4) internal successors, (64), 13 states have internal predecessors, (64), 6 states have call successors, (36), 3 states have call predecessors, (36), 5 states have return successors, (36), 3 states have call predecessors, (36), 6 states have call successors, (36) Word has length 131 [2024-10-24 11:43:51,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:43:51,994 INFO L225 Difference]: With dead ends: 281 [2024-10-24 11:43:51,994 INFO L226 Difference]: Without dead ends: 154 [2024-10-24 11:43:51,994 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 289 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=415, Unknown=0, NotChecked=0, Total=552 [2024-10-24 11:43:51,995 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 205 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 732 SdHoareTripleChecker+Invalid, 491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 11:43:51,995 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 732 Invalid, 491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 11:43:51,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-10-24 11:43:52,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 151. [2024-10-24 11:43:52,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 120 states have (on average 1.3083333333333333) internal successors, (157), 121 states have internal predecessors, (157), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-24 11:43:52,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 211 transitions. [2024-10-24 11:43:52,010 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 211 transitions. Word has length 131 [2024-10-24 11:43:52,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:43:52,011 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 211 transitions. [2024-10-24 11:43:52,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 10 states have (on average 6.4) internal successors, (64), 13 states have internal predecessors, (64), 6 states have call successors, (36), 3 states have call predecessors, (36), 5 states have return successors, (36), 3 states have call predecessors, (36), 6 states have call successors, (36) [2024-10-24 11:43:52,011 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 211 transitions. [2024-10-24 11:43:52,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-24 11:43:52,012 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:43:52,012 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:43:52,027 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-24 11:43:52,213 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,SelfDestructingSolverStorable7 [2024-10-24 11:43:52,213 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:43:52,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:43:52,214 INFO L85 PathProgramCache]: Analyzing trace with hash -1499995380, now seen corresponding path program 1 times [2024-10-24 11:43:52,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:43:52,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854946907] [2024-10-24 11:43:52,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:43:52,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:43:52,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:52,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:43:52,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:52,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:43:52,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:52,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:43:52,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:52,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:43:52,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:52,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:43:52,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:52,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:43:52,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:52,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:43:52,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:52,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:43:52,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:52,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:43:52,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:52,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:43:52,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:52,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:43:52,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:52,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:43:52,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:52,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:43:52,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:52,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:43:52,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:52,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:43:52,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:52,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 11:43:52,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:52,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:43:52,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:52,688 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 30 proven. 18 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-10-24 11:43:52,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:43:52,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854946907] [2024-10-24 11:43:52,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854946907] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 11:43:52,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [431823134] [2024-10-24 11:43:52,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:43:52,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 11:43:52,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:43:52,690 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-10-24 11:43:52,691 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-10-24 11:43:52,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:52,885 INFO L255 TraceCheckSpWp]: Trace formula consists of 604 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-24 11:43:52,891 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:43:53,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-24 11:43:53,169 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 37 treesize of output 25 [2024-10-24 11:43:53,179 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 11 treesize of output 7 [2024-10-24 11:43:53,196 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 30 proven. 264 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2024-10-24 11:43:53,197 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:43:53,383 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 36 treesize of output 32 [2024-10-24 11:43:53,464 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 30 proven. 18 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-10-24 11:43:53,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [431823134] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 11:43:53,465 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 11:43:53,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 21 [2024-10-24 11:43:53,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748356762] [2024-10-24 11:43:53,465 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 11:43:53,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-24 11:43:53,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:43:53,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-24 11:43:53,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2024-10-24 11:43:53,467 INFO L87 Difference]: Start difference. First operand 151 states and 211 transitions. Second operand has 21 states, 18 states have (on average 4.166666666666667) internal successors, (75), 19 states have internal predecessors, (75), 5 states have call successors, (35), 3 states have call predecessors, (35), 6 states have return successors, (35), 4 states have call predecessors, (35), 5 states have call successors, (35) [2024-10-24 11:43:54,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:43:54,151 INFO L93 Difference]: Finished difference Result 382 states and 526 transitions. [2024-10-24 11:43:54,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-24 11:43:54,151 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 4.166666666666667) internal successors, (75), 19 states have internal predecessors, (75), 5 states have call successors, (35), 3 states have call predecessors, (35), 6 states have return successors, (35), 4 states have call predecessors, (35), 5 states have call successors, (35) Word has length 131 [2024-10-24 11:43:54,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:43:54,153 INFO L225 Difference]: With dead ends: 382 [2024-10-24 11:43:54,153 INFO L226 Difference]: Without dead ends: 252 [2024-10-24 11:43:54,153 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 283 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=280, Invalid=1052, Unknown=0, NotChecked=0, Total=1332 [2024-10-24 11:43:54,154 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 873 mSDsluCounter, 1287 mSDsCounter, 0 mSdLazyCounter, 783 mSolverCounterSat, 173 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 890 SdHoareTripleChecker+Valid, 1483 SdHoareTripleChecker+Invalid, 956 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 173 IncrementalHoareTripleChecker+Valid, 783 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 11:43:54,154 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [890 Valid, 1483 Invalid, 956 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [173 Valid, 783 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 11:43:54,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2024-10-24 11:43:54,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 239. [2024-10-24 11:43:54,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 188 states have (on average 1.2925531914893618) internal successors, (243), 190 states have internal predecessors, (243), 44 states have call successors, (44), 6 states have call predecessors, (44), 6 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2024-10-24 11:43:54,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 331 transitions. [2024-10-24 11:43:54,171 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 331 transitions. Word has length 131 [2024-10-24 11:43:54,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:43:54,172 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 331 transitions. [2024-10-24 11:43:54,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 4.166666666666667) internal successors, (75), 19 states have internal predecessors, (75), 5 states have call successors, (35), 3 states have call predecessors, (35), 6 states have return successors, (35), 4 states have call predecessors, (35), 5 states have call successors, (35) [2024-10-24 11:43:54,172 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 331 transitions. [2024-10-24 11:43:54,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-10-24 11:43:54,173 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:43:54,173 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:43:54,190 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-24 11:43:54,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 11:43:54,374 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:43:54,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:43:54,374 INFO L85 PathProgramCache]: Analyzing trace with hash -621274919, now seen corresponding path program 1 times [2024-10-24 11:43:54,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:43:54,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769833444] [2024-10-24 11:43:54,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:43:54,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:43:54,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:54,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:43:54,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:54,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:43:54,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:54,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:43:54,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:54,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:43:54,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:54,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:43:54,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:54,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:43:54,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:54,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:43:54,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:54,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:43:54,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:54,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:43:54,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:54,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:43:54,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:54,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:43:54,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:54,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:43:54,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:54,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:43:54,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:54,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:43:54,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:54,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:43:54,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:54,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 11:43:54,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:54,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:43:54,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:54,592 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-24 11:43:54,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:43:54,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769833444] [2024-10-24 11:43:54,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769833444] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:43:54,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:43:54,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 11:43:54,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354314688] [2024-10-24 11:43:54,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:43:54,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:43:54,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:43:54,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:43:54,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:43:54,594 INFO L87 Difference]: Start difference. First operand 239 states and 331 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 11:43:54,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:43:54,688 INFO L93 Difference]: Finished difference Result 681 states and 939 transitions. [2024-10-24 11:43:54,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 11:43:54,689 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 132 [2024-10-24 11:43:54,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:43:54,693 INFO L225 Difference]: With dead ends: 681 [2024-10-24 11:43:54,696 INFO L226 Difference]: Without dead ends: 463 [2024-10-24 11:43:54,697 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-24 11:43:54,697 INFO L432 NwaCegarLoop]: 218 mSDtfsCounter, 140 mSDsluCounter, 776 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 994 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:43:54,698 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 994 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:43:54,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2024-10-24 11:43:54,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 247. [2024-10-24 11:43:54,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 196 states have (on average 1.2908163265306123) internal successors, (253), 198 states have internal predecessors, (253), 44 states have call successors, (44), 6 states have call predecessors, (44), 6 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2024-10-24 11:43:54,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 341 transitions. [2024-10-24 11:43:54,715 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 341 transitions. Word has length 132 [2024-10-24 11:43:54,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:43:54,716 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 341 transitions. [2024-10-24 11:43:54,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 11:43:54,716 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 341 transitions. [2024-10-24 11:43:54,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-10-24 11:43:54,717 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:43:54,717 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:43:54,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 11:43:54,717 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:43:54,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:43:54,717 INFO L85 PathProgramCache]: Analyzing trace with hash -646180905, now seen corresponding path program 1 times [2024-10-24 11:43:54,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:43:54,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105136106] [2024-10-24 11:43:54,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:43:54,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:43:54,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:54,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:43:54,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:54,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:43:54,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:54,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:43:54,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:54,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:43:54,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:54,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:43:54,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:54,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:43:54,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:54,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:43:54,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:54,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:43:54,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:54,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:43:54,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:54,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:43:54,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:54,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:43:54,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:54,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:43:54,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:54,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:43:54,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:54,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:43:54,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:54,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:43:54,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:54,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 11:43:54,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:54,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:43:54,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:54,987 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-24 11:43:54,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:43:54,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105136106] [2024-10-24 11:43:54,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105136106] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:43:54,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:43:54,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 11:43:54,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017357783] [2024-10-24 11:43:54,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:43:54,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:43:54,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:43:54,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:43:54,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:43:54,990 INFO L87 Difference]: Start difference. First operand 247 states and 341 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 11:43:55,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:43:55,100 INFO L93 Difference]: Finished difference Result 471 states and 649 transitions. [2024-10-24 11:43:55,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 11:43:55,100 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 132 [2024-10-24 11:43:55,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:43:55,102 INFO L225 Difference]: With dead ends: 471 [2024-10-24 11:43:55,102 INFO L226 Difference]: Without dead ends: 245 [2024-10-24 11:43:55,103 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-24 11:43:55,103 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 224 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:43:55,103 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 356 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:43:55,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2024-10-24 11:43:55,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 243. [2024-10-24 11:43:55,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 192 states have (on average 1.2864583333333333) internal successors, (247), 194 states have internal predecessors, (247), 44 states have call successors, (44), 6 states have call predecessors, (44), 6 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2024-10-24 11:43:55,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 335 transitions. [2024-10-24 11:43:55,122 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 335 transitions. Word has length 132 [2024-10-24 11:43:55,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:43:55,123 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 335 transitions. [2024-10-24 11:43:55,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 11:43:55,123 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 335 transitions. [2024-10-24 11:43:55,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-24 11:43:55,124 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:43:55,124 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:43:55,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-24 11:43:55,124 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:43:55,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:43:55,125 INFO L85 PathProgramCache]: Analyzing trace with hash 2054905927, now seen corresponding path program 1 times [2024-10-24 11:43:55,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:43:55,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012804832] [2024-10-24 11:43:55,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:43:55,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:43:55,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:55,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:43:55,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:55,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:43:55,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:55,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:43:55,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:55,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:43:55,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:55,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:43:55,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:55,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:43:55,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:55,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:43:55,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:55,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:43:55,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:55,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:43:55,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:55,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:43:55,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:55,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:43:55,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:55,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:43:55,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:55,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:43:55,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:55,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:43:55,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:55,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:43:55,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:55,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 11:43:55,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:55,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:43:55,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:55,277 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-24 11:43:55,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:43:55,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012804832] [2024-10-24 11:43:55,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012804832] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:43:55,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:43:55,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:43:55,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100379383] [2024-10-24 11:43:55,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:43:55,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:43:55,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:43:55,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:43:55,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:43:55,279 INFO L87 Difference]: Start difference. First operand 243 states and 335 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 11:43:55,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:43:55,402 INFO L93 Difference]: Finished difference Result 588 states and 800 transitions. [2024-10-24 11:43:55,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:43:55,402 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 133 [2024-10-24 11:43:55,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:43:55,404 INFO L225 Difference]: With dead ends: 588 [2024-10-24 11:43:55,404 INFO L226 Difference]: Without dead ends: 366 [2024-10-24 11:43:55,405 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:43:55,405 INFO L432 NwaCegarLoop]: 241 mSDtfsCounter, 113 mSDsluCounter, 557 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 798 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:43:55,405 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 798 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:43:55,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2024-10-24 11:43:55,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 170. [2024-10-24 11:43:55,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 129 states have (on average 1.2403100775193798) internal successors, (160), 130 states have internal predecessors, (160), 34 states have call successors, (34), 6 states have call predecessors, (34), 6 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-24 11:43:55,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 228 transitions. [2024-10-24 11:43:55,422 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 228 transitions. Word has length 133 [2024-10-24 11:43:55,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:43:55,422 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 228 transitions. [2024-10-24 11:43:55,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 11:43:55,422 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 228 transitions. [2024-10-24 11:43:55,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-10-24 11:43:55,423 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:43:55,423 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:43:55,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-24 11:43:55,423 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:43:55,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:43:55,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1503991326, now seen corresponding path program 1 times [2024-10-24 11:43:55,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:43:55,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836200383] [2024-10-24 11:43:55,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:43:55,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:43:55,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:55,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:43:55,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:55,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:43:55,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:55,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:43:55,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:55,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:43:55,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:55,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:43:55,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:55,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:43:55,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:55,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:43:55,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:55,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:43:55,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:55,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:43:55,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:55,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:43:55,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:55,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:43:55,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:55,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:43:55,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:55,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:43:55,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:55,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:43:55,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:55,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:43:55,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:55,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 11:43:55,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:55,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:43:55,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:55,866 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-24 11:43:55,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:43:55,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836200383] [2024-10-24 11:43:55,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836200383] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:43:55,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:43:55,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 11:43:55,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078213126] [2024-10-24 11:43:55,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:43:55,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:43:55,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:43:55,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:43:55,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:43:55,868 INFO L87 Difference]: Start difference. First operand 170 states and 228 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 11:43:55,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:43:55,984 INFO L93 Difference]: Finished difference Result 361 states and 483 transitions. [2024-10-24 11:43:55,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 11:43:55,985 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 134 [2024-10-24 11:43:55,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:43:55,986 INFO L225 Difference]: With dead ends: 361 [2024-10-24 11:43:55,986 INFO L226 Difference]: Without dead ends: 243 [2024-10-24 11:43:55,986 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-24 11:43:55,987 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 73 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 711 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:43:55,987 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 711 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:43:55,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2024-10-24 11:43:56,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 240. [2024-10-24 11:43:56,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 192 states have (on average 1.2552083333333333) internal successors, (241), 194 states have internal predecessors, (241), 40 states have call successors, (40), 7 states have call predecessors, (40), 7 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-24 11:43:56,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 321 transitions. [2024-10-24 11:43:56,007 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 321 transitions. Word has length 134 [2024-10-24 11:43:56,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:43:56,007 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 321 transitions. [2024-10-24 11:43:56,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 11:43:56,007 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 321 transitions. [2024-10-24 11:43:56,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-10-24 11:43:56,009 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:43:56,009 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:43:56,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-24 11:43:56,010 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:43:56,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:43:56,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1230609614, now seen corresponding path program 1 times [2024-10-24 11:43:56,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:43:56,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815030397] [2024-10-24 11:43:56,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:43:56,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:43:56,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:56,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:43:56,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:56,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:43:56,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:56,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:43:56,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:56,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:43:56,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:56,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:43:56,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:56,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:43:56,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:56,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:43:56,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:56,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:43:56,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:56,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:43:56,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:56,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:43:56,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:56,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:43:56,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:56,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:43:56,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:56,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:43:56,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:56,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:43:56,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:56,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:43:56,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:56,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 11:43:56,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:56,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:43:56,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:56,150 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-24 11:43:56,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:43:56,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815030397] [2024-10-24 11:43:56,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815030397] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:43:56,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:43:56,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:43:56,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841326269] [2024-10-24 11:43:56,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:43:56,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:43:56,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:43:56,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:43:56,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:43:56,152 INFO L87 Difference]: Start difference. First operand 240 states and 321 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 11:43:56,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:43:56,263 INFO L93 Difference]: Finished difference Result 567 states and 759 transitions. [2024-10-24 11:43:56,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:43:56,264 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 134 [2024-10-24 11:43:56,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:43:56,266 INFO L225 Difference]: With dead ends: 567 [2024-10-24 11:43:56,266 INFO L226 Difference]: Without dead ends: 379 [2024-10-24 11:43:56,267 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:43:56,267 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 108 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:43:56,267 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 508 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:43:56,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2024-10-24 11:43:56,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 240. [2024-10-24 11:43:56,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 192 states have (on average 1.2447916666666667) internal successors, (239), 194 states have internal predecessors, (239), 40 states have call successors, (40), 7 states have call predecessors, (40), 7 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-24 11:43:56,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 319 transitions. [2024-10-24 11:43:56,297 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 319 transitions. Word has length 134 [2024-10-24 11:43:56,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:43:56,297 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 319 transitions. [2024-10-24 11:43:56,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 11:43:56,297 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 319 transitions. [2024-10-24 11:43:56,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-24 11:43:56,298 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:43:56,298 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:43:56,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-24 11:43:56,299 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:43:56,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:43:56,299 INFO L85 PathProgramCache]: Analyzing trace with hash -2106226912, now seen corresponding path program 1 times [2024-10-24 11:43:56,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:43:56,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145489603] [2024-10-24 11:43:56,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:43:56,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:43:56,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:56,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:43:56,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:56,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:43:56,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:56,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:43:56,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:56,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:43:56,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:56,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:43:56,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:56,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:43:56,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:56,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:43:56,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:56,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:43:56,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:56,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:43:56,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:56,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:43:56,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:56,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:43:56,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:56,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:43:56,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:56,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:43:56,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:56,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:43:56,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:56,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:43:56,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:56,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 11:43:56,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:56,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:43:56,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:56,573 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-24 11:43:56,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:43:56,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145489603] [2024-10-24 11:43:56,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145489603] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:43:56,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:43:56,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 11:43:56,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756525488] [2024-10-24 11:43:56,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:43:56,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:43:56,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:43:56,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:43:56,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:43:56,575 INFO L87 Difference]: Start difference. First operand 240 states and 319 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 11:43:56,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:43:56,673 INFO L93 Difference]: Finished difference Result 428 states and 569 transitions. [2024-10-24 11:43:56,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 11:43:56,674 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 135 [2024-10-24 11:43:56,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:43:56,675 INFO L225 Difference]: With dead ends: 428 [2024-10-24 11:43:56,675 INFO L226 Difference]: Without dead ends: 240 [2024-10-24 11:43:56,676 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-24 11:43:56,676 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 131 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:43:56,677 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 353 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:43:56,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2024-10-24 11:43:56,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 240. [2024-10-24 11:43:56,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 192 states have (on average 1.234375) internal successors, (237), 194 states have internal predecessors, (237), 40 states have call successors, (40), 7 states have call predecessors, (40), 7 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-24 11:43:56,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 317 transitions. [2024-10-24 11:43:56,696 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 317 transitions. Word has length 135 [2024-10-24 11:43:56,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:43:56,697 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 317 transitions. [2024-10-24 11:43:56,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 11:43:56,697 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 317 transitions. [2024-10-24 11:43:56,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-24 11:43:56,699 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:43:56,699 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:43:56,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-24 11:43:56,699 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:43:56,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:43:56,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1085158558, now seen corresponding path program 1 times [2024-10-24 11:43:56,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:43:56,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216603] [2024-10-24 11:43:56,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:43:56,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:43:56,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:57,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:43:57,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:57,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:43:57,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:57,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:43:57,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:57,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:43:57,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:57,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:43:57,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:57,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:43:57,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:57,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:43:57,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:57,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:43:57,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:57,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:43:57,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:57,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:43:57,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:57,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:43:57,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:57,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:43:57,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:57,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:43:57,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:57,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:43:57,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:57,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:43:57,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:57,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 11:43:57,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:57,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:43:57,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:57,172 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-24 11:43:57,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:43:57,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216603] [2024-10-24 11:43:57,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216603] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:43:57,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:43:57,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 11:43:57,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473178487] [2024-10-24 11:43:57,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:43:57,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 11:43:57,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:43:57,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 11:43:57,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:43:57,174 INFO L87 Difference]: Start difference. First operand 240 states and 317 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 11:43:57,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:43:57,320 INFO L93 Difference]: Finished difference Result 517 states and 681 transitions. [2024-10-24 11:43:57,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 11:43:57,324 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 135 [2024-10-24 11:43:57,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:43:57,326 INFO L225 Difference]: With dead ends: 517 [2024-10-24 11:43:57,326 INFO L226 Difference]: Without dead ends: 329 [2024-10-24 11:43:57,326 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-10-24 11:43:57,327 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 46 mSDsluCounter, 814 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 991 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:43:57,327 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 991 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:43:57,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2024-10-24 11:43:57,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 250. [2024-10-24 11:43:57,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 202 states have (on average 1.2227722772277227) internal successors, (247), 204 states have internal predecessors, (247), 40 states have call successors, (40), 7 states have call predecessors, (40), 7 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-24 11:43:57,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 327 transitions. [2024-10-24 11:43:57,345 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 327 transitions. Word has length 135 [2024-10-24 11:43:57,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:43:57,346 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 327 transitions. [2024-10-24 11:43:57,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 11:43:57,346 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 327 transitions. [2024-10-24 11:43:57,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-24 11:43:57,347 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:43:57,347 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:43:57,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-24 11:43:57,347 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:43:57,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:43:57,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1902807008, now seen corresponding path program 1 times [2024-10-24 11:43:57,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:43:57,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574678351] [2024-10-24 11:43:57,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:43:57,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:43:57,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:57,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:43:57,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:57,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:43:57,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:57,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:43:57,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:57,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:43:57,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:57,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:43:57,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:57,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:43:57,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:57,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:43:57,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:57,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:43:57,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:57,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:43:57,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:57,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:43:57,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:57,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:43:57,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:57,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:43:57,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:57,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:43:57,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:57,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:43:57,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:57,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:43:57,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:57,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 11:43:57,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:57,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:43:57,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:57,595 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-24 11:43:57,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:43:57,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574678351] [2024-10-24 11:43:57,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574678351] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:43:57,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:43:57,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 11:43:57,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634011053] [2024-10-24 11:43:57,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:43:57,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:43:57,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:43:57,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:43:57,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:43:57,597 INFO L87 Difference]: Start difference. First operand 250 states and 327 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 11:43:57,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:43:57,702 INFO L93 Difference]: Finished difference Result 432 states and 567 transitions. [2024-10-24 11:43:57,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 11:43:57,703 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 135 [2024-10-24 11:43:57,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:43:57,704 INFO L225 Difference]: With dead ends: 432 [2024-10-24 11:43:57,704 INFO L226 Difference]: Without dead ends: 234 [2024-10-24 11:43:57,705 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-24 11:43:57,705 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 133 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:43:57,706 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 347 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:43:57,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2024-10-24 11:43:57,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 234. [2024-10-24 11:43:57,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 186 states have (on average 1.2204301075268817) internal successors, (227), 188 states have internal predecessors, (227), 40 states have call successors, (40), 7 states have call predecessors, (40), 7 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-24 11:43:57,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 307 transitions. [2024-10-24 11:43:57,724 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 307 transitions. Word has length 135 [2024-10-24 11:43:57,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:43:57,725 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 307 transitions. [2024-10-24 11:43:57,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 11:43:57,725 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 307 transitions. [2024-10-24 11:43:57,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-10-24 11:43:57,726 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:43:57,726 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:43:57,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-24 11:43:57,726 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:43:57,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:43:57,726 INFO L85 PathProgramCache]: Analyzing trace with hash 313186233, now seen corresponding path program 1 times [2024-10-24 11:43:57,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:43:57,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707532330] [2024-10-24 11:43:57,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:43:57,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:43:57,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:57,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:43:57,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:57,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:43:57,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:57,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:43:57,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:57,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:43:57,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:57,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:43:57,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:57,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:43:57,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:57,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:43:57,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:57,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:43:57,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:57,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:43:57,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:57,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:43:57,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:57,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:43:57,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:57,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:43:57,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:57,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:43:57,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:57,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:43:57,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:57,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:43:57,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:57,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 11:43:57,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:57,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:43:57,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:57,914 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-24 11:43:57,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:43:57,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707532330] [2024-10-24 11:43:57,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707532330] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:43:57,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:43:57,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 11:43:57,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110117072] [2024-10-24 11:43:57,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:43:57,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:43:57,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:43:57,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:43:57,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:43:57,915 INFO L87 Difference]: Start difference. First operand 234 states and 307 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 11:43:58,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:43:58,133 INFO L93 Difference]: Finished difference Result 633 states and 831 transitions. [2024-10-24 11:43:58,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 11:43:58,134 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 137 [2024-10-24 11:43:58,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:43:58,136 INFO L225 Difference]: With dead ends: 633 [2024-10-24 11:43:58,136 INFO L226 Difference]: Without dead ends: 451 [2024-10-24 11:43:58,136 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:43:58,137 INFO L432 NwaCegarLoop]: 277 mSDtfsCounter, 210 mSDsluCounter, 685 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 962 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:43:58,137 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 962 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 11:43:58,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2024-10-24 11:43:58,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 353. [2024-10-24 11:43:58,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 285 states have (on average 1.2350877192982457) internal successors, (352), 287 states have internal predecessors, (352), 57 states have call successors, (57), 10 states have call predecessors, (57), 10 states have return successors, (57), 55 states have call predecessors, (57), 57 states have call successors, (57) [2024-10-24 11:43:58,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 466 transitions. [2024-10-24 11:43:58,163 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 466 transitions. Word has length 137 [2024-10-24 11:43:58,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:43:58,163 INFO L471 AbstractCegarLoop]: Abstraction has 353 states and 466 transitions. [2024-10-24 11:43:58,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 11:43:58,164 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 466 transitions. [2024-10-24 11:43:58,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-10-24 11:43:58,165 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:43:58,165 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:43:58,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-24 11:43:58,165 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:43:58,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:43:58,165 INFO L85 PathProgramCache]: Analyzing trace with hash 1531003606, now seen corresponding path program 1 times [2024-10-24 11:43:58,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:43:58,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963410432] [2024-10-24 11:43:58,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:43:58,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:43:58,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:58,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:43:58,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:58,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:43:58,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:58,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:43:58,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:58,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:43:58,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:58,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:43:58,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:58,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:43:58,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:58,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:43:58,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:58,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:43:58,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:58,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:43:58,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:58,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:43:58,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:58,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:43:58,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:58,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:43:58,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:58,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:43:58,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:58,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 11:43:58,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:58,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 11:43:58,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:58,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 11:43:58,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:58,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 11:43:58,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:43:58,345 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-24 11:43:58,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:43:58,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963410432] [2024-10-24 11:43:58,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963410432] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:43:58,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:43:58,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:43:58,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709087854] [2024-10-24 11:43:58,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:43:58,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:43:58,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:43:58,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:43:58,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:43:58,347 INFO L87 Difference]: Start difference. First operand 353 states and 466 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 11:43:58,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:43:58,412 INFO L93 Difference]: Finished difference Result 369 states and 482 transitions. [2024-10-24 11:43:58,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:43:58,412 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 138 [2024-10-24 11:43:58,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:43:58,414 INFO L225 Difference]: With dead ends: 369 [2024-10-24 11:43:58,414 INFO L226 Difference]: Without dead ends: 367 [2024-10-24 11:43:58,414 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:43:58,414 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 77 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:43:58,415 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 507 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:43:58,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2024-10-24 11:43:58,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 367. [2024-10-24 11:43:58,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 297 states have (on average 1.2255892255892256) internal successors, (364), 299 states have internal predecessors, (364), 57 states have call successors, (57), 12 states have call predecessors, (57), 12 states have return successors, (57), 55 states have call predecessors, (57), 57 states have call successors, (57) [2024-10-24 11:43:58,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 478 transitions. [2024-10-24 11:43:58,443 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 478 transitions. Word has length 138 [2024-10-24 11:43:58,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:43:58,443 INFO L471 AbstractCegarLoop]: Abstraction has 367 states and 478 transitions. [2024-10-24 11:43:58,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 11:43:58,444 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 478 transitions. [2024-10-24 11:43:58,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-10-24 11:43:58,445 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:43:58,445 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:43:58,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-24 11:43:58,445 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:43:58,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:43:58,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1531063188, now seen corresponding path program 1 times [2024-10-24 11:43:58,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:43:58,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780876891] [2024-10-24 11:43:58,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:43:58,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:43:58,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 11:43:58,504 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 11:43:58,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 11:43:58,630 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 11:43:58,631 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 11:43:58,631 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 11:43:58,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-24 11:43:58,636 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] [2024-10-24 11:43:58,790 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 11:43:58,792 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 11:43:58 BoogieIcfgContainer [2024-10-24 11:43:58,792 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 11:43:58,793 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 11:43:58,793 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 11:43:58,793 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 11:43:58,793 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:43:45" (3/4) ... [2024-10-24 11:43:58,794 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 11:43:58,795 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 11:43:58,796 INFO L158 Benchmark]: Toolchain (without parser) took 14545.35ms. Allocated memory was 172.0MB in the beginning and 478.2MB in the end (delta: 306.2MB). Free memory was 104.2MB in the beginning and 253.6MB in the end (delta: -149.4MB). Peak memory consumption was 158.3MB. Max. memory is 16.1GB. [2024-10-24 11:43:58,796 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 104.9MB. Free memory is still 67.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 11:43:58,796 INFO L158 Benchmark]: CACSL2BoogieTranslator took 277.21ms. Allocated memory is still 172.0MB. Free memory was 103.9MB in the beginning and 140.8MB in the end (delta: -36.9MB). Peak memory consumption was 17.5MB. Max. memory is 16.1GB. [2024-10-24 11:43:58,796 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.00ms. Allocated memory is still 172.0MB. Free memory was 140.8MB in the beginning and 137.3MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 11:43:58,796 INFO L158 Benchmark]: Boogie Preprocessor took 74.53ms. Allocated memory is still 172.0MB. Free memory was 137.3MB in the beginning and 131.6MB in the end (delta: 5.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-24 11:43:58,797 INFO L158 Benchmark]: RCFGBuilder took 635.83ms. Allocated memory is still 172.0MB. Free memory was 131.6MB in the beginning and 83.4MB in the end (delta: 48.2MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. [2024-10-24 11:43:58,797 INFO L158 Benchmark]: TraceAbstraction took 13508.46ms. Allocated memory was 172.0MB in the beginning and 478.2MB in the end (delta: 306.2MB). Free memory was 82.7MB in the beginning and 254.7MB in the end (delta: -171.9MB). Peak memory consumption was 134.5MB. Max. memory is 16.1GB. [2024-10-24 11:43:58,797 INFO L158 Benchmark]: Witness Printer took 2.82ms. Allocated memory is still 478.2MB. Free memory was 254.7MB in the beginning and 253.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 11:43:58,798 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.13ms. Allocated memory is still 104.9MB. Free memory is still 67.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 277.21ms. Allocated memory is still 172.0MB. Free memory was 103.9MB in the beginning and 140.8MB in the end (delta: -36.9MB). Peak memory consumption was 17.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.00ms. Allocated memory is still 172.0MB. Free memory was 140.8MB in the beginning and 137.3MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 74.53ms. Allocated memory is still 172.0MB. Free memory was 137.3MB in the beginning and 131.6MB in the end (delta: 5.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 635.83ms. Allocated memory is still 172.0MB. Free memory was 131.6MB in the beginning and 83.4MB in the end (delta: 48.2MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. * TraceAbstraction took 13508.46ms. Allocated memory was 172.0MB in the beginning and 478.2MB in the end (delta: 306.2MB). Free memory was 82.7MB in the beginning and 254.7MB in the end (delta: -171.9MB). Peak memory consumption was 134.5MB. Max. memory is 16.1GB. * Witness Printer took 2.82ms. Allocated memory is still 478.2MB. Free memory was 254.7MB in the beginning and 253.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 115. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 16; [L22] signed short int var_1_1 = 16; [L23] signed short int* var_1_1_Pointer = &(var_1_1); [L24] signed short int var_1_7 = 32; [L24] signed short int var_1_7 = 32; [L25] signed short int* var_1_7_Pointer = &(var_1_7); [L26] signed short int var_1_8 = 20113; [L26] signed short int var_1_8 = 20113; [L27] signed short int* var_1_8_Pointer = &(var_1_8); [L28] signed short int var_1_9 = 100; [L28] signed short int var_1_9 = 100; [L29] signed short int* var_1_9_Pointer = &(var_1_9); [L30] signed char var_1_10 = 100; [L30] signed char var_1_10 = 100; [L31] signed char* var_1_10_Pointer = &(var_1_10); [L32] signed char var_1_11 = -1; [L32] signed char var_1_11 = -1; [L33] signed char* var_1_11_Pointer = &(var_1_11); [L34] signed char var_1_12 = 16; [L34] signed char var_1_12 = 16; [L35] signed char* var_1_12_Pointer = &(var_1_12); [L36] unsigned char var_1_13 = 1; [L36] unsigned char var_1_13 = 1; [L37] unsigned char* var_1_13_Pointer = &(var_1_13); [L38] unsigned char var_1_15 = 0; [L38] unsigned char var_1_15 = 0; [L39] unsigned char* var_1_15_Pointer = &(var_1_15); [L40] unsigned char var_1_16 = 1; [L40] unsigned char var_1_16 = 1; [L41] unsigned char* var_1_16_Pointer = &(var_1_16); [L42] unsigned short int var_1_18 = 10; [L42] unsigned short int var_1_18 = 10; [L43] unsigned short int* var_1_18_Pointer = &(var_1_18); [L44] unsigned short int var_1_19 = 256; [L44] unsigned short int var_1_19 = 256; [L45] unsigned short int* var_1_19_Pointer = &(var_1_19); [L46] float var_1_20 = 32.5; [L46] float var_1_20 = 32.5; [L47] float* var_1_20_Pointer = &(var_1_20); [L48] float var_1_21 = 127.4; [L48] float var_1_21 = 127.4; [L49] float* var_1_21_Pointer = &(var_1_21); [L50] signed short int var_1_22 = 128; [L50] signed short int var_1_22 = 128; [L51] signed short int* var_1_22_Pointer = &(var_1_22); [L119] isInitial = 1 [L120] FCALL initially() [L121] COND TRUE 1 [L122] FCALL updateLastVariables() [L123] CALL updateVariables() [L85] var_1_7 = __VERIFIER_nondet_short() [L86] EXPR \read(var_1_7) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L86] CALL assume_abort_if_not(var_1_7 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L86] RET assume_abort_if_not(var_1_7 >= -1) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L87] EXPR \read(var_1_7) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L87] CALL assume_abort_if_not(var_1_7 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L87] RET assume_abort_if_not(var_1_7 <= 32766) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L88] var_1_8 = __VERIFIER_nondet_short() [L89] EXPR \read(var_1_8) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L89] CALL assume_abort_if_not(var_1_8 >= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L89] RET assume_abort_if_not(var_1_8 >= 16383) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L90] EXPR \read(var_1_8) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L90] CALL assume_abort_if_not(var_1_8 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L90] RET assume_abort_if_not(var_1_8 <= 32766) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L91] var_1_9 = __VERIFIER_nondet_short() [L92] EXPR \read(var_1_9) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L92] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L92] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L93] EXPR \read(var_1_9) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L93] CALL assume_abort_if_not(var_1_9 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L93] RET assume_abort_if_not(var_1_9 <= 16383) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L94] var_1_11 = __VERIFIER_nondet_char() [L95] EXPR \read(var_1_11) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L95] CALL assume_abort_if_not(var_1_11 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L95] RET assume_abort_if_not(var_1_11 >= -63) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L96] EXPR \read(var_1_11) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L96] CALL assume_abort_if_not(var_1_11 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L96] RET assume_abort_if_not(var_1_11 <= 63) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L97] var_1_12 = __VERIFIER_nondet_char() [L98] EXPR \read(var_1_12) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L98] CALL assume_abort_if_not(var_1_12 >= -31) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L98] RET assume_abort_if_not(var_1_12 >= -31) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L99] EXPR \read(var_1_12) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L99] CALL assume_abort_if_not(var_1_12 <= 32) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L99] RET assume_abort_if_not(var_1_12 <= 32) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L100] var_1_15 = __VERIFIER_nondet_uchar() [L101] EXPR \read(var_1_15) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L101] CALL assume_abort_if_not(var_1_15 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L101] RET assume_abort_if_not(var_1_15 >= 1) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L102] EXPR \read(var_1_15) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L102] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L102] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L103] var_1_16 = __VERIFIER_nondet_uchar() [L104] EXPR \read(var_1_16) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L104] CALL assume_abort_if_not(var_1_16 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L104] RET assume_abort_if_not(var_1_16 >= 1) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L105] EXPR \read(var_1_16) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L105] CALL assume_abort_if_not(var_1_16 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L105] RET assume_abort_if_not(var_1_16 <= 1) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L106] var_1_19 = __VERIFIER_nondet_ushort() [L107] EXPR \read(var_1_19) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L107] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L107] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L108] EXPR \read(var_1_19) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L108] CALL assume_abort_if_not(var_1_19 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L108] RET assume_abort_if_not(var_1_19 <= 65534) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L109] var_1_21 = __VERIFIER_nondet_float() [L110] EXPR \read(var_1_21) [L110] EXPR var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L110] EXPR var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F [L110] EXPR \read(var_1_21) [L110] EXPR var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L110] EXPR (var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L110] EXPR (var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L110] CALL assume_abort_if_not((var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L110] RET assume_abort_if_not((var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L123] RET updateVariables() [L124] CALL step() [L55] EXPR \read(*var_1_19_Pointer) [L55] (*(var_1_18_Pointer)) = (*(var_1_19_Pointer)) [L56] EXPR \read(*var_1_21_Pointer) [L56] (*(var_1_20_Pointer)) = (*(var_1_21_Pointer)) [L57] EXPR \read(*var_1_12_Pointer) [L57] (*(var_1_22_Pointer)) = (*(var_1_12_Pointer)) [L58] EXPR \read(*var_1_20_Pointer) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L58] COND TRUE 127.5f > (*(var_1_20_Pointer)) [L59] EXPR \read(*var_1_15_Pointer) [L59] EXPR (*(var_1_15_Pointer)) && (*(var_1_16_Pointer)) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L59] EXPR (*(var_1_15_Pointer)) && (*(var_1_16_Pointer)) [L59] EXPR \read(*var_1_16_Pointer) [L59] EXPR (*(var_1_15_Pointer)) && (*(var_1_16_Pointer)) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L59] (*(var_1_13_Pointer)) = ((*(var_1_15_Pointer)) && (*(var_1_16_Pointer))) [L63] EXPR \read(*var_1_18_Pointer) [L63] EXPR \read(*var_1_7_Pointer) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L63] COND TRUE (*(var_1_18_Pointer)) == (*(var_1_7_Pointer)) [L64] EXPR \read(*var_1_11_Pointer) [L64] EXPR \read(*var_1_12_Pointer) [L64] (*(var_1_10_Pointer)) = ((*(var_1_11_Pointer)) + ((*(var_1_12_Pointer)) + -25)) [L72] EXPR \read(*var_1_13_Pointer) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L72] COND TRUE (*(var_1_13_Pointer)) [L73] EXPR \read(*var_1_10_Pointer) [L73] EXPR \read(*var_1_22_Pointer) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L73] COND FALSE !((*(var_1_10_Pointer)) > (*(var_1_22_Pointer))) [L80] (*(var_1_1_Pointer)) = 8 VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L124] RET step() [L125] CALL, EXPR property() [L115] EXPR \read(*var_1_13_Pointer) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L115] EXPR (*(var_1_13_Pointer)) ? (((*(var_1_10_Pointer)) > (*(var_1_22_Pointer))) ? ((*(var_1_13_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_7_Pointer)) - ((*(var_1_8_Pointer)) - (*(var_1_9_Pointer)))))) : ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_18_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed short int) 8))) : 1 [L115] EXPR \read(*var_1_10_Pointer) [L115] EXPR \read(*var_1_22_Pointer) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L115] EXPR ((*(var_1_10_Pointer)) > (*(var_1_22_Pointer))) ? ((*(var_1_13_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_7_Pointer)) - ((*(var_1_8_Pointer)) - (*(var_1_9_Pointer)))))) : ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_18_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed short int) 8)) [L115] EXPR \read(*var_1_1_Pointer) [L115] EXPR ((*(var_1_10_Pointer)) > (*(var_1_22_Pointer))) ? ((*(var_1_13_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_7_Pointer)) - ((*(var_1_8_Pointer)) - (*(var_1_9_Pointer)))))) : ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_18_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed short int) 8)) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L115] EXPR (*(var_1_13_Pointer)) ? (((*(var_1_10_Pointer)) > (*(var_1_22_Pointer))) ? ((*(var_1_13_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_7_Pointer)) - ((*(var_1_8_Pointer)) - (*(var_1_9_Pointer)))))) : ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_18_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed short int) 8))) : 1 VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L115] EXPR ((*(var_1_13_Pointer)) ? (((*(var_1_10_Pointer)) > (*(var_1_22_Pointer))) ? ((*(var_1_13_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_7_Pointer)) - ((*(var_1_8_Pointer)) - (*(var_1_9_Pointer)))))) : ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_18_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed short int) 8))) : 1) && (((*(var_1_18_Pointer)) == (*(var_1_7_Pointer))) ? ((*(var_1_10_Pointer)) == ((signed char) ((*(var_1_11_Pointer)) + ((*(var_1_12_Pointer)) + -25)))) : ((((32 * -25) | (*(var_1_22_Pointer))) >= (*(var_1_11_Pointer))) ? ((*(var_1_13_Pointer)) ? ((*(var_1_10_Pointer)) == ((signed char) (*(var_1_12_Pointer)))) : 1) : 1)) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L115] EXPR ((*(var_1_13_Pointer)) ? (((*(var_1_10_Pointer)) > (*(var_1_22_Pointer))) ? ((*(var_1_13_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_7_Pointer)) - ((*(var_1_8_Pointer)) - (*(var_1_9_Pointer)))))) : ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_18_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed short int) 8))) : 1) && (((*(var_1_18_Pointer)) == (*(var_1_7_Pointer))) ? ((*(var_1_10_Pointer)) == ((signed char) ((*(var_1_11_Pointer)) + ((*(var_1_12_Pointer)) + -25)))) : ((((32 * -25) | (*(var_1_22_Pointer))) >= (*(var_1_11_Pointer))) ? ((*(var_1_13_Pointer)) ? ((*(var_1_10_Pointer)) == ((signed char) (*(var_1_12_Pointer)))) : 1) : 1)) [L115] EXPR \read(*var_1_18_Pointer) [L115] EXPR \read(*var_1_7_Pointer) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L115] EXPR ((*(var_1_18_Pointer)) == (*(var_1_7_Pointer))) ? ((*(var_1_10_Pointer)) == ((signed char) ((*(var_1_11_Pointer)) + ((*(var_1_12_Pointer)) + -25)))) : ((((32 * -25) | (*(var_1_22_Pointer))) >= (*(var_1_11_Pointer))) ? ((*(var_1_13_Pointer)) ? ((*(var_1_10_Pointer)) == ((signed char) (*(var_1_12_Pointer)))) : 1) : 1) [L115] EXPR \read(*var_1_10_Pointer) [L115] EXPR \read(*var_1_11_Pointer) [L115] EXPR \read(*var_1_12_Pointer) [L115] EXPR ((*(var_1_18_Pointer)) == (*(var_1_7_Pointer))) ? ((*(var_1_10_Pointer)) == ((signed char) ((*(var_1_11_Pointer)) + ((*(var_1_12_Pointer)) + -25)))) : ((((32 * -25) | (*(var_1_22_Pointer))) >= (*(var_1_11_Pointer))) ? ((*(var_1_13_Pointer)) ? ((*(var_1_10_Pointer)) == ((signed char) (*(var_1_12_Pointer)))) : 1) : 1) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L115] EXPR ((*(var_1_13_Pointer)) ? (((*(var_1_10_Pointer)) > (*(var_1_22_Pointer))) ? ((*(var_1_13_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_7_Pointer)) - ((*(var_1_8_Pointer)) - (*(var_1_9_Pointer)))))) : ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_18_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed short int) 8))) : 1) && (((*(var_1_18_Pointer)) == (*(var_1_7_Pointer))) ? ((*(var_1_10_Pointer)) == ((signed char) ((*(var_1_11_Pointer)) + ((*(var_1_12_Pointer)) + -25)))) : ((((32 * -25) | (*(var_1_22_Pointer))) >= (*(var_1_11_Pointer))) ? ((*(var_1_13_Pointer)) ? ((*(var_1_10_Pointer)) == ((signed char) (*(var_1_12_Pointer)))) : 1) : 1)) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L115] EXPR (((*(var_1_13_Pointer)) ? (((*(var_1_10_Pointer)) > (*(var_1_22_Pointer))) ? ((*(var_1_13_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_7_Pointer)) - ((*(var_1_8_Pointer)) - (*(var_1_9_Pointer)))))) : ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_18_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed short int) 8))) : 1) && (((*(var_1_18_Pointer)) == (*(var_1_7_Pointer))) ? ((*(var_1_10_Pointer)) == ((signed char) ((*(var_1_11_Pointer)) + ((*(var_1_12_Pointer)) + -25)))) : ((((32 * -25) | (*(var_1_22_Pointer))) >= (*(var_1_11_Pointer))) ? ((*(var_1_13_Pointer)) ? ((*(var_1_10_Pointer)) == ((signed char) (*(var_1_12_Pointer)))) : 1) : 1))) && ((127.5f > (*(var_1_20_Pointer))) ? ((*(var_1_13_Pointer)) == ((unsigned char) ((*(var_1_15_Pointer)) && (*(var_1_16_Pointer))))) : ((*(var_1_13_Pointer)) == ((unsigned char) (((*(var_1_20_Pointer)) >= (*(var_1_20_Pointer))) || (*(var_1_15_Pointer)))))) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L115] EXPR (((*(var_1_13_Pointer)) ? (((*(var_1_10_Pointer)) > (*(var_1_22_Pointer))) ? ((*(var_1_13_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_7_Pointer)) - ((*(var_1_8_Pointer)) - (*(var_1_9_Pointer)))))) : ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_18_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed short int) 8))) : 1) && (((*(var_1_18_Pointer)) == (*(var_1_7_Pointer))) ? ((*(var_1_10_Pointer)) == ((signed char) ((*(var_1_11_Pointer)) + ((*(var_1_12_Pointer)) + -25)))) : ((((32 * -25) | (*(var_1_22_Pointer))) >= (*(var_1_11_Pointer))) ? ((*(var_1_13_Pointer)) ? ((*(var_1_10_Pointer)) == ((signed char) (*(var_1_12_Pointer)))) : 1) : 1))) && ((127.5f > (*(var_1_20_Pointer))) ? ((*(var_1_13_Pointer)) == ((unsigned char) ((*(var_1_15_Pointer)) && (*(var_1_16_Pointer))))) : ((*(var_1_13_Pointer)) == ((unsigned char) (((*(var_1_20_Pointer)) >= (*(var_1_20_Pointer))) || (*(var_1_15_Pointer)))))) [L115] EXPR \read(*var_1_20_Pointer) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L115] EXPR (127.5f > (*(var_1_20_Pointer))) ? ((*(var_1_13_Pointer)) == ((unsigned char) ((*(var_1_15_Pointer)) && (*(var_1_16_Pointer))))) : ((*(var_1_13_Pointer)) == ((unsigned char) (((*(var_1_20_Pointer)) >= (*(var_1_20_Pointer))) || (*(var_1_15_Pointer))))) [L115] EXPR \read(*var_1_13_Pointer) [L115] EXPR \read(*var_1_20_Pointer) [L115] EXPR \read(*var_1_20_Pointer) [L115] EXPR ((*(var_1_20_Pointer)) >= (*(var_1_20_Pointer))) || (*(var_1_15_Pointer)) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L115] EXPR ((*(var_1_20_Pointer)) >= (*(var_1_20_Pointer))) || (*(var_1_15_Pointer)) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L115] EXPR (127.5f > (*(var_1_20_Pointer))) ? ((*(var_1_13_Pointer)) == ((unsigned char) ((*(var_1_15_Pointer)) && (*(var_1_16_Pointer))))) : ((*(var_1_13_Pointer)) == ((unsigned char) (((*(var_1_20_Pointer)) >= (*(var_1_20_Pointer))) || (*(var_1_15_Pointer))))) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L115] EXPR (((*(var_1_13_Pointer)) ? (((*(var_1_10_Pointer)) > (*(var_1_22_Pointer))) ? ((*(var_1_13_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_7_Pointer)) - ((*(var_1_8_Pointer)) - (*(var_1_9_Pointer)))))) : ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_18_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed short int) 8))) : 1) && (((*(var_1_18_Pointer)) == (*(var_1_7_Pointer))) ? ((*(var_1_10_Pointer)) == ((signed char) ((*(var_1_11_Pointer)) + ((*(var_1_12_Pointer)) + -25)))) : ((((32 * -25) | (*(var_1_22_Pointer))) >= (*(var_1_11_Pointer))) ? ((*(var_1_13_Pointer)) ? ((*(var_1_10_Pointer)) == ((signed char) (*(var_1_12_Pointer)))) : 1) : 1))) && ((127.5f > (*(var_1_20_Pointer))) ? ((*(var_1_13_Pointer)) == ((unsigned char) ((*(var_1_15_Pointer)) && (*(var_1_16_Pointer))))) : ((*(var_1_13_Pointer)) == ((unsigned char) (((*(var_1_20_Pointer)) >= (*(var_1_20_Pointer))) || (*(var_1_15_Pointer)))))) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L115] EXPR ((((*(var_1_13_Pointer)) ? (((*(var_1_10_Pointer)) > (*(var_1_22_Pointer))) ? ((*(var_1_13_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_7_Pointer)) - ((*(var_1_8_Pointer)) - (*(var_1_9_Pointer)))))) : ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_18_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed short int) 8))) : 1) && (((*(var_1_18_Pointer)) == (*(var_1_7_Pointer))) ? ((*(var_1_10_Pointer)) == ((signed char) ((*(var_1_11_Pointer)) + ((*(var_1_12_Pointer)) + -25)))) : ((((32 * -25) | (*(var_1_22_Pointer))) >= (*(var_1_11_Pointer))) ? ((*(var_1_13_Pointer)) ? ((*(var_1_10_Pointer)) == ((signed char) (*(var_1_12_Pointer)))) : 1) : 1))) && ((127.5f > (*(var_1_20_Pointer))) ? ((*(var_1_13_Pointer)) == ((unsigned char) ((*(var_1_15_Pointer)) && (*(var_1_16_Pointer))))) : ((*(var_1_13_Pointer)) == ((unsigned char) (((*(var_1_20_Pointer)) >= (*(var_1_20_Pointer))) || (*(var_1_15_Pointer))))))) && ((*(var_1_18_Pointer)) == ((unsigned short int) (*(var_1_19_Pointer)))) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L115] EXPR ((((*(var_1_13_Pointer)) ? (((*(var_1_10_Pointer)) > (*(var_1_22_Pointer))) ? ((*(var_1_13_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_7_Pointer)) - ((*(var_1_8_Pointer)) - (*(var_1_9_Pointer)))))) : ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_18_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed short int) 8))) : 1) && (((*(var_1_18_Pointer)) == (*(var_1_7_Pointer))) ? ((*(var_1_10_Pointer)) == ((signed char) ((*(var_1_11_Pointer)) + ((*(var_1_12_Pointer)) + -25)))) : ((((32 * -25) | (*(var_1_22_Pointer))) >= (*(var_1_11_Pointer))) ? ((*(var_1_13_Pointer)) ? ((*(var_1_10_Pointer)) == ((signed char) (*(var_1_12_Pointer)))) : 1) : 1))) && ((127.5f > (*(var_1_20_Pointer))) ? ((*(var_1_13_Pointer)) == ((unsigned char) ((*(var_1_15_Pointer)) && (*(var_1_16_Pointer))))) : ((*(var_1_13_Pointer)) == ((unsigned char) (((*(var_1_20_Pointer)) >= (*(var_1_20_Pointer))) || (*(var_1_15_Pointer))))))) && ((*(var_1_18_Pointer)) == ((unsigned short int) (*(var_1_19_Pointer)))) [L115] EXPR \read(*var_1_18_Pointer) [L115] EXPR \read(*var_1_19_Pointer) [L115] EXPR ((((*(var_1_13_Pointer)) ? (((*(var_1_10_Pointer)) > (*(var_1_22_Pointer))) ? ((*(var_1_13_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_7_Pointer)) - ((*(var_1_8_Pointer)) - (*(var_1_9_Pointer)))))) : ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_18_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed short int) 8))) : 1) && (((*(var_1_18_Pointer)) == (*(var_1_7_Pointer))) ? ((*(var_1_10_Pointer)) == ((signed char) ((*(var_1_11_Pointer)) + ((*(var_1_12_Pointer)) + -25)))) : ((((32 * -25) | (*(var_1_22_Pointer))) >= (*(var_1_11_Pointer))) ? ((*(var_1_13_Pointer)) ? ((*(var_1_10_Pointer)) == ((signed char) (*(var_1_12_Pointer)))) : 1) : 1))) && ((127.5f > (*(var_1_20_Pointer))) ? ((*(var_1_13_Pointer)) == ((unsigned char) ((*(var_1_15_Pointer)) && (*(var_1_16_Pointer))))) : ((*(var_1_13_Pointer)) == ((unsigned char) (((*(var_1_20_Pointer)) >= (*(var_1_20_Pointer))) || (*(var_1_15_Pointer))))))) && ((*(var_1_18_Pointer)) == ((unsigned short int) (*(var_1_19_Pointer)))) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L115] EXPR (((((*(var_1_13_Pointer)) ? (((*(var_1_10_Pointer)) > (*(var_1_22_Pointer))) ? ((*(var_1_13_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_7_Pointer)) - ((*(var_1_8_Pointer)) - (*(var_1_9_Pointer)))))) : ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_18_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed short int) 8))) : 1) && (((*(var_1_18_Pointer)) == (*(var_1_7_Pointer))) ? ((*(var_1_10_Pointer)) == ((signed char) ((*(var_1_11_Pointer)) + ((*(var_1_12_Pointer)) + -25)))) : ((((32 * -25) | (*(var_1_22_Pointer))) >= (*(var_1_11_Pointer))) ? ((*(var_1_13_Pointer)) ? ((*(var_1_10_Pointer)) == ((signed char) (*(var_1_12_Pointer)))) : 1) : 1))) && ((127.5f > (*(var_1_20_Pointer))) ? ((*(var_1_13_Pointer)) == ((unsigned char) ((*(var_1_15_Pointer)) && (*(var_1_16_Pointer))))) : ((*(var_1_13_Pointer)) == ((unsigned char) (((*(var_1_20_Pointer)) >= (*(var_1_20_Pointer))) || (*(var_1_15_Pointer))))))) && ((*(var_1_18_Pointer)) == ((unsigned short int) (*(var_1_19_Pointer))))) && ((*(var_1_20_Pointer)) == ((float) (*(var_1_21_Pointer)))) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L115] EXPR (((((*(var_1_13_Pointer)) ? (((*(var_1_10_Pointer)) > (*(var_1_22_Pointer))) ? ((*(var_1_13_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_7_Pointer)) - ((*(var_1_8_Pointer)) - (*(var_1_9_Pointer)))))) : ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_18_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed short int) 8))) : 1) && (((*(var_1_18_Pointer)) == (*(var_1_7_Pointer))) ? ((*(var_1_10_Pointer)) == ((signed char) ((*(var_1_11_Pointer)) + ((*(var_1_12_Pointer)) + -25)))) : ((((32 * -25) | (*(var_1_22_Pointer))) >= (*(var_1_11_Pointer))) ? ((*(var_1_13_Pointer)) ? ((*(var_1_10_Pointer)) == ((signed char) (*(var_1_12_Pointer)))) : 1) : 1))) && ((127.5f > (*(var_1_20_Pointer))) ? ((*(var_1_13_Pointer)) == ((unsigned char) ((*(var_1_15_Pointer)) && (*(var_1_16_Pointer))))) : ((*(var_1_13_Pointer)) == ((unsigned char) (((*(var_1_20_Pointer)) >= (*(var_1_20_Pointer))) || (*(var_1_15_Pointer))))))) && ((*(var_1_18_Pointer)) == ((unsigned short int) (*(var_1_19_Pointer))))) && ((*(var_1_20_Pointer)) == ((float) (*(var_1_21_Pointer)))) [L115] EXPR \read(*var_1_20_Pointer) [L115] EXPR \read(*var_1_21_Pointer) [L115] EXPR (((((*(var_1_13_Pointer)) ? (((*(var_1_10_Pointer)) > (*(var_1_22_Pointer))) ? ((*(var_1_13_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_7_Pointer)) - ((*(var_1_8_Pointer)) - (*(var_1_9_Pointer)))))) : ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_18_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed short int) 8))) : 1) && (((*(var_1_18_Pointer)) == (*(var_1_7_Pointer))) ? ((*(var_1_10_Pointer)) == ((signed char) ((*(var_1_11_Pointer)) + ((*(var_1_12_Pointer)) + -25)))) : ((((32 * -25) | (*(var_1_22_Pointer))) >= (*(var_1_11_Pointer))) ? ((*(var_1_13_Pointer)) ? ((*(var_1_10_Pointer)) == ((signed char) (*(var_1_12_Pointer)))) : 1) : 1))) && ((127.5f > (*(var_1_20_Pointer))) ? ((*(var_1_13_Pointer)) == ((unsigned char) ((*(var_1_15_Pointer)) && (*(var_1_16_Pointer))))) : ((*(var_1_13_Pointer)) == ((unsigned char) (((*(var_1_20_Pointer)) >= (*(var_1_20_Pointer))) || (*(var_1_15_Pointer))))))) && ((*(var_1_18_Pointer)) == ((unsigned short int) (*(var_1_19_Pointer))))) && ((*(var_1_20_Pointer)) == ((float) (*(var_1_21_Pointer)))) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L115] EXPR ((((((*(var_1_13_Pointer)) ? (((*(var_1_10_Pointer)) > (*(var_1_22_Pointer))) ? ((*(var_1_13_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_7_Pointer)) - ((*(var_1_8_Pointer)) - (*(var_1_9_Pointer)))))) : ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_18_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed short int) 8))) : 1) && (((*(var_1_18_Pointer)) == (*(var_1_7_Pointer))) ? ((*(var_1_10_Pointer)) == ((signed char) ((*(var_1_11_Pointer)) + ((*(var_1_12_Pointer)) + -25)))) : ((((32 * -25) | (*(var_1_22_Pointer))) >= (*(var_1_11_Pointer))) ? ((*(var_1_13_Pointer)) ? ((*(var_1_10_Pointer)) == ((signed char) (*(var_1_12_Pointer)))) : 1) : 1))) && ((127.5f > (*(var_1_20_Pointer))) ? ((*(var_1_13_Pointer)) == ((unsigned char) ((*(var_1_15_Pointer)) && (*(var_1_16_Pointer))))) : ((*(var_1_13_Pointer)) == ((unsigned char) (((*(var_1_20_Pointer)) >= (*(var_1_20_Pointer))) || (*(var_1_15_Pointer))))))) && ((*(var_1_18_Pointer)) == ((unsigned short int) (*(var_1_19_Pointer))))) && ((*(var_1_20_Pointer)) == ((float) (*(var_1_21_Pointer))))) && ((*(var_1_22_Pointer)) == ((signed short int) (*(var_1_12_Pointer)))) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L115] EXPR ((((((*(var_1_13_Pointer)) ? (((*(var_1_10_Pointer)) > (*(var_1_22_Pointer))) ? ((*(var_1_13_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_7_Pointer)) - ((*(var_1_8_Pointer)) - (*(var_1_9_Pointer)))))) : ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_18_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed short int) 8))) : 1) && (((*(var_1_18_Pointer)) == (*(var_1_7_Pointer))) ? ((*(var_1_10_Pointer)) == ((signed char) ((*(var_1_11_Pointer)) + ((*(var_1_12_Pointer)) + -25)))) : ((((32 * -25) | (*(var_1_22_Pointer))) >= (*(var_1_11_Pointer))) ? ((*(var_1_13_Pointer)) ? ((*(var_1_10_Pointer)) == ((signed char) (*(var_1_12_Pointer)))) : 1) : 1))) && ((127.5f > (*(var_1_20_Pointer))) ? ((*(var_1_13_Pointer)) == ((unsigned char) ((*(var_1_15_Pointer)) && (*(var_1_16_Pointer))))) : ((*(var_1_13_Pointer)) == ((unsigned char) (((*(var_1_20_Pointer)) >= (*(var_1_20_Pointer))) || (*(var_1_15_Pointer))))))) && ((*(var_1_18_Pointer)) == ((unsigned short int) (*(var_1_19_Pointer))))) && ((*(var_1_20_Pointer)) == ((float) (*(var_1_21_Pointer))))) && ((*(var_1_22_Pointer)) == ((signed short int) (*(var_1_12_Pointer)))) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L115-L116] return ((((((*(var_1_13_Pointer)) ? (((*(var_1_10_Pointer)) > (*(var_1_22_Pointer))) ? ((*(var_1_13_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed short int) ((*(var_1_7_Pointer)) - ((*(var_1_8_Pointer)) - (*(var_1_9_Pointer)))))) : ((*(var_1_1_Pointer)) == ((signed short int) (*(var_1_18_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed short int) 8))) : 1) && (((*(var_1_18_Pointer)) == (*(var_1_7_Pointer))) ? ((*(var_1_10_Pointer)) == ((signed char) ((*(var_1_11_Pointer)) + ((*(var_1_12_Pointer)) + -25)))) : ((((32 * -25) | (*(var_1_22_Pointer))) >= (*(var_1_11_Pointer))) ? ((*(var_1_13_Pointer)) ? ((*(var_1_10_Pointer)) == ((signed char) (*(var_1_12_Pointer)))) : 1) : 1))) && ((127.5f > (*(var_1_20_Pointer))) ? ((*(var_1_13_Pointer)) == ((unsigned char) ((*(var_1_15_Pointer)) && (*(var_1_16_Pointer))))) : ((*(var_1_13_Pointer)) == ((unsigned char) (((*(var_1_20_Pointer)) >= (*(var_1_20_Pointer))) || (*(var_1_15_Pointer))))))) && ((*(var_1_18_Pointer)) == ((unsigned short int) (*(var_1_19_Pointer))))) && ((*(var_1_20_Pointer)) == ((float) (*(var_1_21_Pointer))))) && ((*(var_1_22_Pointer)) == ((signed short int) (*(var_1_12_Pointer)))) ; [L125] RET, EXPR property() [L125] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L19] reach_error() VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_16={13:0}, var_1_16_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_19={15:0}, var_1_19_Pointer={15:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={16:0}, var_1_20_Pointer={16:0}, var_1_21={17:0}, var_1_21_Pointer={17:0}, var_1_22={18:0}, var_1_22_Pointer={18:0}, var_1_7={5:0}, var_1_7_Pointer={5:0}, var_1_8={6:0}, var_1_8_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 101 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.3s, OverallIterations: 20, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3290 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3273 mSDsluCounter, 12488 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9389 mSDsCounter, 484 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2991 IncrementalHoareTripleChecker+Invalid, 3475 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 484 mSolverCounterUnsat, 3099 mSDtfsCounter, 2991 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1629 GetRequests, 1452 SyntacticMatches, 7 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 561 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=367occurred in iteration=19, InterpolantAutomatonStates: 146, 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, 19 MinimizatonAttempts, 937 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 6.8s InterpolantComputationTime, 3051 NumberOfCodeBlocks, 3051 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 3281 ConstructedInterpolants, 0 QuantifiedInterpolants, 10252 SizeOfPredicates, 31 NumberOfNonLiveVariables, 1807 ConjunctsInSsa, 63 ConjunctsInUnsatCore, 25 InterpolantComputations, 16 PerfectInterpolantSequences, 12690/13600 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-10-24 11:43:58,826 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-97.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 7188c6f24541aba260187a36aa9df009a62318807d29ed8104d2cc5db8c5a63b --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 11:44:00,664 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 11:44:00,725 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 11:44:00,730 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 11:44:00,730 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 11:44:00,755 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 11:44:00,759 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 11:44:00,759 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 11:44:00,759 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 11:44:00,760 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 11:44:00,760 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 11:44:00,760 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 11:44:00,760 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 11:44:00,761 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 11:44:00,761 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 11:44:00,761 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 11:44:00,761 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 11:44:00,762 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 11:44:00,762 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 11:44:00,764 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 11:44:00,765 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 11:44:00,766 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 11:44:00,767 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 11:44:00,767 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 11:44:00,767 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 11:44:00,767 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 11:44:00,767 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 11:44:00,768 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 11:44:00,768 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 11:44:00,768 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 11:44:00,769 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 11:44:00,770 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 11:44:00,770 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 11:44:00,770 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 11:44:00,770 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:44:00,770 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 11:44:00,771 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 11:44:00,771 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 11:44:00,771 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 11:44:00,772 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 11:44:00,772 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 11:44:00,772 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 11:44:00,773 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 11:44:00,773 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 11:44:00,773 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 11:44:00,773 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 -> 7188c6f24541aba260187a36aa9df009a62318807d29ed8104d2cc5db8c5a63b [2024-10-24 11:44:01,025 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 11:44:01,046 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 11:44:01,048 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 11:44:01,049 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 11:44:01,049 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 11:44:01,050 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-97.i [2024-10-24 11:44:02,362 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 11:44:02,544 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 11:44:02,544 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-97.i [2024-10-24 11:44:02,553 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b514f0850/e0045ae0134c481d9e1cb922de236746/FLAG22c2d8c30 [2024-10-24 11:44:02,564 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b514f0850/e0045ae0134c481d9e1cb922de236746 [2024-10-24 11:44:02,566 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 11:44:02,567 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 11:44:02,568 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 11:44:02,568 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 11:44:02,572 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 11:44:02,572 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:44:02" (1/1) ... [2024-10-24 11:44:02,573 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f204c1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:44:02, skipping insertion in model container [2024-10-24 11:44:02,573 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:44:02" (1/1) ... [2024-10-24 11:44:02,595 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 11:44:02,736 WARN L248 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-97.i[916,929] [2024-10-24 11:44:02,790 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:44:02,808 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 11:44:02,817 WARN L248 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-97.i[916,929] [2024-10-24 11:44:02,842 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:44:02,865 INFO L204 MainTranslator]: Completed translation [2024-10-24 11:44:02,866 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:44:02 WrapperNode [2024-10-24 11:44:02,866 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 11:44:02,866 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 11:44:02,867 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 11:44:02,867 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 11:44:02,871 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:44:02" (1/1) ... [2024-10-24 11:44:02,885 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:44:02" (1/1) ... [2024-10-24 11:44:02,922 INFO L138 Inliner]: procedures = 33, calls = 159, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 450 [2024-10-24 11:44:02,923 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 11:44:02,925 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 11:44:02,925 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 11:44:02,925 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 11:44:02,933 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:44:02" (1/1) ... [2024-10-24 11:44:02,933 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:44:02" (1/1) ... [2024-10-24 11:44:02,939 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:44:02" (1/1) ... [2024-10-24 11:44:02,970 INFO L175 MemorySlicer]: Split 116 memory accesses to 16 slices as follows [2, 7, 8, 6, 6, 7, 8, 10, 11, 8, 6, 7, 6, 9, 8, 7]. 9 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 19 writes are split as follows [0, 3, 1, 1, 1, 2, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1]. [2024-10-24 11:44:02,970 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:44:02" (1/1) ... [2024-10-24 11:44:02,971 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:44:02" (1/1) ... [2024-10-24 11:44:02,990 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:44:02" (1/1) ... [2024-10-24 11:44:02,997 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:44:02" (1/1) ... [2024-10-24 11:44:03,006 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:44:02" (1/1) ... [2024-10-24 11:44:03,012 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:44:02" (1/1) ... [2024-10-24 11:44:03,038 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 11:44:03,041 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 11:44:03,041 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 11:44:03,041 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 11:44:03,042 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:44:02" (1/1) ... [2024-10-24 11:44:03,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:44:03,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:44:03,070 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-10-24 11:44:03,073 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-10-24 11:44:03,113 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 11:44:03,114 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-24 11:44:03,114 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-24 11:44:03,114 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-24 11:44:03,114 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-10-24 11:44:03,115 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-10-24 11:44:03,115 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-10-24 11:44:03,116 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2024-10-24 11:44:03,116 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7 [2024-10-24 11:44:03,116 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#8 [2024-10-24 11:44:03,116 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#9 [2024-10-24 11:44:03,116 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#10 [2024-10-24 11:44:03,116 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#11 [2024-10-24 11:44:03,116 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#12 [2024-10-24 11:44:03,117 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#13 [2024-10-24 11:44:03,117 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#14 [2024-10-24 11:44:03,117 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#15 [2024-10-24 11:44:03,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-10-24 11:44:03,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-10-24 11:44:03,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-10-24 11:44:03,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-10-24 11:44:03,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-10-24 11:44:03,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2024-10-24 11:44:03,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2024-10-24 11:44:03,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#7 [2024-10-24 11:44:03,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#8 [2024-10-24 11:44:03,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#9 [2024-10-24 11:44:03,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#10 [2024-10-24 11:44:03,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#11 [2024-10-24 11:44:03,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#12 [2024-10-24 11:44:03,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#13 [2024-10-24 11:44:03,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#14 [2024-10-24 11:44:03,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#15 [2024-10-24 11:44:03,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 11:44:03,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-24 11:44:03,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-24 11:44:03,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-10-24 11:44:03,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-10-24 11:44:03,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-10-24 11:44:03,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2024-10-24 11:44:03,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2024-10-24 11:44:03,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#8 [2024-10-24 11:44:03,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#9 [2024-10-24 11:44:03,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#10 [2024-10-24 11:44:03,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#11 [2024-10-24 11:44:03,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#12 [2024-10-24 11:44:03,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#13 [2024-10-24 11:44:03,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#14 [2024-10-24 11:44:03,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#15 [2024-10-24 11:44:03,120 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-10-24 11:44:03,120 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-10-24 11:44:03,120 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-10-24 11:44:03,120 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-10-24 11:44:03,120 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-10-24 11:44:03,120 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2024-10-24 11:44:03,121 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#6 [2024-10-24 11:44:03,122 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#7 [2024-10-24 11:44:03,122 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#8 [2024-10-24 11:44:03,122 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#9 [2024-10-24 11:44:03,122 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#10 [2024-10-24 11:44:03,123 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#11 [2024-10-24 11:44:03,123 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#12 [2024-10-24 11:44:03,123 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#13 [2024-10-24 11:44:03,123 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#14 [2024-10-24 11:44:03,123 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#15 [2024-10-24 11:44:03,124 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-10-24 11:44:03,124 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-10-24 11:44:03,124 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-10-24 11:44:03,125 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-10-24 11:44:03,125 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2024-10-24 11:44:03,125 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2024-10-24 11:44:03,125 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#6 [2024-10-24 11:44:03,125 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#7 [2024-10-24 11:44:03,126 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#8 [2024-10-24 11:44:03,126 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#9 [2024-10-24 11:44:03,126 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#10 [2024-10-24 11:44:03,126 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#11 [2024-10-24 11:44:03,126 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#12 [2024-10-24 11:44:03,127 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#13 [2024-10-24 11:44:03,127 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#14 [2024-10-24 11:44:03,127 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#15 [2024-10-24 11:44:03,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-10-24 11:44:03,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-10-24 11:44:03,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-10-24 11:44:03,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-10-24 11:44:03,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2024-10-24 11:44:03,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2024-10-24 11:44:03,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#6 [2024-10-24 11:44:03,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#7 [2024-10-24 11:44:03,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#8 [2024-10-24 11:44:03,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#9 [2024-10-24 11:44:03,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#10 [2024-10-24 11:44:03,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#11 [2024-10-24 11:44:03,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#12 [2024-10-24 11:44:03,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#13 [2024-10-24 11:44:03,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#14 [2024-10-24 11:44:03,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#15 [2024-10-24 11:44:03,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-10-24 11:44:03,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-10-24 11:44:03,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-10-24 11:44:03,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-10-24 11:44:03,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-10-24 11:44:03,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2024-10-24 11:44:03,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#6 [2024-10-24 11:44:03,132 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#7 [2024-10-24 11:44:03,132 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#8 [2024-10-24 11:44:03,132 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#9 [2024-10-24 11:44:03,132 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#10 [2024-10-24 11:44:03,132 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#11 [2024-10-24 11:44:03,132 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#12 [2024-10-24 11:44:03,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#13 [2024-10-24 11:44:03,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#14 [2024-10-24 11:44:03,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#15 [2024-10-24 11:44:03,133 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 11:44:03,134 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 11:44:03,134 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 11:44:03,134 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 11:44:03,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-10-24 11:44:03,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-10-24 11:44:03,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-10-24 11:44:03,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-10-24 11:44:03,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-10-24 11:44:03,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-10-24 11:44:03,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2024-10-24 11:44:03,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7 [2024-10-24 11:44:03,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#8 [2024-10-24 11:44:03,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#9 [2024-10-24 11:44:03,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#10 [2024-10-24 11:44:03,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#11 [2024-10-24 11:44:03,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#12 [2024-10-24 11:44:03,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#13 [2024-10-24 11:44:03,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#14 [2024-10-24 11:44:03,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#15 [2024-10-24 11:44:03,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-10-24 11:44:03,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-10-24 11:44:03,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-10-24 11:44:03,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-10-24 11:44:03,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2024-10-24 11:44:03,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2024-10-24 11:44:03,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#6 [2024-10-24 11:44:03,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#7 [2024-10-24 11:44:03,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#8 [2024-10-24 11:44:03,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#9 [2024-10-24 11:44:03,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#10 [2024-10-24 11:44:03,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#11 [2024-10-24 11:44:03,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#12 [2024-10-24 11:44:03,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#13 [2024-10-24 11:44:03,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#14 [2024-10-24 11:44:03,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#15 [2024-10-24 11:44:03,339 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 11:44:03,340 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 11:44:03,794 INFO L? ?]: Removed 80 outVars from TransFormulas that were not future-live. [2024-10-24 11:44:03,794 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 11:44:03,852 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 11:44:03,852 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 11:44:03,852 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:44:03 BoogieIcfgContainer [2024-10-24 11:44:03,852 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 11:44:03,854 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 11:44:03,854 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 11:44:03,857 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 11:44:03,857 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:44:02" (1/3) ... [2024-10-24 11:44:03,858 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59e2b44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:44:03, skipping insertion in model container [2024-10-24 11:44:03,858 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:44:02" (2/3) ... [2024-10-24 11:44:03,859 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59e2b44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:44:03, skipping insertion in model container [2024-10-24 11:44:03,859 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:44:03" (3/3) ... [2024-10-24 11:44:03,860 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-97.i [2024-10-24 11:44:03,872 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 11:44:03,872 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 11:44:03,919 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 11:44:03,925 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;@1b3fe638, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 11:44:03,925 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 11:44:03,929 INFO L276 IsEmpty]: Start isEmpty. Operand has 93 states, 73 states have (on average 1.4246575342465753) internal successors, (104), 74 states have internal predecessors, (104), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-24 11:44:03,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-24 11:44:03,942 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:44:03,943 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:44:03,943 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:44:03,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:44:03,947 INFO L85 PathProgramCache]: Analyzing trace with hash -61911549, now seen corresponding path program 1 times [2024-10-24 11:44:03,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:44:03,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [110641913] [2024-10-24 11:44:03,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:44:03,961 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-10-24 11:44:03,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:44:03,964 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-10-24 11:44:03,965 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-10-24 11:44:04,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:44:04,267 INFO L255 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 11:44:04,274 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:44:04,311 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 252 proven. 0 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2024-10-24 11:44:04,313 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:44:04,314 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:44:04,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [110641913] [2024-10-24 11:44:04,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [110641913] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:44:04,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:44:04,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 11:44:04,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035647203] [2024-10-24 11:44:04,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:44:04,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 11:44:04,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:44:04,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 11:44:04,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:44:04,336 INFO L87 Difference]: Start difference. First operand has 93 states, 73 states have (on average 1.4246575342465753) internal successors, (104), 74 states have internal predecessors, (104), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-24 11:44:04,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:44:04,405 INFO L93 Difference]: Finished difference Result 183 states and 291 transitions. [2024-10-24 11:44:04,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 11:44:04,408 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 129 [2024-10-24 11:44:04,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:44:04,414 INFO L225 Difference]: With dead ends: 183 [2024-10-24 11:44:04,414 INFO L226 Difference]: Without dead ends: 91 [2024-10-24 11:44:04,417 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 128 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-10-24 11:44:04,422 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:44:04,422 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 129 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:44:04,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-10-24 11:44:04,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-10-24 11:44:04,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 72 states have (on average 1.375) internal successors, (99), 72 states have internal predecessors, (99), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-24 11:44:04,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 133 transitions. [2024-10-24 11:44:04,464 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 133 transitions. Word has length 129 [2024-10-24 11:44:04,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:44:04,465 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 133 transitions. [2024-10-24 11:44:04,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-24 11:44:04,465 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 133 transitions. [2024-10-24 11:44:04,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-24 11:44:04,469 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:44:04,469 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:44:04,478 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 (2)] Forceful destruction successful, exit code 0 [2024-10-24 11:44:04,670 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-10-24 11:44:04,670 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:44:04,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:44:04,671 INFO L85 PathProgramCache]: Analyzing trace with hash 94664801, now seen corresponding path program 1 times [2024-10-24 11:44:04,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:44:04,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [725066576] [2024-10-24 11:44:04,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:44:04,672 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-10-24 11:44:04,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:44:04,674 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-10-24 11:44:04,675 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-10-24 11:44:04,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:44:04,944 INFO L255 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-24 11:44:04,949 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:44:05,548 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-10-24 11:44:05,580 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-10-24 11:44:05,603 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-10-24 11:44:05,619 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 39 proven. 217 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2024-10-24 11:44:05,620 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:44:05,965 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-10-24 11:44:05,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 25 [2024-10-24 11:44:06,097 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 75 proven. 18 refuted. 0 times theorem prover too weak. 451 trivial. 0 not checked. [2024-10-24 11:44:06,100 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:44:06,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [725066576] [2024-10-24 11:44:06,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [725066576] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 11:44:06,100 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 11:44:06,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 24 [2024-10-24 11:44:06,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004625325] [2024-10-24 11:44:06,101 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 11:44:06,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-24 11:44:06,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:44:06,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-24 11:44:06,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=439, Unknown=0, NotChecked=0, Total=552 [2024-10-24 11:44:06,105 INFO L87 Difference]: Start difference. First operand 91 states and 133 transitions. Second operand has 24 states, 20 states have (on average 4.05) internal successors, (81), 22 states have internal predecessors, (81), 7 states have call successors, (34), 4 states have call predecessors, (34), 7 states have return successors, (34), 5 states have call predecessors, (34), 7 states have call successors, (34) [2024-10-24 11:44:07,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:44:07,464 INFO L93 Difference]: Finished difference Result 293 states and 415 transitions. [2024-10-24 11:44:07,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-10-24 11:44:07,465 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 20 states have (on average 4.05) internal successors, (81), 22 states have internal predecessors, (81), 7 states have call successors, (34), 4 states have call predecessors, (34), 7 states have return successors, (34), 5 states have call predecessors, (34), 7 states have call successors, (34) Word has length 129 [2024-10-24 11:44:07,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:44:07,467 INFO L225 Difference]: With dead ends: 293 [2024-10-24 11:44:07,467 INFO L226 Difference]: Without dead ends: 203 [2024-10-24 11:44:07,468 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 235 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 485 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=559, Invalid=1891, Unknown=0, NotChecked=0, Total=2450 [2024-10-24 11:44:07,469 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 750 mSDsluCounter, 1355 mSDsCounter, 0 mSdLazyCounter, 590 mSolverCounterSat, 303 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 751 SdHoareTripleChecker+Valid, 1496 SdHoareTripleChecker+Invalid, 893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 303 IncrementalHoareTripleChecker+Valid, 590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-24 11:44:07,469 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [751 Valid, 1496 Invalid, 893 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [303 Valid, 590 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-24 11:44:07,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2024-10-24 11:44:07,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 106. [2024-10-24 11:44:07,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 85 states have (on average 1.3529411764705883) internal successors, (115), 85 states have internal predecessors, (115), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-24 11:44:07,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 149 transitions. [2024-10-24 11:44:07,494 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 149 transitions. Word has length 129 [2024-10-24 11:44:07,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:44:07,500 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 149 transitions. [2024-10-24 11:44:07,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 20 states have (on average 4.05) internal successors, (81), 22 states have internal predecessors, (81), 7 states have call successors, (34), 4 states have call predecessors, (34), 7 states have return successors, (34), 5 states have call predecessors, (34), 7 states have call successors, (34) [2024-10-24 11:44:07,500 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 149 transitions. [2024-10-24 11:44:07,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-24 11:44:07,501 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:44:07,501 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:44:07,510 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 (3)] Forceful destruction successful, exit code 0 [2024-10-24 11:44:07,702 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-10-24 11:44:07,702 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:44:07,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:44:07,703 INFO L85 PathProgramCache]: Analyzing trace with hash 517366627, now seen corresponding path program 1 times [2024-10-24 11:44:07,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:44:07,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [589840020] [2024-10-24 11:44:07,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:44:07,704 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-10-24 11:44:07,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:44:07,708 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-10-24 11:44:07,709 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-10-24 11:44:07,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:44:07,929 INFO L255 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-24 11:44:07,935 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:44:08,398 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-10-24 11:44:08,419 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 35 proven. 279 refuted. 0 times theorem prover too weak. 230 trivial. 0 not checked. [2024-10-24 11:44:08,420 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:44:08,689 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-10-24 11:44:08,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 25 [2024-10-24 11:44:08,775 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 63 proven. 30 refuted. 0 times theorem prover too weak. 451 trivial. 0 not checked. [2024-10-24 11:44:08,775 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:44:08,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [589840020] [2024-10-24 11:44:08,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [589840020] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 11:44:08,776 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 11:44:08,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2024-10-24 11:44:08,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499031894] [2024-10-24 11:44:08,776 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 11:44:08,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-24 11:44:08,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:44:08,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-24 11:44:08,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2024-10-24 11:44:08,777 INFO L87 Difference]: Start difference. First operand 106 states and 149 transitions. Second operand has 20 states, 16 states have (on average 4.8125) internal successors, (77), 18 states have internal predecessors, (77), 7 states have call successors, (34), 4 states have call predecessors, (34), 7 states have return successors, (34), 5 states have call predecessors, (34), 7 states have call successors, (34) [2024-10-24 11:44:09,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:44:09,345 INFO L93 Difference]: Finished difference Result 241 states and 335 transitions. [2024-10-24 11:44:09,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-24 11:44:09,346 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 16 states have (on average 4.8125) internal successors, (77), 18 states have internal predecessors, (77), 7 states have call successors, (34), 4 states have call predecessors, (34), 7 states have return successors, (34), 5 states have call predecessors, (34), 7 states have call successors, (34) Word has length 129 [2024-10-24 11:44:09,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:44:09,347 INFO L225 Difference]: With dead ends: 241 [2024-10-24 11:44:09,347 INFO L226 Difference]: Without dead ends: 136 [2024-10-24 11:44:09,348 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 238 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=257, Invalid=613, Unknown=0, NotChecked=0, Total=870 [2024-10-24 11:44:09,349 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 347 mSDsluCounter, 682 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 808 SdHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 11:44:09,349 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 808 Invalid, 551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 464 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 11:44:09,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-10-24 11:44:09,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 133. [2024-10-24 11:44:09,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 100 states have (on average 1.29) internal successors, (129), 101 states have internal predecessors, (129), 27 states have call successors, (27), 5 states have call predecessors, (27), 5 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-24 11:44:09,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 183 transitions. [2024-10-24 11:44:09,361 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 183 transitions. Word has length 129 [2024-10-24 11:44:09,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:44:09,362 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 183 transitions. [2024-10-24 11:44:09,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 16 states have (on average 4.8125) internal successors, (77), 18 states have internal predecessors, (77), 7 states have call successors, (34), 4 states have call predecessors, (34), 7 states have return successors, (34), 5 states have call predecessors, (34), 7 states have call successors, (34) [2024-10-24 11:44:09,362 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 183 transitions. [2024-10-24 11:44:09,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-24 11:44:09,363 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:44:09,363 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:44:09,373 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-10-24 11:44:09,564 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-10-24 11:44:09,564 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:44:09,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:44:09,565 INFO L85 PathProgramCache]: Analyzing trace with hash 1872436698, now seen corresponding path program 1 times [2024-10-24 11:44:09,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:44:09,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [910638939] [2024-10-24 11:44:09,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:44:09,565 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-10-24 11:44:09,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:44:09,568 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-10-24 11:44:09,569 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-10-24 11:44:09,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:44:09,762 INFO L255 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-24 11:44:09,772 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:44:10,182 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-10-24 11:44:10,195 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-10-24 11:44:10,212 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-10-24 11:44:10,222 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 35 proven. 279 refuted. 0 times theorem prover too weak. 230 trivial. 0 not checked. [2024-10-24 11:44:10,222 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:44:10,524 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-10-24 11:44:10,525 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 25 [2024-10-24 11:44:10,609 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 63 proven. 30 refuted. 0 times theorem prover too weak. 451 trivial. 0 not checked. [2024-10-24 11:44:10,609 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:44:10,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [910638939] [2024-10-24 11:44:10,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [910638939] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 11:44:10,609 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 11:44:10,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 24 [2024-10-24 11:44:10,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099628124] [2024-10-24 11:44:10,609 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 11:44:10,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-24 11:44:10,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:44:10,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-24 11:44:10,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=439, Unknown=0, NotChecked=0, Total=552 [2024-10-24 11:44:10,611 INFO L87 Difference]: Start difference. First operand 133 states and 183 transitions. Second operand has 24 states, 20 states have (on average 4.15) internal successors, (83), 22 states have internal predecessors, (83), 7 states have call successors, (34), 4 states have call predecessors, (34), 7 states have return successors, (34), 5 states have call predecessors, (34), 7 states have call successors, (34) [2024-10-24 11:44:11,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:44:11,936 INFO L93 Difference]: Finished difference Result 350 states and 473 transitions. [2024-10-24 11:44:11,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-10-24 11:44:11,936 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 20 states have (on average 4.15) internal successors, (83), 22 states have internal predecessors, (83), 7 states have call successors, (34), 4 states have call predecessors, (34), 7 states have return successors, (34), 5 states have call predecessors, (34), 7 states have call successors, (34) Word has length 129 [2024-10-24 11:44:11,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:44:11,939 INFO L225 Difference]: With dead ends: 350 [2024-10-24 11:44:11,939 INFO L226 Difference]: Without dead ends: 238 [2024-10-24 11:44:11,940 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 236 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 460 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=559, Invalid=1891, Unknown=0, NotChecked=0, Total=2450 [2024-10-24 11:44:11,940 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 599 mSDsluCounter, 1426 mSDsCounter, 0 mSdLazyCounter, 977 mSolverCounterSat, 187 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 600 SdHoareTripleChecker+Valid, 1618 SdHoareTripleChecker+Invalid, 1164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 187 IncrementalHoareTripleChecker+Valid, 977 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-24 11:44:11,941 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [600 Valid, 1618 Invalid, 1164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [187 Valid, 977 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-24 11:44:11,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2024-10-24 11:44:11,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 225. [2024-10-24 11:44:11,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 170 states have (on average 1.2823529411764707) internal successors, (218), 172 states have internal predecessors, (218), 44 states have call successors, (44), 10 states have call predecessors, (44), 10 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2024-10-24 11:44:11,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 306 transitions. [2024-10-24 11:44:11,976 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 306 transitions. Word has length 129 [2024-10-24 11:44:11,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:44:11,976 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 306 transitions. [2024-10-24 11:44:11,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 20 states have (on average 4.15) internal successors, (83), 22 states have internal predecessors, (83), 7 states have call successors, (34), 4 states have call predecessors, (34), 7 states have return successors, (34), 5 states have call predecessors, (34), 7 states have call successors, (34) [2024-10-24 11:44:11,976 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 306 transitions. [2024-10-24 11:44:11,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-24 11:44:11,978 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:44:11,978 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:44:11,985 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-10-24 11:44:12,178 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-10-24 11:44:12,179 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:44:12,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:44:12,179 INFO L85 PathProgramCache]: Analyzing trace with hash 472302903, now seen corresponding path program 1 times [2024-10-24 11:44:12,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:44:12,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1372782247] [2024-10-24 11:44:12,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:44:12,180 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-10-24 11:44:12,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:44:12,182 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-10-24 11:44:12,183 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-10-24 11:44:12,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:44:12,372 INFO L255 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-24 11:44:12,375 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:44:12,734 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-10-24 11:44:12,744 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-10-24 11:44:12,762 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-10-24 11:44:12,773 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 39 proven. 217 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2024-10-24 11:44:12,773 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:44:13,019 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-10-24 11:44:13,020 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 25 [2024-10-24 11:44:13,125 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 75 proven. 18 refuted. 0 times theorem prover too weak. 451 trivial. 0 not checked. [2024-10-24 11:44:13,126 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:44:13,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1372782247] [2024-10-24 11:44:13,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1372782247] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 11:44:13,126 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 11:44:13,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 24 [2024-10-24 11:44:13,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800317494] [2024-10-24 11:44:13,126 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 11:44:13,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-24 11:44:13,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:44:13,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-24 11:44:13,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=439, Unknown=0, NotChecked=0, Total=552 [2024-10-24 11:44:13,128 INFO L87 Difference]: Start difference. First operand 225 states and 306 transitions. Second operand has 24 states, 20 states have (on average 4.25) internal successors, (85), 22 states have internal predecessors, (85), 7 states have call successors, (34), 4 states have call predecessors, (34), 7 states have return successors, (34), 5 states have call predecessors, (34), 7 states have call successors, (34) [2024-10-24 11:44:14,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:44:14,129 INFO L93 Difference]: Finished difference Result 482 states and 640 transitions. [2024-10-24 11:44:14,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-10-24 11:44:14,130 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 20 states have (on average 4.25) internal successors, (85), 22 states have internal predecessors, (85), 7 states have call successors, (34), 4 states have call predecessors, (34), 7 states have return successors, (34), 5 states have call predecessors, (34), 7 states have call successors, (34) Word has length 130 [2024-10-24 11:44:14,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:44:14,132 INFO L225 Difference]: With dead ends: 482 [2024-10-24 11:44:14,132 INFO L226 Difference]: Without dead ends: 278 [2024-10-24 11:44:14,133 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 237 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 485 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=559, Invalid=1891, Unknown=0, NotChecked=0, Total=2450 [2024-10-24 11:44:14,134 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 718 mSDsluCounter, 1161 mSDsCounter, 0 mSdLazyCounter, 551 mSolverCounterSat, 254 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 719 SdHoareTripleChecker+Valid, 1291 SdHoareTripleChecker+Invalid, 805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 254 IncrementalHoareTripleChecker+Valid, 551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 11:44:14,134 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [719 Valid, 1291 Invalid, 805 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [254 Valid, 551 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 11:44:14,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2024-10-24 11:44:14,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 176. [2024-10-24 11:44:14,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 131 states have (on average 1.251908396946565) internal successors, (164), 132 states have internal predecessors, (164), 34 states have call successors, (34), 10 states have call predecessors, (34), 10 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-24 11:44:14,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 232 transitions. [2024-10-24 11:44:14,150 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 232 transitions. Word has length 130 [2024-10-24 11:44:14,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:44:14,150 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 232 transitions. [2024-10-24 11:44:14,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 20 states have (on average 4.25) internal successors, (85), 22 states have internal predecessors, (85), 7 states have call successors, (34), 4 states have call predecessors, (34), 7 states have return successors, (34), 5 states have call predecessors, (34), 7 states have call successors, (34) [2024-10-24 11:44:14,151 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 232 transitions. [2024-10-24 11:44:14,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-24 11:44:14,152 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:44:14,152 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:44:14,159 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-10-24 11:44:14,352 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-10-24 11:44:14,353 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:44:14,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:44:14,353 INFO L85 PathProgramCache]: Analyzing trace with hash -251343138, now seen corresponding path program 1 times [2024-10-24 11:44:14,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:44:14,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [503873146] [2024-10-24 11:44:14,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:44:14,354 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-10-24 11:44:14,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:44:14,355 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-10-24 11:44:14,355 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-10-24 11:44:14,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:44:14,542 INFO L255 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-24 11:44:14,546 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:44:14,942 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-10-24 11:44:14,954 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-10-24 11:44:14,978 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-10-24 11:44:14,990 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 35 proven. 279 refuted. 0 times theorem prover too weak. 230 trivial. 0 not checked. [2024-10-24 11:44:14,990 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:44:15,253 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-10-24 11:44:15,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 25 [2024-10-24 11:44:15,333 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 63 proven. 30 refuted. 0 times theorem prover too weak. 451 trivial. 0 not checked. [2024-10-24 11:44:15,333 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:44:15,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [503873146] [2024-10-24 11:44:15,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [503873146] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 11:44:15,333 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 11:44:15,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 24 [2024-10-24 11:44:15,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042679572] [2024-10-24 11:44:15,333 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 11:44:15,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-24 11:44:15,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:44:15,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-24 11:44:15,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=439, Unknown=0, NotChecked=0, Total=552 [2024-10-24 11:44:15,335 INFO L87 Difference]: Start difference. First operand 176 states and 232 transitions. Second operand has 24 states, 20 states have (on average 4.35) internal successors, (87), 22 states have internal predecessors, (87), 7 states have call successors, (34), 4 states have call predecessors, (34), 7 states have return successors, (34), 5 states have call predecessors, (34), 7 states have call successors, (34) [2024-10-24 11:44:16,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:44:16,470 INFO L93 Difference]: Finished difference Result 394 states and 521 transitions. [2024-10-24 11:44:16,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-10-24 11:44:16,471 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 20 states have (on average 4.35) internal successors, (87), 22 states have internal predecessors, (87), 7 states have call successors, (34), 4 states have call predecessors, (34), 7 states have return successors, (34), 5 states have call predecessors, (34), 7 states have call successors, (34) Word has length 130 [2024-10-24 11:44:16,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:44:16,473 INFO L225 Difference]: With dead ends: 394 [2024-10-24 11:44:16,473 INFO L226 Difference]: Without dead ends: 278 [2024-10-24 11:44:16,474 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 238 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 460 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=559, Invalid=1891, Unknown=0, NotChecked=0, Total=2450 [2024-10-24 11:44:16,474 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 408 mSDsluCounter, 1467 mSDsCounter, 0 mSdLazyCounter, 913 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 1657 SdHoareTripleChecker+Invalid, 1045 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 913 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-24 11:44:16,474 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [409 Valid, 1657 Invalid, 1045 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 913 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-24 11:44:16,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2024-10-24 11:44:16,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 166. [2024-10-24 11:44:16,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 121 states have (on average 1.2231404958677685) internal successors, (148), 122 states have internal predecessors, (148), 34 states have call successors, (34), 10 states have call predecessors, (34), 10 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-24 11:44:16,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 216 transitions. [2024-10-24 11:44:16,490 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 216 transitions. Word has length 130 [2024-10-24 11:44:16,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:44:16,490 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 216 transitions. [2024-10-24 11:44:16,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 20 states have (on average 4.35) internal successors, (87), 22 states have internal predecessors, (87), 7 states have call successors, (34), 4 states have call predecessors, (34), 7 states have return successors, (34), 5 states have call predecessors, (34), 7 states have call successors, (34) [2024-10-24 11:44:16,490 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 216 transitions. [2024-10-24 11:44:16,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-10-24 11:44:16,491 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:44:16,491 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:44:16,499 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-10-24 11:44:16,691 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-10-24 11:44:16,692 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:44:16,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:44:16,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1638600763, now seen corresponding path program 1 times [2024-10-24 11:44:16,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:44:16,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1738291923] [2024-10-24 11:44:16,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:44:16,693 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-10-24 11:44:16,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:44:16,694 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-10-24 11:44:16,695 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-10-24 11:44:16,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:44:16,880 INFO L255 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-24 11:44:16,883 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:44:16,890 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-10-24 11:44:16,903 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 37 treesize of output 25 [2024-10-24 11:44:16,926 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-24 11:44:16,927 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:44:16,927 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:44:16,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1738291923] [2024-10-24 11:44:16,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1738291923] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:44:16,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:44:16,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 11:44:16,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588851342] [2024-10-24 11:44:16,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:44:16,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:44:16,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:44:16,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:44:16,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:44:16,928 INFO L87 Difference]: Start difference. First operand 166 states and 216 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 11:44:17,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:44:17,058 INFO L93 Difference]: Finished difference Result 381 states and 502 transitions. [2024-10-24 11:44:17,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 11:44:17,059 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 132 [2024-10-24 11:44:17,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:44:17,061 INFO L225 Difference]: With dead ends: 381 [2024-10-24 11:44:17,061 INFO L226 Difference]: Without dead ends: 275 [2024-10-24 11:44:17,061 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-24 11:44:17,061 INFO L432 NwaCegarLoop]: 224 mSDtfsCounter, 127 mSDsluCounter, 783 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 1007 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:44:17,062 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 1007 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:44:17,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2024-10-24 11:44:17,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 172. [2024-10-24 11:44:17,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 127 states have (on average 1.220472440944882) internal successors, (155), 128 states have internal predecessors, (155), 34 states have call successors, (34), 10 states have call predecessors, (34), 10 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-24 11:44:17,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 223 transitions. [2024-10-24 11:44:17,076 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 223 transitions. Word has length 132 [2024-10-24 11:44:17,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:44:17,076 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 223 transitions. [2024-10-24 11:44:17,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 11:44:17,077 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 223 transitions. [2024-10-24 11:44:17,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-24 11:44:17,085 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:44:17,085 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:44:17,094 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 (8)] Forceful destruction successful, exit code 0 [2024-10-24 11:44:17,285 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-10-24 11:44:17,286 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:44:17,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:44:17,286 INFO L85 PathProgramCache]: Analyzing trace with hash -2016866472, now seen corresponding path program 1 times [2024-10-24 11:44:17,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:44:17,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1814163279] [2024-10-24 11:44:17,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:44:17,287 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-10-24 11:44:17,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:44:17,288 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-10-24 11:44:17,289 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-10-24 11:44:17,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:44:17,478 INFO L255 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-24 11:44:17,481 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:44:17,845 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-10-24 11:44:17,857 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-10-24 11:44:17,875 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-10-24 11:44:17,887 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 39 proven. 217 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2024-10-24 11:44:17,887 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:44:18,152 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-10-24 11:44:18,153 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 25 [2024-10-24 11:44:18,254 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 75 proven. 18 refuted. 0 times theorem prover too weak. 451 trivial. 0 not checked. [2024-10-24 11:44:18,254 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:44:18,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1814163279] [2024-10-24 11:44:18,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1814163279] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 11:44:18,254 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 11:44:18,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 24 [2024-10-24 11:44:18,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446558541] [2024-10-24 11:44:18,254 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 11:44:18,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-24 11:44:18,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:44:18,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-24 11:44:18,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=439, Unknown=0, NotChecked=0, Total=552 [2024-10-24 11:44:18,256 INFO L87 Difference]: Start difference. First operand 172 states and 223 transitions. Second operand has 24 states, 20 states have (on average 4.35) internal successors, (87), 22 states have internal predecessors, (87), 7 states have call successors, (34), 4 states have call predecessors, (34), 7 states have return successors, (34), 5 states have call predecessors, (34), 7 states have call successors, (34) [2024-10-24 11:44:19,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:44:19,277 INFO L93 Difference]: Finished difference Result 402 states and 525 transitions. [2024-10-24 11:44:19,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-10-24 11:44:19,277 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 20 states have (on average 4.35) internal successors, (87), 22 states have internal predecessors, (87), 7 states have call successors, (34), 4 states have call predecessors, (34), 7 states have return successors, (34), 5 states have call predecessors, (34), 7 states have call successors, (34) Word has length 133 [2024-10-24 11:44:19,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:44:19,279 INFO L225 Difference]: With dead ends: 402 [2024-10-24 11:44:19,279 INFO L226 Difference]: Without dead ends: 290 [2024-10-24 11:44:19,280 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 243 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 485 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=559, Invalid=1891, Unknown=0, NotChecked=0, Total=2450 [2024-10-24 11:44:19,280 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 542 mSDsluCounter, 736 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 191 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 543 SdHoareTripleChecker+Valid, 829 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 191 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 11:44:19,280 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [543 Valid, 829 Invalid, 682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [191 Valid, 491 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 11:44:19,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2024-10-24 11:44:19,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 180. [2024-10-24 11:44:19,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 135 states have (on average 1.237037037037037) internal successors, (167), 136 states have internal predecessors, (167), 34 states have call successors, (34), 10 states have call predecessors, (34), 10 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-24 11:44:19,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 235 transitions. [2024-10-24 11:44:19,295 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 235 transitions. Word has length 133 [2024-10-24 11:44:19,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:44:19,295 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 235 transitions. [2024-10-24 11:44:19,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 20 states have (on average 4.35) internal successors, (87), 22 states have internal predecessors, (87), 7 states have call successors, (34), 4 states have call predecessors, (34), 7 states have return successors, (34), 5 states have call predecessors, (34), 7 states have call successors, (34) [2024-10-24 11:44:19,296 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 235 transitions. [2024-10-24 11:44:19,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-24 11:44:19,297 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:44:19,297 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:44:19,310 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-10-24 11:44:19,497 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-10-24 11:44:19,498 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:44:19,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:44:19,498 INFO L85 PathProgramCache]: Analyzing trace with hash -22721766, now seen corresponding path program 1 times [2024-10-24 11:44:19,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:44:19,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [244046495] [2024-10-24 11:44:19,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:44:19,499 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-10-24 11:44:19,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:44:19,500 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-10-24 11:44:19,502 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-10-24 11:44:19,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:44:19,705 INFO L255 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 11:44:19,707 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:44:19,724 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-24 11:44:19,725 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:44:19,725 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:44:19,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [244046495] [2024-10-24 11:44:19,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [244046495] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:44:19,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:44:19,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:44:19,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418206718] [2024-10-24 11:44:19,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:44:19,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:44:19,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:44:19,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:44:19,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:44:19,727 INFO L87 Difference]: Start difference. First operand 180 states and 235 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 11:44:19,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:44:19,778 INFO L93 Difference]: Finished difference Result 305 states and 402 transitions. [2024-10-24 11:44:19,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:44:19,779 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 133 [2024-10-24 11:44:19,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:44:19,780 INFO L225 Difference]: With dead ends: 305 [2024-10-24 11:44:19,780 INFO L226 Difference]: Without dead ends: 185 [2024-10-24 11:44:19,780 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 129 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-10-24 11:44:19,780 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 1 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:44:19,781 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 474 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:44:19,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2024-10-24 11:44:19,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 184. [2024-10-24 11:44:19,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 139 states have (on average 1.2302158273381294) internal successors, (171), 140 states have internal predecessors, (171), 34 states have call successors, (34), 10 states have call predecessors, (34), 10 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-24 11:44:19,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 239 transitions. [2024-10-24 11:44:19,798 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 239 transitions. Word has length 133 [2024-10-24 11:44:19,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:44:19,798 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 239 transitions. [2024-10-24 11:44:19,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 11:44:19,799 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 239 transitions. [2024-10-24 11:44:19,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-24 11:44:19,799 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:44:19,799 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:44:19,807 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 (10)] Ended with exit code 0 [2024-10-24 11:44:20,000 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-10-24 11:44:20,000 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:44:20,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:44:20,001 INFO L85 PathProgramCache]: Analyzing trace with hash -832068392, now seen corresponding path program 1 times [2024-10-24 11:44:20,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:44:20,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1901565566] [2024-10-24 11:44:20,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:44:20,001 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-10-24 11:44:20,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:44:20,004 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-10-24 11:44:20,004 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-10-24 11:44:20,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:44:20,195 INFO L255 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 11:44:20,197 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:44:20,213 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-24 11:44:20,213 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:44:20,213 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:44:20,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1901565566] [2024-10-24 11:44:20,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1901565566] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:44:20,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:44:20,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 11:44:20,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891495437] [2024-10-24 11:44:20,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:44:20,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:44:20,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:44:20,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:44:20,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:44:20,214 INFO L87 Difference]: Start difference. First operand 184 states and 239 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 11:44:20,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:44:20,267 INFO L93 Difference]: Finished difference Result 311 states and 407 transitions. [2024-10-24 11:44:20,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 11:44:20,267 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 133 [2024-10-24 11:44:20,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:44:20,269 INFO L225 Difference]: With dead ends: 311 [2024-10-24 11:44:20,269 INFO L226 Difference]: Without dead ends: 187 [2024-10-24 11:44:20,269 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:44:20,269 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 1 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:44:20,269 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 583 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:44:20,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2024-10-24 11:44:20,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 186. [2024-10-24 11:44:20,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 141 states have (on average 1.2269503546099292) internal successors, (173), 142 states have internal predecessors, (173), 34 states have call successors, (34), 10 states have call predecessors, (34), 10 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-24 11:44:20,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 241 transitions. [2024-10-24 11:44:20,284 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 241 transitions. Word has length 133 [2024-10-24 11:44:20,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:44:20,284 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 241 transitions. [2024-10-24 11:44:20,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 11:44:20,284 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 241 transitions. [2024-10-24 11:44:20,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-24 11:44:20,285 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:44:20,285 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:44:20,293 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 (11)] Ended with exit code 0 [2024-10-24 11:44:20,485 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-10-24 11:44:20,486 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:44:20,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:44:20,486 INFO L85 PathProgramCache]: Analyzing trace with hash -774810090, now seen corresponding path program 1 times [2024-10-24 11:44:20,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:44:20,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1231462555] [2024-10-24 11:44:20,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:44:20,487 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-10-24 11:44:20,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:44:20,489 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-10-24 11:44:20,489 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-10-24 11:44:20,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:44:20,683 INFO L255 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 11:44:20,685 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:44:20,706 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-24 11:44:20,707 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:44:20,707 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:44:20,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1231462555] [2024-10-24 11:44:20,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1231462555] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:44:20,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:44:20,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 11:44:20,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201941152] [2024-10-24 11:44:20,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:44:20,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 11:44:20,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:44:20,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 11:44:20,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:44:20,708 INFO L87 Difference]: Start difference. First operand 186 states and 241 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 11:44:20,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:44:20,780 INFO L93 Difference]: Finished difference Result 315 states and 411 transitions. [2024-10-24 11:44:20,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 11:44:20,780 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 133 [2024-10-24 11:44:20,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:44:20,785 INFO L225 Difference]: With dead ends: 315 [2024-10-24 11:44:20,785 INFO L226 Difference]: Without dead ends: 189 [2024-10-24 11:44:20,785 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:44:20,786 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 1 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 694 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:44:20,786 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 694 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:44:20,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2024-10-24 11:44:20,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 188. [2024-10-24 11:44:20,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 143 states have (on average 1.2237762237762237) internal successors, (175), 144 states have internal predecessors, (175), 34 states have call successors, (34), 10 states have call predecessors, (34), 10 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-24 11:44:20,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 243 transitions. [2024-10-24 11:44:20,801 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 243 transitions. Word has length 133 [2024-10-24 11:44:20,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:44:20,802 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 243 transitions. [2024-10-24 11:44:20,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 11:44:20,802 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 243 transitions. [2024-10-24 11:44:20,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-24 11:44:20,803 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:44:20,803 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:44:20,810 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 (12)] Forceful destruction successful, exit code 0 [2024-10-24 11:44:21,003 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-10-24 11:44:21,004 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:44:21,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:44:21,004 INFO L85 PathProgramCache]: Analyzing trace with hash -774750508, now seen corresponding path program 1 times [2024-10-24 11:44:21,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:44:21,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [40216650] [2024-10-24 11:44:21,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:44:21,005 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-10-24 11:44:21,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:44:21,006 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-10-24 11:44:21,006 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-10-24 11:44:21,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:44:21,204 INFO L255 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-24 11:44:21,207 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:44:21,569 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 37 treesize of output 25 [2024-10-24 11:44:21,571 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 14 treesize of output 10 [2024-10-24 11:44:21,760 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 24 treesize of output 16 [2024-10-24 11:44:21,763 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 30 treesize of output 18 [2024-10-24 11:44:22,835 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 31 proven. 309 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2024-10-24 11:44:22,835 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:44:23,209 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-24 11:44:23,209 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:44:23,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [40216650] [2024-10-24 11:44:23,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [40216650] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-24 11:44:23,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 11:44:23,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [15] total 19 [2024-10-24 11:44:23,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627438122] [2024-10-24 11:44:23,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:44:23,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:44:23,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:44:23,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:44:23,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2024-10-24 11:44:23,210 INFO L87 Difference]: Start difference. First operand 188 states and 243 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 11:44:23,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:44:23,441 INFO L93 Difference]: Finished difference Result 414 states and 536 transitions. [2024-10-24 11:44:23,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:44:23,442 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 133 [2024-10-24 11:44:23,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:44:23,443 INFO L225 Difference]: With dead ends: 414 [2024-10-24 11:44:23,443 INFO L226 Difference]: Without dead ends: 286 [2024-10-24 11:44:23,444 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 247 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2024-10-24 11:44:23,444 INFO L432 NwaCegarLoop]: 223 mSDtfsCounter, 180 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:44:23,444 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 553 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:44:23,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2024-10-24 11:44:23,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 188. [2024-10-24 11:44:23,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 143 states have (on average 1.2167832167832169) internal successors, (174), 144 states have internal predecessors, (174), 34 states have call successors, (34), 10 states have call predecessors, (34), 10 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-24 11:44:23,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 242 transitions. [2024-10-24 11:44:23,463 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 242 transitions. Word has length 133 [2024-10-24 11:44:23,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:44:23,463 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 242 transitions. [2024-10-24 11:44:23,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 11:44:23,464 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 242 transitions. [2024-10-24 11:44:23,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-10-24 11:44:23,464 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:44:23,464 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:44:23,472 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-10-24 11:44:23,665 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-10-24 11:44:23,665 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:44:23,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:44:23,665 INFO L85 PathProgramCache]: Analyzing trace with hash 164715940, now seen corresponding path program 1 times [2024-10-24 11:44:23,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:44:23,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [497460416] [2024-10-24 11:44:23,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:44:23,666 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-10-24 11:44:23,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:44:23,667 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-10-24 11:44:23,668 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-10-24 11:44:23,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:44:23,878 INFO L255 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-10-24 11:44:23,882 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:44:24,920 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 18 treesize of output 14 [2024-10-24 11:44:25,013 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 28 treesize of output 24 [2024-10-24 11:44:25,099 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 23 treesize of output 15 [2024-10-24 11:44:25,321 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 124 treesize of output 100 [2024-10-24 11:44:25,325 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 93 treesize of output 73 [2024-10-24 11:44:25,332 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 78 treesize of output 62 [2024-10-24 11:44:25,424 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 29 proven. 365 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2024-10-24 11:44:25,424 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:44:25,701 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-24 11:44:25,701 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:44:25,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [497460416] [2024-10-24 11:44:25,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [497460416] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-24 11:44:25,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 11:44:25,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [27] total 32 [2024-10-24 11:44:25,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168355518] [2024-10-24 11:44:25,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:44:25,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 11:44:25,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:44:25,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 11:44:25,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=886, Unknown=0, NotChecked=0, Total=992 [2024-10-24 11:44:25,702 INFO L87 Difference]: Start difference. First operand 188 states and 242 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 11:44:25,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:44:25,910 INFO L93 Difference]: Finished difference Result 391 states and 506 transitions. [2024-10-24 11:44:25,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 11:44:25,911 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 134 [2024-10-24 11:44:25,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:44:25,912 INFO L225 Difference]: With dead ends: 391 [2024-10-24 11:44:25,912 INFO L226 Difference]: Without dead ends: 263 [2024-10-24 11:44:25,913 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 363 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=124, Invalid=1066, Unknown=0, NotChecked=0, Total=1190 [2024-10-24 11:44:25,913 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 181 mSDsluCounter, 624 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 761 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:44:25,914 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 761 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 11:44:25,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2024-10-24 11:44:25,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 260. [2024-10-24 11:44:25,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 208 states have (on average 1.2307692307692308) internal successors, (256), 210 states have internal predecessors, (256), 40 states have call successors, (40), 11 states have call predecessors, (40), 11 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-24 11:44:25,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 336 transitions. [2024-10-24 11:44:25,937 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 336 transitions. Word has length 134 [2024-10-24 11:44:25,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:44:25,937 INFO L471 AbstractCegarLoop]: Abstraction has 260 states and 336 transitions. [2024-10-24 11:44:25,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 11:44:25,938 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 336 transitions. [2024-10-24 11:44:25,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-10-24 11:44:25,938 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:44:25,939 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:44:25,947 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 (14)] Ended with exit code 0 [2024-10-24 11:44:26,139 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-10-24 11:44:26,140 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:44:26,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:44:26,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1548816646, now seen corresponding path program 1 times [2024-10-24 11:44:26,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:44:26,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [756203253] [2024-10-24 11:44:26,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:44:26,141 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-10-24 11:44:26,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:44:26,144 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-10-24 11:44:26,145 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-10-24 11:44:26,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:44:26,363 INFO L255 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-24 11:44:26,366 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:44:26,710 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 37 treesize of output 25 [2024-10-24 11:44:26,712 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 14 treesize of output 10 [2024-10-24 11:44:26,865 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 25 treesize of output 17 [2024-10-24 11:44:26,868 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 31 treesize of output 19 [2024-10-24 11:44:27,940 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 31 proven. 309 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2024-10-24 11:44:27,940 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:44:28,306 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-24 11:44:28,307 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:44:28,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [756203253] [2024-10-24 11:44:28,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [756203253] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-24 11:44:28,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 11:44:28,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [15] total 19 [2024-10-24 11:44:28,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222310170] [2024-10-24 11:44:28,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:44:28,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:44:28,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:44:28,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:44:28,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2024-10-24 11:44:28,308 INFO L87 Difference]: Start difference. First operand 260 states and 336 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 11:44:28,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:44:28,513 INFO L93 Difference]: Finished difference Result 599 states and 777 transitions. [2024-10-24 11:44:28,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:44:28,514 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 134 [2024-10-24 11:44:28,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:44:28,517 INFO L225 Difference]: With dead ends: 599 [2024-10-24 11:44:28,517 INFO L226 Difference]: Without dead ends: 399 [2024-10-24 11:44:28,518 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 249 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2024-10-24 11:44:28,518 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 102 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:44:28,519 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 483 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:44:28,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2024-10-24 11:44:28,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 260. [2024-10-24 11:44:28,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 208 states have (on average 1.2211538461538463) internal successors, (254), 210 states have internal predecessors, (254), 40 states have call successors, (40), 11 states have call predecessors, (40), 11 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-24 11:44:28,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 334 transitions. [2024-10-24 11:44:28,551 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 334 transitions. Word has length 134 [2024-10-24 11:44:28,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:44:28,551 INFO L471 AbstractCegarLoop]: Abstraction has 260 states and 334 transitions. [2024-10-24 11:44:28,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 11:44:28,552 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 334 transitions. [2024-10-24 11:44:28,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-24 11:44:28,552 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:44:28,552 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:44:28,560 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-10-24 11:44:28,753 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-10-24 11:44:28,753 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:44:28,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:44:28,754 INFO L85 PathProgramCache]: Analyzing trace with hash 827705615, now seen corresponding path program 1 times [2024-10-24 11:44:28,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:44:28,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1920281138] [2024-10-24 11:44:28,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:44:28,754 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-10-24 11:44:28,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:44:28,756 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-10-24 11:44:28,756 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-10-24 11:44:28,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:44:28,970 INFO L255 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-24 11:44:28,973 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:44:28,995 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 37 treesize of output 33 [2024-10-24 11:44:29,037 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 114 treesize of output 102 [2024-10-24 11:44:29,040 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 102 treesize of output 90 [2024-10-24 11:44:29,045 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 100 treesize of output 84 [2024-10-24 11:44:29,047 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 78 treesize of output 66 [2024-10-24 11:44:29,081 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-24 11:44:29,081 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:44:29,081 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:44:29,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1920281138] [2024-10-24 11:44:29,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1920281138] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:44:29,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:44:29,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 11:44:29,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724604469] [2024-10-24 11:44:29,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:44:29,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 11:44:29,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:44:29,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 11:44:29,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-24 11:44:29,083 INFO L87 Difference]: Start difference. First operand 260 states and 334 transitions. Second operand has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 11:44:29,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:44:29,356 INFO L93 Difference]: Finished difference Result 511 states and 656 transitions. [2024-10-24 11:44:29,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 11:44:29,357 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 135 [2024-10-24 11:44:29,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:44:29,358 INFO L225 Difference]: With dead ends: 511 [2024-10-24 11:44:29,358 INFO L226 Difference]: Without dead ends: 311 [2024-10-24 11:44:29,360 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-10-24 11:44:29,360 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 94 mSDsluCounter, 939 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 1083 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:44:29,361 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 1083 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 11:44:29,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2024-10-24 11:44:29,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 265. [2024-10-24 11:44:29,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 213 states have (on average 1.2206572769953052) internal successors, (260), 215 states have internal predecessors, (260), 40 states have call successors, (40), 11 states have call predecessors, (40), 11 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-24 11:44:29,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 340 transitions. [2024-10-24 11:44:29,379 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 340 transitions. Word has length 135 [2024-10-24 11:44:29,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:44:29,380 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 340 transitions. [2024-10-24 11:44:29,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 11:44:29,380 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 340 transitions. [2024-10-24 11:44:29,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-24 11:44:29,382 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:44:29,382 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:44:29,390 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 (16)] Forceful destruction successful, exit code 0 [2024-10-24 11:44:29,582 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-10-24 11:44:29,583 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:44:29,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:44:29,583 INFO L85 PathProgramCache]: Analyzing trace with hash -193362739, now seen corresponding path program 1 times [2024-10-24 11:44:29,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:44:29,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1916086937] [2024-10-24 11:44:29,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:44:29,584 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-10-24 11:44:29,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:44:29,587 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-10-24 11:44:29,588 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-10-24 11:44:29,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:44:29,829 INFO L255 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-24 11:44:29,832 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:44:30,194 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-10-24 11:44:30,204 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-10-24 11:44:30,223 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-10-24 11:44:30,234 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 39 proven. 217 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2024-10-24 11:44:30,234 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:44:30,499 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-10-24 11:44:30,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 25 [2024-10-24 11:44:30,580 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 75 proven. 18 refuted. 0 times theorem prover too weak. 451 trivial. 0 not checked. [2024-10-24 11:44:30,580 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:44:30,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1916086937] [2024-10-24 11:44:30,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1916086937] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 11:44:30,581 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 11:44:30,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 24 [2024-10-24 11:44:30,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344804428] [2024-10-24 11:44:30,581 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 11:44:30,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-24 11:44:30,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:44:30,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-24 11:44:30,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=439, Unknown=0, NotChecked=0, Total=552 [2024-10-24 11:44:30,582 INFO L87 Difference]: Start difference. First operand 265 states and 340 transitions. Second operand has 24 states, 20 states have (on average 4.65) internal successors, (93), 22 states have internal predecessors, (93), 7 states have call successors, (34), 4 states have call predecessors, (34), 7 states have return successors, (34), 5 states have call predecessors, (34), 7 states have call successors, (34) [2024-10-24 11:44:31,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:44:31,602 INFO L93 Difference]: Finished difference Result 647 states and 828 transitions. [2024-10-24 11:44:31,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-10-24 11:44:31,602 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 20 states have (on average 4.65) internal successors, (93), 22 states have internal predecessors, (93), 7 states have call successors, (34), 4 states have call predecessors, (34), 7 states have return successors, (34), 5 states have call predecessors, (34), 7 states have call successors, (34) Word has length 135 [2024-10-24 11:44:31,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:44:31,604 INFO L225 Difference]: With dead ends: 647 [2024-10-24 11:44:31,604 INFO L226 Difference]: Without dead ends: 442 [2024-10-24 11:44:31,605 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 247 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 485 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=559, Invalid=1891, Unknown=0, NotChecked=0, Total=2450 [2024-10-24 11:44:31,606 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 850 mSDsluCounter, 741 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 289 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 851 SdHoareTripleChecker+Valid, 835 SdHoareTripleChecker+Invalid, 772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 289 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 11:44:31,606 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [851 Valid, 835 Invalid, 772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [289 Valid, 483 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 11:44:31,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2024-10-24 11:44:31,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 273. [2024-10-24 11:44:31,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 221 states have (on average 1.2126696832579185) internal successors, (268), 223 states have internal predecessors, (268), 40 states have call successors, (40), 11 states have call predecessors, (40), 11 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-24 11:44:31,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 348 transitions. [2024-10-24 11:44:31,626 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 348 transitions. Word has length 135 [2024-10-24 11:44:31,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:44:31,626 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 348 transitions. [2024-10-24 11:44:31,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 20 states have (on average 4.65) internal successors, (93), 22 states have internal predecessors, (93), 7 states have call successors, (34), 4 states have call predecessors, (34), 7 states have return successors, (34), 5 states have call predecessors, (34), 7 states have call successors, (34) [2024-10-24 11:44:31,626 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 348 transitions. [2024-10-24 11:44:31,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-24 11:44:31,627 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:44:31,627 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:44:31,634 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-10-24 11:44:31,831 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-10-24 11:44:31,832 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:44:31,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:44:31,832 INFO L85 PathProgramCache]: Analyzing trace with hash -941276560, now seen corresponding path program 1 times [2024-10-24 11:44:31,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:44:31,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1309967400] [2024-10-24 11:44:31,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:44:31,833 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-10-24 11:44:31,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:44:31,836 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-10-24 11:44:31,836 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-10-24 11:44:32,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:44:32,044 INFO L255 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-24 11:44:32,046 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:44:32,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 25 treesize of output 17 [2024-10-24 11:44:32,086 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 21 treesize of output 13 [2024-10-24 11:44:32,101 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-24 11:44:32,101 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:44:32,101 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:44:32,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1309967400] [2024-10-24 11:44:32,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1309967400] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:44:32,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:44:32,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 11:44:32,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689973495] [2024-10-24 11:44:32,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:44:32,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:44:32,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:44:32,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:44:32,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:44:32,102 INFO L87 Difference]: Start difference. First operand 273 states and 348 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 11:44:34,781 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.25s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-24 11:44:35,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:44:35,043 INFO L93 Difference]: Finished difference Result 488 states and 622 transitions. [2024-10-24 11:44:35,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 11:44:35,044 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 135 [2024-10-24 11:44:35,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:44:35,045 INFO L225 Difference]: With dead ends: 488 [2024-10-24 11:44:35,045 INFO L226 Difference]: Without dead ends: 275 [2024-10-24 11:44:35,045 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-10-24 11:44:35,046 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 176 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-10-24 11:44:35,046 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 521 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 143 Invalid, 1 Unknown, 0 Unchecked, 2.9s Time] [2024-10-24 11:44:35,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2024-10-24 11:44:35,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 273. [2024-10-24 11:44:35,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 221 states have (on average 1.2081447963800904) internal successors, (267), 223 states have internal predecessors, (267), 40 states have call successors, (40), 11 states have call predecessors, (40), 11 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-24 11:44:35,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 347 transitions. [2024-10-24 11:44:35,072 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 347 transitions. Word has length 135 [2024-10-24 11:44:35,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:44:35,073 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 347 transitions. [2024-10-24 11:44:35,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 11:44:35,073 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 347 transitions. [2024-10-24 11:44:35,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-24 11:44:35,074 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:44:35,074 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:44:35,081 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-10-24 11:44:35,274 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-10-24 11:44:35,275 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:44:35,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:44:35,275 INFO L85 PathProgramCache]: Analyzing trace with hash -15573882, now seen corresponding path program 1 times [2024-10-24 11:44:35,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:44:35,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1316663748] [2024-10-24 11:44:35,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:44:35,276 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-10-24 11:44:35,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:44:35,277 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-10-24 11:44:35,278 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-10-24 11:44:35,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:44:35,482 INFO L255 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-24 11:44:35,485 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:44:35,825 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-10-24 11:44:35,835 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-10-24 11:44:35,851 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-10-24 11:44:35,861 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 35 proven. 279 refuted. 0 times theorem prover too weak. 230 trivial. 0 not checked. [2024-10-24 11:44:35,861 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:44:36,103 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-10-24 11:44:36,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 25 [2024-10-24 11:44:36,170 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 63 proven. 30 refuted. 0 times theorem prover too weak. 451 trivial. 0 not checked. [2024-10-24 11:44:36,170 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:44:36,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1316663748] [2024-10-24 11:44:36,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1316663748] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 11:44:36,170 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 11:44:36,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 24 [2024-10-24 11:44:36,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696780722] [2024-10-24 11:44:36,170 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 11:44:36,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-24 11:44:36,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:44:36,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-24 11:44:36,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=439, Unknown=0, NotChecked=0, Total=552 [2024-10-24 11:44:36,171 INFO L87 Difference]: Start difference. First operand 273 states and 347 transitions. Second operand has 24 states, 20 states have (on average 4.55) internal successors, (91), 22 states have internal predecessors, (91), 7 states have call successors, (34), 4 states have call predecessors, (34), 7 states have return successors, (34), 5 states have call predecessors, (34), 7 states have call successors, (34) [2024-10-24 11:44:37,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:44:37,224 INFO L93 Difference]: Finished difference Result 651 states and 826 transitions. [2024-10-24 11:44:37,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-10-24 11:44:37,225 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 20 states have (on average 4.55) internal successors, (91), 22 states have internal predecessors, (91), 7 states have call successors, (34), 4 states have call predecessors, (34), 7 states have return successors, (34), 5 states have call predecessors, (34), 7 states have call successors, (34) Word has length 135 [2024-10-24 11:44:37,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:44:37,227 INFO L225 Difference]: With dead ends: 651 [2024-10-24 11:44:37,227 INFO L226 Difference]: Without dead ends: 438 [2024-10-24 11:44:37,228 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 248 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 460 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=559, Invalid=1891, Unknown=0, NotChecked=0, Total=2450 [2024-10-24 11:44:37,228 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 437 mSDsluCounter, 1167 mSDsCounter, 0 mSdLazyCounter, 723 mSolverCounterSat, 183 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 1323 SdHoareTripleChecker+Invalid, 906 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 183 IncrementalHoareTripleChecker+Valid, 723 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 11:44:37,228 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [438 Valid, 1323 Invalid, 906 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [183 Valid, 723 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 11:44:37,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2024-10-24 11:44:37,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 269. [2024-10-24 11:44:37,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 217 states have (on average 1.1981566820276497) internal successors, (260), 219 states have internal predecessors, (260), 40 states have call successors, (40), 11 states have call predecessors, (40), 11 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-24 11:44:37,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 340 transitions. [2024-10-24 11:44:37,250 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 340 transitions. Word has length 135 [2024-10-24 11:44:37,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:44:37,250 INFO L471 AbstractCegarLoop]: Abstraction has 269 states and 340 transitions. [2024-10-24 11:44:37,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 20 states have (on average 4.55) internal successors, (91), 22 states have internal predecessors, (91), 7 states have call successors, (34), 4 states have call predecessors, (34), 7 states have return successors, (34), 5 states have call predecessors, (34), 7 states have call successors, (34) [2024-10-24 11:44:37,251 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 340 transitions. [2024-10-24 11:44:37,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-24 11:44:37,251 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:44:37,251 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:44:37,258 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-10-24 11:44:37,451 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-10-24 11:44:37,452 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:44:37,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:44:37,452 INFO L85 PathProgramCache]: Analyzing trace with hash -218993786, now seen corresponding path program 1 times [2024-10-24 11:44:37,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:44:37,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1021554486] [2024-10-24 11:44:37,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:44:37,453 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-10-24 11:44:37,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:44:37,454 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-10-24 11:44:37,456 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-10-24 11:44:37,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:44:37,670 INFO L255 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-24 11:44:37,673 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:44:38,045 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-10-24 11:44:38,057 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-10-24 11:44:38,077 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-10-24 11:44:38,087 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 35 proven. 279 refuted. 0 times theorem prover too weak. 230 trivial. 0 not checked. [2024-10-24 11:44:38,087 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:44:38,321 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-10-24 11:44:38,321 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 25 [2024-10-24 11:44:38,412 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 63 proven. 30 refuted. 0 times theorem prover too weak. 451 trivial. 0 not checked. [2024-10-24 11:44:38,412 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:44:38,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1021554486] [2024-10-24 11:44:38,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1021554486] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 11:44:38,412 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 11:44:38,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 24 [2024-10-24 11:44:38,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740160306] [2024-10-24 11:44:38,412 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 11:44:38,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-24 11:44:38,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:44:38,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-24 11:44:38,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=439, Unknown=0, NotChecked=0, Total=552 [2024-10-24 11:44:38,414 INFO L87 Difference]: Start difference. First operand 269 states and 340 transitions. Second operand has 24 states, 20 states have (on average 4.75) internal successors, (95), 22 states have internal predecessors, (95), 7 states have call successors, (34), 4 states have call predecessors, (34), 7 states have return successors, (34), 5 states have call predecessors, (34), 7 states have call successors, (34) [2024-10-24 11:44:39,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:44:39,622 INFO L93 Difference]: Finished difference Result 641 states and 810 transitions. [2024-10-24 11:44:39,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-10-24 11:44:39,622 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 20 states have (on average 4.75) internal successors, (95), 22 states have internal predecessors, (95), 7 states have call successors, (34), 4 states have call predecessors, (34), 7 states have return successors, (34), 5 states have call predecessors, (34), 7 states have call successors, (34) Word has length 135 [2024-10-24 11:44:39,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:44:39,624 INFO L225 Difference]: With dead ends: 641 [2024-10-24 11:44:39,624 INFO L226 Difference]: Without dead ends: 432 [2024-10-24 11:44:39,625 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 248 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 460 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=559, Invalid=1891, Unknown=0, NotChecked=0, Total=2450 [2024-10-24 11:44:39,625 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 385 mSDsluCounter, 1426 mSDsCounter, 0 mSdLazyCounter, 911 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 1612 SdHoareTripleChecker+Invalid, 1039 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 911 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-24 11:44:39,625 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 1612 Invalid, 1039 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 911 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-24 11:44:39,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2024-10-24 11:44:39,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 243. [2024-10-24 11:44:39,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 191 states have (on average 1.1832460732984293) internal successors, (226), 193 states have internal predecessors, (226), 40 states have call successors, (40), 11 states have call predecessors, (40), 11 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-24 11:44:39,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 306 transitions. [2024-10-24 11:44:39,647 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 306 transitions. Word has length 135 [2024-10-24 11:44:39,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:44:39,647 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 306 transitions. [2024-10-24 11:44:39,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 20 states have (on average 4.75) internal successors, (95), 22 states have internal predecessors, (95), 7 states have call successors, (34), 4 states have call predecessors, (34), 7 states have return successors, (34), 5 states have call predecessors, (34), 7 states have call successors, (34) [2024-10-24 11:44:39,648 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 306 transitions. [2024-10-24 11:44:39,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-24 11:44:39,648 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:44:39,648 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:44:39,656 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 (20)] Forceful destruction successful, exit code 0 [2024-10-24 11:44:39,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /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-10-24 11:44:39,849 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:44:39,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:44:39,849 INFO L85 PathProgramCache]: Analyzing trace with hash 730338792, now seen corresponding path program 1 times [2024-10-24 11:44:39,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:44:39,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1655765738] [2024-10-24 11:44:39,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:44:39,850 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-10-24 11:44:39,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:44:39,851 INFO L229 MonitoredProcess]: Starting monitored process 21 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-10-24 11:44:39,852 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 (21)] Waiting until timeout for monitored process [2024-10-24 11:44:40,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:44:40,066 INFO L255 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-24 11:44:40,068 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:44:40,111 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 24 treesize of output 16 [2024-10-24 11:44:40,113 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 20 treesize of output 12 [2024-10-24 11:44:40,133 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-24 11:44:40,133 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:44:40,133 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:44:40,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1655765738] [2024-10-24 11:44:40,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1655765738] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:44:40,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:44:40,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 11:44:40,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951928507] [2024-10-24 11:44:40,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:44:40,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:44:40,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:44:40,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:44:40,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:44:40,134 INFO L87 Difference]: Start difference. First operand 243 states and 306 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 11:44:40,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:44:40,353 INFO L93 Difference]: Finished difference Result 419 states and 526 transitions. [2024-10-24 11:44:40,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 11:44:40,354 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 136 [2024-10-24 11:44:40,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:44:40,355 INFO L225 Difference]: With dead ends: 419 [2024-10-24 11:44:40,355 INFO L226 Difference]: Without dead ends: 236 [2024-10-24 11:44:40,355 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-10-24 11:44:40,356 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 189 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:44:40,356 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 419 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 11:44:40,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2024-10-24 11:44:40,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 234. [2024-10-24 11:44:40,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 182 states have (on average 1.1703296703296704) internal successors, (213), 184 states have internal predecessors, (213), 40 states have call successors, (40), 11 states have call predecessors, (40), 11 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-24 11:44:40,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 293 transitions. [2024-10-24 11:44:40,376 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 293 transitions. Word has length 136 [2024-10-24 11:44:40,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:44:40,377 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 293 transitions. [2024-10-24 11:44:40,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 11:44:40,377 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 293 transitions. [2024-10-24 11:44:40,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-24 11:44:40,377 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:44:40,378 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:44:40,384 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 (21)] Forceful destruction successful, exit code 0 [2024-10-24 11:44:40,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /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-10-24 11:44:40,579 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:44:40,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:44:40,579 INFO L85 PathProgramCache]: Analyzing trace with hash 901676483, now seen corresponding path program 1 times [2024-10-24 11:44:40,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:44:40,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [541890413] [2024-10-24 11:44:40,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:44:40,580 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-10-24 11:44:40,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:44:40,582 INFO L229 MonitoredProcess]: Starting monitored process 22 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-10-24 11:44:40,583 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 (22)] Waiting until timeout for monitored process [2024-10-24 11:44:40,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:44:40,812 INFO L255 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-24 11:44:40,816 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:44:40,828 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 37 treesize of output 33 [2024-10-24 11:44:40,856 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 114 treesize of output 102 [2024-10-24 11:44:40,858 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 102 treesize of output 90 [2024-10-24 11:44:40,860 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 90 treesize of output 78 [2024-10-24 11:44:40,862 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 78 treesize of output 66 [2024-10-24 11:44:40,899 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-24 11:44:40,899 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:44:40,899 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:44:40,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [541890413] [2024-10-24 11:44:40,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [541890413] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:44:40,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:44:40,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 11:44:40,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498020497] [2024-10-24 11:44:40,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:44:40,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 11:44:40,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:44:40,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 11:44:40,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-24 11:44:40,901 INFO L87 Difference]: Start difference. First operand 234 states and 293 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 11:44:41,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:44:41,186 INFO L93 Difference]: Finished difference Result 465 states and 584 transitions. [2024-10-24 11:44:41,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 11:44:41,186 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 136 [2024-10-24 11:44:41,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:44:41,187 INFO L225 Difference]: With dead ends: 465 [2024-10-24 11:44:41,188 INFO L226 Difference]: Without dead ends: 291 [2024-10-24 11:44:41,188 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2024-10-24 11:44:41,188 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 166 mSDsluCounter, 671 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 824 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:44:41,188 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 824 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 11:44:41,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2024-10-24 11:44:41,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 229. [2024-10-24 11:44:41,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 177 states have (on average 1.1694915254237288) internal successors, (207), 179 states have internal predecessors, (207), 40 states have call successors, (40), 11 states have call predecessors, (40), 11 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-24 11:44:41,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 287 transitions. [2024-10-24 11:44:41,213 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 287 transitions. Word has length 136 [2024-10-24 11:44:41,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:44:41,214 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 287 transitions. [2024-10-24 11:44:41,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 11:44:41,214 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 287 transitions. [2024-10-24 11:44:41,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-10-24 11:44:41,215 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:44:41,215 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:44:41,225 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 (22)] Forceful destruction successful, exit code 0 [2024-10-24 11:44:41,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /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-10-24 11:44:41,419 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:44:41,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:44:41,419 INFO L85 PathProgramCache]: Analyzing trace with hash -1271531596, now seen corresponding path program 1 times [2024-10-24 11:44:41,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:44:41,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1943055068] [2024-10-24 11:44:41,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:44:41,419 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-10-24 11:44:41,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:44:41,420 INFO L229 MonitoredProcess]: Starting monitored process 23 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-10-24 11:44:41,422 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 (23)] Waiting until timeout for monitored process [2024-10-24 11:44:41,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:44:41,621 INFO L255 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 11:44:41,622 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:44:41,636 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-24 11:44:41,636 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:44:41,636 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:44:41,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1943055068] [2024-10-24 11:44:41,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1943055068] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:44:41,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:44:41,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 11:44:41,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559120534] [2024-10-24 11:44:41,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:44:41,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:44:41,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:44:41,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:44:41,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:44:41,638 INFO L87 Difference]: Start difference. First operand 229 states and 287 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 11:44:41,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:44:41,703 INFO L93 Difference]: Finished difference Result 402 states and 504 transitions. [2024-10-24 11:44:41,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 11:44:41,703 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 137 [2024-10-24 11:44:41,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:44:41,704 INFO L225 Difference]: With dead ends: 402 [2024-10-24 11:44:41,705 INFO L226 Difference]: Without dead ends: 233 [2024-10-24 11:44:41,705 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:44:41,705 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 0 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:44:41,705 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 593 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:44:41,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2024-10-24 11:44:41,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 233. [2024-10-24 11:44:41,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 181 states have (on average 1.1657458563535912) internal successors, (211), 183 states have internal predecessors, (211), 40 states have call successors, (40), 11 states have call predecessors, (40), 11 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-24 11:44:41,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 291 transitions. [2024-10-24 11:44:41,730 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 291 transitions. Word has length 137 [2024-10-24 11:44:41,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:44:41,730 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 291 transitions. [2024-10-24 11:44:41,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 11:44:41,731 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 291 transitions. [2024-10-24 11:44:41,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-10-24 11:44:41,731 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:44:41,731 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:44:41,738 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 (23)] Forceful destruction successful, exit code 0 [2024-10-24 11:44:41,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /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-10-24 11:44:41,932 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:44:41,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:44:41,932 INFO L85 PathProgramCache]: Analyzing trace with hash 560057651, now seen corresponding path program 1 times [2024-10-24 11:44:41,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:44:41,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1382676135] [2024-10-24 11:44:41,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:44:41,933 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-10-24 11:44:41,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:44:41,935 INFO L229 MonitoredProcess]: Starting monitored process 24 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-10-24 11:44:41,936 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 (24)] Waiting until timeout for monitored process [2024-10-24 11:44:42,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:44:42,162 INFO L255 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-24 11:44:42,165 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:44:42,503 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 18 treesize of output 14 [2024-10-24 11:44:42,649 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-10-24 11:44:42,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30 [2024-10-24 11:44:42,671 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 31 proven. 309 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2024-10-24 11:44:42,671 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:44:42,787 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-24 11:44:42,787 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:44:42,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1382676135] [2024-10-24 11:44:42,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1382676135] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-24 11:44:42,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 11:44:42,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [14] total 17 [2024-10-24 11:44:42,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698087238] [2024-10-24 11:44:42,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:44:42,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:44:42,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:44:42,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:44:42,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2024-10-24 11:44:42,788 INFO L87 Difference]: Start difference. First operand 233 states and 291 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 11:44:42,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:44:42,882 INFO L93 Difference]: Finished difference Result 243 states and 301 transitions. [2024-10-24 11:44:42,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:44:42,883 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 138 [2024-10-24 11:44:42,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:44:42,884 INFO L225 Difference]: With dead ends: 243 [2024-10-24 11:44:42,884 INFO L226 Difference]: Without dead ends: 241 [2024-10-24 11:44:42,884 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 259 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2024-10-24 11:44:42,885 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 65 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:44:42,885 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 471 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:44:42,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2024-10-24 11:44:42,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2024-10-24 11:44:42,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 188 states have (on average 1.1595744680851063) internal successors, (218), 190 states have internal predecessors, (218), 40 states have call successors, (40), 12 states have call predecessors, (40), 12 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-24 11:44:42,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 298 transitions. [2024-10-24 11:44:42,906 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 298 transitions. Word has length 138 [2024-10-24 11:44:42,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:44:42,907 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 298 transitions. [2024-10-24 11:44:42,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 11:44:42,907 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 298 transitions. [2024-10-24 11:44:42,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-10-24 11:44:42,907 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:44:42,908 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:44:42,915 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 (24)] Ended with exit code 0 [2024-10-24 11:44:43,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /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-10-24 11:44:43,108 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:44:43,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:44:43,109 INFO L85 PathProgramCache]: Analyzing trace with hash 560117233, now seen corresponding path program 1 times [2024-10-24 11:44:43,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:44:43,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1403547655] [2024-10-24 11:44:43,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:44:43,109 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-10-24 11:44:43,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:44:43,110 INFO L229 MonitoredProcess]: Starting monitored process 25 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-10-24 11:44:43,111 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 (25)] Waiting until timeout for monitored process [2024-10-24 11:44:43,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:44:43,337 INFO L255 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-24 11:44:43,340 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:44:43,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-24 11:44:43,978 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 125 treesize of output 89 [2024-10-24 11:44:43,980 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 113 treesize of output 65 [2024-10-24 11:44:44,008 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-24 11:44:44,008 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:44:44,132 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-24 11:44:44,132 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:44:44,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1403547655] [2024-10-24 11:44:44,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1403547655] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-24 11:44:44,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 11:44:44,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 12 [2024-10-24 11:44:44,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424303715] [2024-10-24 11:44:44,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:44:44,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:44:44,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:44:44,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:44:44,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-10-24 11:44:44,133 INFO L87 Difference]: Start difference. First operand 241 states and 298 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 11:44:44,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:44:44,281 INFO L93 Difference]: Finished difference Result 591 states and 726 transitions. [2024-10-24 11:44:44,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 11:44:44,281 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 138 [2024-10-24 11:44:44,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:44:44,283 INFO L225 Difference]: With dead ends: 591 [2024-10-24 11:44:44,283 INFO L226 Difference]: Without dead ends: 410 [2024-10-24 11:44:44,283 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2024-10-24 11:44:44,284 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 86 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 715 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:44:44,284 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 715 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:44:44,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2024-10-24 11:44:44,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 407. [2024-10-24 11:44:44,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 325 states have (on average 1.1538461538461537) internal successors, (375), 329 states have internal predecessors, (375), 62 states have call successors, (62), 19 states have call predecessors, (62), 19 states have return successors, (62), 58 states have call predecessors, (62), 62 states have call successors, (62) [2024-10-24 11:44:44,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 499 transitions. [2024-10-24 11:44:44,320 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 499 transitions. Word has length 138 [2024-10-24 11:44:44,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:44:44,320 INFO L471 AbstractCegarLoop]: Abstraction has 407 states and 499 transitions. [2024-10-24 11:44:44,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 11:44:44,321 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 499 transitions. [2024-10-24 11:44:44,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-10-24 11:44:44,321 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:44:44,321 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:44:44,330 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 (25)] Ended with exit code 0 [2024-10-24 11:44:44,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /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-10-24 11:44:44,522 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:44:44,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:44:44,523 INFO L85 PathProgramCache]: Analyzing trace with hash 617375535, now seen corresponding path program 1 times [2024-10-24 11:44:44,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:44:44,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1169125966] [2024-10-24 11:44:44,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:44:44,523 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-10-24 11:44:44,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:44:44,525 INFO L229 MonitoredProcess]: Starting monitored process 26 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-10-24 11:44:44,525 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 (26)] Waiting until timeout for monitored process [2024-10-24 11:44:44,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:44:44,760 INFO L255 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-24 11:44:44,762 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:44:44,769 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-10-24 11:44:44,866 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 61 treesize of output 45 [2024-10-24 11:44:44,868 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 54 treesize of output 34 [2024-10-24 11:44:44,878 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-24 11:44:44,878 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:44:44,878 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:44:44,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1169125966] [2024-10-24 11:44:44,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1169125966] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:44:44,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:44:44,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 11:44:44,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242482372] [2024-10-24 11:44:44,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:44:44,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 11:44:44,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:44:44,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 11:44:44,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:44:44,879 INFO L87 Difference]: Start difference. First operand 407 states and 499 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 11:44:45,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:44:45,139 INFO L93 Difference]: Finished difference Result 846 states and 1016 transitions. [2024-10-24 11:44:45,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 11:44:45,139 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 138 [2024-10-24 11:44:45,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:44:45,141 INFO L225 Difference]: With dead ends: 846 [2024-10-24 11:44:45,141 INFO L226 Difference]: Without dead ends: 499 [2024-10-24 11:44:45,142 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-24 11:44:45,142 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 171 mSDsluCounter, 632 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 792 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:44:45,142 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 792 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 11:44:45,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2024-10-24 11:44:45,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 398. [2024-10-24 11:44:45,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 318 states have (on average 1.1352201257861636) internal successors, (361), 322 states have internal predecessors, (361), 60 states have call successors, (60), 19 states have call predecessors, (60), 19 states have return successors, (60), 56 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-24 11:44:45,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 481 transitions. [2024-10-24 11:44:45,187 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 481 transitions. Word has length 138 [2024-10-24 11:44:45,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:44:45,187 INFO L471 AbstractCegarLoop]: Abstraction has 398 states and 481 transitions. [2024-10-24 11:44:45,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 11:44:45,187 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 481 transitions. [2024-10-24 11:44:45,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-10-24 11:44:45,188 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:44:45,188 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:44:45,196 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 (26)] Ended with exit code 0 [2024-10-24 11:44:45,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /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-10-24 11:44:45,389 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:44:45,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:44:45,389 INFO L85 PathProgramCache]: Analyzing trace with hash -191971091, now seen corresponding path program 1 times [2024-10-24 11:44:45,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:44:45,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [567654709] [2024-10-24 11:44:45,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:44:45,390 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-10-24 11:44:45,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:44:45,391 INFO L229 MonitoredProcess]: Starting monitored process 27 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-10-24 11:44:45,392 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 (27)] Waiting until timeout for monitored process [2024-10-24 11:44:45,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:44:45,608 INFO L255 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-24 11:44:45,611 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:44:45,943 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-10-24 11:44:46,026 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-10-24 11:44:46,048 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-10-24 11:44:46,098 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 39 proven. 217 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2024-10-24 11:44:46,099 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:44:46,355 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-24 11:44:46,356 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:44:46,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [567654709] [2024-10-24 11:44:46,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [567654709] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-24 11:44:46,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 11:44:46,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [18] total 24 [2024-10-24 11:44:46,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758067562] [2024-10-24 11:44:46,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:44:46,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 11:44:46,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:44:46,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 11:44:46,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=487, Unknown=0, NotChecked=0, Total=552 [2024-10-24 11:44:46,357 INFO L87 Difference]: Start difference. First operand 398 states and 481 transitions. Second operand has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 11:44:46,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:44:46,671 INFO L93 Difference]: Finished difference Result 786 states and 943 transitions. [2024-10-24 11:44:46,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 11:44:46,672 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 138 [2024-10-24 11:44:46,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:44:46,674 INFO L225 Difference]: With dead ends: 786 [2024-10-24 11:44:46,674 INFO L226 Difference]: Without dead ends: 415 [2024-10-24 11:44:46,675 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=725, Unknown=0, NotChecked=0, Total=812 [2024-10-24 11:44:46,675 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 86 mSDsluCounter, 697 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 805 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:44:46,675 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 805 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 11:44:46,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2024-10-24 11:44:46,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 406. [2024-10-24 11:44:46,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 326 states have (on average 1.1319018404907975) internal successors, (369), 330 states have internal predecessors, (369), 60 states have call successors, (60), 19 states have call predecessors, (60), 19 states have return successors, (60), 56 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-24 11:44:46,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 489 transitions. [2024-10-24 11:44:46,722 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 489 transitions. Word has length 138 [2024-10-24 11:44:46,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:44:46,723 INFO L471 AbstractCegarLoop]: Abstraction has 406 states and 489 transitions. [2024-10-24 11:44:46,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 11:44:46,723 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 489 transitions. [2024-10-24 11:44:46,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-10-24 11:44:46,724 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:44:46,724 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:44:46,734 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 (27)] Ended with exit code 0 [2024-10-24 11:44:46,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /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-10-24 11:44:46,924 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:44:46,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:44:46,925 INFO L85 PathProgramCache]: Analyzing trace with hash 66194347, now seen corresponding path program 1 times [2024-10-24 11:44:46,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:44:46,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1110147062] [2024-10-24 11:44:46,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:44:46,925 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-10-24 11:44:46,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:44:46,928 INFO L229 MonitoredProcess]: Starting monitored process 28 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-10-24 11:44:46,928 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 (28)] Waiting until timeout for monitored process [2024-10-24 11:44:47,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:44:47,154 INFO L255 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-24 11:44:47,157 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:44:47,527 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-10-24 11:44:47,536 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 35 proven. 279 refuted. 0 times theorem prover too weak. 230 trivial. 0 not checked. [2024-10-24 11:44:47,536 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:44:47,756 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-10-24 11:44:47,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 25 [2024-10-24 11:44:47,822 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 63 proven. 30 refuted. 0 times theorem prover too weak. 451 trivial. 0 not checked. [2024-10-24 11:44:47,822 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:44:47,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1110147062] [2024-10-24 11:44:47,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1110147062] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 11:44:47,822 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 11:44:47,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2024-10-24 11:44:47,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935758858] [2024-10-24 11:44:47,822 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 11:44:47,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-24 11:44:47,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:44:47,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-24 11:44:47,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2024-10-24 11:44:47,823 INFO L87 Difference]: Start difference. First operand 406 states and 489 transitions. Second operand has 20 states, 16 states have (on average 6.5) internal successors, (104), 18 states have internal predecessors, (104), 7 states have call successors, (34), 4 states have call predecessors, (34), 7 states have return successors, (34), 5 states have call predecessors, (34), 7 states have call successors, (34) [2024-10-24 11:44:48,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:44:48,347 INFO L93 Difference]: Finished difference Result 787 states and 943 transitions. [2024-10-24 11:44:48,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-24 11:44:48,348 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 16 states have (on average 6.5) internal successors, (104), 18 states have internal predecessors, (104), 7 states have call successors, (34), 4 states have call predecessors, (34), 7 states have return successors, (34), 5 states have call predecessors, (34), 7 states have call successors, (34) Word has length 138 [2024-10-24 11:44:48,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:44:48,350 INFO L225 Difference]: With dead ends: 787 [2024-10-24 11:44:48,350 INFO L226 Difference]: Without dead ends: 408 [2024-10-24 11:44:48,350 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 256 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=257, Invalid=613, Unknown=0, NotChecked=0, Total=870 [2024-10-24 11:44:48,351 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 210 mSDsluCounter, 650 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 770 SdHoareTripleChecker+Invalid, 545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 11:44:48,351 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 770 Invalid, 545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 470 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 11:44:48,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2024-10-24 11:44:48,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 404. [2024-10-24 11:44:48,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 324 states have (on average 1.1203703703703705) internal successors, (363), 328 states have internal predecessors, (363), 60 states have call successors, (60), 19 states have call predecessors, (60), 19 states have return successors, (60), 56 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-24 11:44:48,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 483 transitions. [2024-10-24 11:44:48,404 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 483 transitions. Word has length 138 [2024-10-24 11:44:48,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:44:48,405 INFO L471 AbstractCegarLoop]: Abstraction has 404 states and 483 transitions. [2024-10-24 11:44:48,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 16 states have (on average 6.5) internal successors, (104), 18 states have internal predecessors, (104), 7 states have call successors, (34), 4 states have call predecessors, (34), 7 states have return successors, (34), 5 states have call predecessors, (34), 7 states have call successors, (34) [2024-10-24 11:44:48,405 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 483 transitions. [2024-10-24 11:44:48,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-10-24 11:44:48,406 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:44:48,406 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:44:48,413 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 (28)] Ended with exit code 0 [2024-10-24 11:44:48,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /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-10-24 11:44:48,606 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:44:48,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:44:48,607 INFO L85 PathProgramCache]: Analyzing trace with hash -663546730, now seen corresponding path program 1 times [2024-10-24 11:44:48,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:44:48,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [892504785] [2024-10-24 11:44:48,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:44:48,607 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-10-24 11:44:48,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:44:48,608 INFO L229 MonitoredProcess]: Starting monitored process 29 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-10-24 11:44:48,609 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 (29)] Waiting until timeout for monitored process [2024-10-24 11:44:48,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:44:48,830 INFO L255 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-24 11:44:48,832 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:44:49,150 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-10-24 11:44:49,160 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-10-24 11:44:49,186 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-10-24 11:44:49,254 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 39 proven. 217 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2024-10-24 11:44:49,254 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:44:49,583 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-10-24 11:44:49,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 25 [2024-10-24 11:44:49,666 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 75 proven. 18 refuted. 0 times theorem prover too weak. 451 trivial. 0 not checked. [2024-10-24 11:44:49,666 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:44:49,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [892504785] [2024-10-24 11:44:49,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [892504785] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 11:44:49,666 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 11:44:49,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 29 [2024-10-24 11:44:49,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233288962] [2024-10-24 11:44:49,666 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 11:44:49,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-10-24 11:44:49,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:44:49,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-10-24 11:44:49,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=687, Unknown=0, NotChecked=0, Total=812 [2024-10-24 11:44:49,668 INFO L87 Difference]: Start difference. First operand 404 states and 483 transitions. Second operand has 29 states, 25 states have (on average 4.2) internal successors, (105), 27 states have internal predecessors, (105), 7 states have call successors, (34), 4 states have call predecessors, (34), 7 states have return successors, (34), 5 states have call predecessors, (34), 7 states have call successors, (34) [2024-10-24 11:44:50,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:44:50,850 INFO L93 Difference]: Finished difference Result 836 states and 992 transitions. [2024-10-24 11:44:50,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-10-24 11:44:50,850 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 25 states have (on average 4.2) internal successors, (105), 27 states have internal predecessors, (105), 7 states have call successors, (34), 4 states have call predecessors, (34), 7 states have return successors, (34), 5 states have call predecessors, (34), 7 states have call successors, (34) Word has length 138 [2024-10-24 11:44:50,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:44:50,852 INFO L225 Difference]: With dead ends: 836 [2024-10-24 11:44:50,852 INFO L226 Difference]: Without dead ends: 459 [2024-10-24 11:44:50,853 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 247 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 689 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=654, Invalid=2768, Unknown=0, NotChecked=0, Total=3422 [2024-10-24 11:44:50,853 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 505 mSDsluCounter, 1047 mSDsCounter, 0 mSdLazyCounter, 699 mSolverCounterSat, 191 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 506 SdHoareTripleChecker+Valid, 1136 SdHoareTripleChecker+Invalid, 890 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 191 IncrementalHoareTripleChecker+Valid, 699 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 11:44:50,854 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [506 Valid, 1136 Invalid, 890 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [191 Valid, 699 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 11:44:50,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2024-10-24 11:44:50,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 406. [2024-10-24 11:44:50,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 326 states have (on average 1.1196319018404908) internal successors, (365), 330 states have internal predecessors, (365), 60 states have call successors, (60), 19 states have call predecessors, (60), 19 states have return successors, (60), 56 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-24 11:44:50,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 485 transitions. [2024-10-24 11:44:50,901 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 485 transitions. Word has length 138 [2024-10-24 11:44:50,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:44:50,901 INFO L471 AbstractCegarLoop]: Abstraction has 406 states and 485 transitions. [2024-10-24 11:44:50,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 25 states have (on average 4.2) internal successors, (105), 27 states have internal predecessors, (105), 7 states have call successors, (34), 4 states have call predecessors, (34), 7 states have return successors, (34), 5 states have call predecessors, (34), 7 states have call successors, (34) [2024-10-24 11:44:50,901 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 485 transitions. [2024-10-24 11:44:50,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-10-24 11:44:50,902 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:44:50,902 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:44:50,909 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 (29)] Ended with exit code 0 [2024-10-24 11:44:51,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /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-10-24 11:44:51,103 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:44:51,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:44:51,103 INFO L85 PathProgramCache]: Analyzing trace with hash -405381292, now seen corresponding path program 1 times [2024-10-24 11:44:51,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:44:51,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [230659422] [2024-10-24 11:44:51,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:44:51,104 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-10-24 11:44:51,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:44:51,107 INFO L229 MonitoredProcess]: Starting monitored process 30 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-10-24 11:44:51,108 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 (30)] Waiting until timeout for monitored process [2024-10-24 11:44:51,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:44:51,339 INFO L255 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-10-24 11:44:51,342 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:44:52,333 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-10-24 11:44:52,359 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-10-24 11:44:52,450 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-10-24 11:44:52,482 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-10-24 11:44:52,567 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 37 proven. 305 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2024-10-24 11:44:52,567 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:44:53,457 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:44:53,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 53 [2024-10-24 11:44:53,934 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:44:53,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 36 [2024-10-24 11:44:54,124 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 126 proven. 48 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2024-10-24 11:44:54,125 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:44:54,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [230659422] [2024-10-24 11:44:54,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [230659422] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 11:44:54,125 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 11:44:54,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 26] total 48 [2024-10-24 11:44:54,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188345005] [2024-10-24 11:44:54,125 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 11:44:54,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2024-10-24 11:44:54,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:44:54,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2024-10-24 11:44:54,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=295, Invalid=1961, Unknown=0, NotChecked=0, Total=2256 [2024-10-24 11:44:54,127 INFO L87 Difference]: Start difference. First operand 406 states and 485 transitions. Second operand has 48 states, 40 states have (on average 2.975) internal successors, (119), 41 states have internal predecessors, (119), 11 states have call successors, (34), 6 states have call predecessors, (34), 11 states have return successors, (34), 9 states have call predecessors, (34), 11 states have call successors, (34) [2024-10-24 11:44:56,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:44:56,716 INFO L93 Difference]: Finished difference Result 791 states and 937 transitions. [2024-10-24 11:44:56,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-10-24 11:44:56,717 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 40 states have (on average 2.975) internal successors, (119), 41 states have internal predecessors, (119), 11 states have call successors, (34), 6 states have call predecessors, (34), 11 states have return successors, (34), 9 states have call predecessors, (34), 11 states have call successors, (34) Word has length 138 [2024-10-24 11:44:56,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:44:56,719 INFO L225 Difference]: With dead ends: 791 [2024-10-24 11:44:56,719 INFO L226 Difference]: Without dead ends: 412 [2024-10-24 11:44:56,720 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 229 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1149 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1042, Invalid=4658, Unknown=0, NotChecked=0, Total=5700 [2024-10-24 11:44:56,724 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 1191 mSDsluCounter, 1781 mSDsCounter, 0 mSdLazyCounter, 1629 mSolverCounterSat, 387 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1192 SdHoareTripleChecker+Valid, 1899 SdHoareTripleChecker+Invalid, 2016 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 387 IncrementalHoareTripleChecker+Valid, 1629 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-24 11:44:56,724 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1192 Valid, 1899 Invalid, 2016 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [387 Valid, 1629 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-24 11:44:56,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2024-10-24 11:44:56,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 392. [2024-10-24 11:44:56,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 312 states have (on average 1.1153846153846154) internal successors, (348), 316 states have internal predecessors, (348), 60 states have call successors, (60), 19 states have call predecessors, (60), 19 states have return successors, (60), 56 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-24 11:44:56,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 468 transitions. [2024-10-24 11:44:56,771 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 468 transitions. Word has length 138 [2024-10-24 11:44:56,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:44:56,771 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 468 transitions. [2024-10-24 11:44:56,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 40 states have (on average 2.975) internal successors, (119), 41 states have internal predecessors, (119), 11 states have call successors, (34), 6 states have call predecessors, (34), 11 states have return successors, (34), 9 states have call predecessors, (34), 11 states have call successors, (34) [2024-10-24 11:44:56,771 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 468 transitions. [2024-10-24 11:44:56,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-10-24 11:44:56,772 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:44:56,772 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:44:56,780 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 (30)] Forceful destruction successful, exit code 0 [2024-10-24 11:44:56,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /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-10-24 11:44:56,973 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:44:56,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:44:56,973 INFO L85 PathProgramCache]: Analyzing trace with hash 1489774744, now seen corresponding path program 1 times [2024-10-24 11:44:56,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:44:56,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [601947217] [2024-10-24 11:44:56,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:44:56,974 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-10-24 11:44:56,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:44:56,976 INFO L229 MonitoredProcess]: Starting monitored process 31 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-10-24 11:44:56,977 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 (31)] Waiting until timeout for monitored process [2024-10-24 11:44:57,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:44:57,224 INFO L255 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 11:44:57,226 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:44:57,274 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 46 treesize of output 22 [2024-10-24 11:44:57,290 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-24 11:44:57,290 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:44:57,290 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:44:57,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [601947217] [2024-10-24 11:44:57,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [601947217] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:44:57,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:44:57,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:44:57,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557463836] [2024-10-24 11:44:57,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:44:57,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:44:57,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:44:57,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:44:57,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:44:57,292 INFO L87 Difference]: Start difference. First operand 392 states and 468 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 11:44:57,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:44:57,632 INFO L93 Difference]: Finished difference Result 789 states and 935 transitions. [2024-10-24 11:44:57,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:44:57,633 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 138 [2024-10-24 11:44:57,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:44:57,635 INFO L225 Difference]: With dead ends: 789 [2024-10-24 11:44:57,635 INFO L226 Difference]: Without dead ends: 424 [2024-10-24 11:44:57,636 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:44:57,636 INFO L432 NwaCegarLoop]: 220 mSDtfsCounter, 101 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 687 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 11:44:57,636 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 687 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 11:44:57,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2024-10-24 11:44:57,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 388. [2024-10-24 11:44:57,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 308 states have (on average 1.1103896103896105) internal successors, (342), 312 states have internal predecessors, (342), 60 states have call successors, (60), 19 states have call predecessors, (60), 19 states have return successors, (60), 56 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-24 11:44:57,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 462 transitions. [2024-10-24 11:44:57,685 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 462 transitions. Word has length 138 [2024-10-24 11:44:57,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:44:57,685 INFO L471 AbstractCegarLoop]: Abstraction has 388 states and 462 transitions. [2024-10-24 11:44:57,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 11:44:57,685 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 462 transitions. [2024-10-24 11:44:57,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-10-24 11:44:57,686 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:44:57,686 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:44:57,693 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 (31)] Forceful destruction successful, exit code 0 [2024-10-24 11:44:57,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /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-10-24 11:44:57,887 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:44:57,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:44:57,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1018199105, now seen corresponding path program 1 times [2024-10-24 11:44:57,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:44:57,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [137586329] [2024-10-24 11:44:57,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:44:57,888 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-10-24 11:44:57,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:44:57,889 INFO L229 MonitoredProcess]: Starting monitored process 32 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-10-24 11:44:57,889 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 (32)] Waiting until timeout for monitored process [2024-10-24 11:44:58,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:44:58,132 INFO L255 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-24 11:44:58,135 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:44:58,667 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 88 treesize of output 52 [2024-10-24 11:44:58,712 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-24 11:44:58,712 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:44:58,782 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:44:58,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [137586329] [2024-10-24 11:44:58,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [137586329] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 11:44:58,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1646067079] [2024-10-24 11:44:58,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:44:58,782 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-24 11:44:58,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-24 11:44:58,783 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-24 11:44:58,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (33)] Waiting until timeout for monitored process [2024-10-24 11:44:59,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:44:59,312 INFO L255 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-24 11:44:59,314 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:44:59,401 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-24 11:44:59,401 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:44:59,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1646067079] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:44:59,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 11:44:59,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 11 [2024-10-24 11:44:59,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736000366] [2024-10-24 11:44:59,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:44:59,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:44:59,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:44:59,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:44:59,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2024-10-24 11:44:59,403 INFO L87 Difference]: Start difference. First operand 388 states and 462 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 11:44:59,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:44:59,616 INFO L93 Difference]: Finished difference Result 934 states and 1106 transitions. [2024-10-24 11:44:59,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:44:59,617 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 138 [2024-10-24 11:44:59,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:44:59,619 INFO L225 Difference]: With dead ends: 934 [2024-10-24 11:44:59,619 INFO L226 Difference]: Without dead ends: 573 [2024-10-24 11:44:59,620 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 296 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2024-10-24 11:44:59,620 INFO L432 NwaCegarLoop]: 222 mSDtfsCounter, 99 mSDsluCounter, 511 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 733 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:44:59,620 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 733 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:44:59,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2024-10-24 11:44:59,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 443. [2024-10-24 11:44:59,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 363 states have (on average 1.115702479338843) internal successors, (405), 367 states have internal predecessors, (405), 60 states have call successors, (60), 19 states have call predecessors, (60), 19 states have return successors, (60), 56 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-24 11:44:59,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 525 transitions. [2024-10-24 11:44:59,685 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 525 transitions. Word has length 138 [2024-10-24 11:44:59,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:44:59,687 INFO L471 AbstractCegarLoop]: Abstraction has 443 states and 525 transitions. [2024-10-24 11:44:59,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 11:44:59,687 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 525 transitions. [2024-10-24 11:44:59,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-10-24 11:44:59,688 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:44:59,688 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:44:59,697 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (33)] Forceful destruction successful, exit code 0 [2024-10-24 11:44:59,896 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 (32)] Forceful destruction successful, exit code 0 [2024-10-24 11:45:00,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,32 /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-10-24 11:45:00,089 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:45:00,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:45:00,090 INFO L85 PathProgramCache]: Analyzing trace with hash 1276364543, now seen corresponding path program 1 times [2024-10-24 11:45:00,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:45:00,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2050294916] [2024-10-24 11:45:00,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:45:00,090 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-10-24 11:45:00,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:45:00,091 INFO L229 MonitoredProcess]: Starting monitored process 34 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-10-24 11:45:00,092 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 (34)] Waiting until timeout for monitored process [2024-10-24 11:45:00,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:00,340 INFO L255 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-24 11:45:00,342 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:45:00,885 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 88 treesize of output 52 [2024-10-24 11:45:00,923 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-24 11:45:00,923 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:45:00,989 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:45:00,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2050294916] [2024-10-24 11:45:00,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2050294916] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 11:45:00,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2066416804] [2024-10-24 11:45:00,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:45:00,989 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-24 11:45:00,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-24 11:45:00,991 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-24 11:45:00,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (35)] Waiting until timeout for monitored process [2024-10-24 11:45:01,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:01,577 INFO L255 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-24 11:45:01,580 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:45:02,319 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-24 11:45:02,582 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 88 treesize of output 52 [2024-10-24 11:45:02,595 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-24 11:45:02,649 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-24 11:45:02,650 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:45:02,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2066416804] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 11:45:02,699 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 11:45:02,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2024-10-24 11:45:02,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630546158] [2024-10-24 11:45:02,700 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 11:45:02,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-24 11:45:02,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:45:02,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-24 11:45:02,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2024-10-24 11:45:02,701 INFO L87 Difference]: Start difference. First operand 443 states and 525 transitions. Second operand has 14 states, 14 states have (on average 6.285714285714286) internal successors, (88), 13 states have internal predecessors, (88), 4 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 4 states have call predecessors, (34), 4 states have call successors, (34) [2024-10-24 11:45:03,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:45:03,589 INFO L93 Difference]: Finished difference Result 1045 states and 1228 transitions. [2024-10-24 11:45:03,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 11:45:03,590 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.285714285714286) internal successors, (88), 13 states have internal predecessors, (88), 4 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 4 states have call predecessors, (34), 4 states have call successors, (34) Word has length 138 [2024-10-24 11:45:03,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:45:03,593 INFO L225 Difference]: With dead ends: 1045 [2024-10-24 11:45:03,593 INFO L226 Difference]: Without dead ends: 629 [2024-10-24 11:45:03,593 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 325 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2024-10-24 11:45:03,594 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 344 mSDsluCounter, 715 mSDsCounter, 0 mSdLazyCounter, 626 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 874 SdHoareTripleChecker+Invalid, 665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 11:45:03,594 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 874 Invalid, 665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 626 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 11:45:03,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2024-10-24 11:45:03,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 452. [2024-10-24 11:45:03,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 370 states have (on average 1.1162162162162161) internal successors, (413), 374 states have internal predecessors, (413), 61 states have call successors, (61), 20 states have call predecessors, (61), 20 states have return successors, (61), 57 states have call predecessors, (61), 61 states have call successors, (61) [2024-10-24 11:45:03,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 535 transitions. [2024-10-24 11:45:03,658 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 535 transitions. Word has length 138 [2024-10-24 11:45:03,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:45:03,658 INFO L471 AbstractCegarLoop]: Abstraction has 452 states and 535 transitions. [2024-10-24 11:45:03,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.285714285714286) internal successors, (88), 13 states have internal predecessors, (88), 4 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 4 states have call predecessors, (34), 4 states have call successors, (34) [2024-10-24 11:45:03,659 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 535 transitions. [2024-10-24 11:45:03,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-10-24 11:45:03,659 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:45:03,660 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:45:03,667 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 (34)] Ended with exit code 0 [2024-10-24 11:45:03,867 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (35)] Forceful destruction successful, exit code 0 [2024-10-24 11:45:04,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /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,35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-10-24 11:45:04,060 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:45:04,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:45:04,061 INFO L85 PathProgramCache]: Analyzing trace with hash -95442755, now seen corresponding path program 1 times [2024-10-24 11:45:04,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:45:04,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [521271239] [2024-10-24 11:45:04,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:45:04,061 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-10-24 11:45:04,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:45:04,062 INFO L229 MonitoredProcess]: Starting monitored process 36 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-10-24 11:45:04,064 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 (36)] Waiting until timeout for monitored process [2024-10-24 11:45:04,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:04,301 INFO L255 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 11:45:04,302 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:45:04,310 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-24 11:45:04,310 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:45:04,310 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:45:04,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [521271239] [2024-10-24 11:45:04,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [521271239] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:45:04,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:45:04,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:45:04,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862978878] [2024-10-24 11:45:04,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:45:04,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:45:04,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:45:04,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:45:04,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:45:04,312 INFO L87 Difference]: Start difference. First operand 452 states and 535 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-24 11:45:04,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:45:04,408 INFO L93 Difference]: Finished difference Result 877 states and 1033 transitions. [2024-10-24 11:45:04,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:45:04,409 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), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 138 [2024-10-24 11:45:04,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:45:04,410 INFO L225 Difference]: With dead ends: 877 [2024-10-24 11:45:04,410 INFO L226 Difference]: Without dead ends: 452 [2024-10-24 11:45:04,411 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 135 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-10-24 11:45:04,411 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 0 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:45:04,411 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 358 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:45:04,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2024-10-24 11:45:04,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 452. [2024-10-24 11:45:04,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 370 states have (on average 1.1135135135135135) internal successors, (412), 374 states have internal predecessors, (412), 61 states have call successors, (61), 20 states have call predecessors, (61), 20 states have return successors, (61), 57 states have call predecessors, (61), 61 states have call successors, (61) [2024-10-24 11:45:04,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 534 transitions. [2024-10-24 11:45:04,470 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 534 transitions. Word has length 138 [2024-10-24 11:45:04,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:45:04,470 INFO L471 AbstractCegarLoop]: Abstraction has 452 states and 534 transitions. [2024-10-24 11:45:04,470 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), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-24 11:45:04,470 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 534 transitions. [2024-10-24 11:45:04,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-10-24 11:45:04,471 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:45:04,471 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:45:04,479 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 (36)] Ended with exit code 0 [2024-10-24 11:45:04,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /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-10-24 11:45:04,672 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:45:04,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:45:04,673 INFO L85 PathProgramCache]: Analyzing trace with hash -1698699943, now seen corresponding path program 1 times [2024-10-24 11:45:04,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:45:04,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [261910232] [2024-10-24 11:45:04,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:45:04,673 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-10-24 11:45:04,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:45:04,674 INFO L229 MonitoredProcess]: Starting monitored process 37 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-10-24 11:45:04,675 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 (37)] Waiting until timeout for monitored process [2024-10-24 11:45:04,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:04,921 INFO L255 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-24 11:45:04,923 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:45:05,366 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 28 treesize of output 20 [2024-10-24 11:45:05,369 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 14 treesize of output 10 [2024-10-24 11:45:05,426 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 19 treesize of output 11 [2024-10-24 11:45:05,429 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-10-24 11:45:05,444 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 7 proven. 309 refuted. 0 times theorem prover too weak. 228 trivial. 0 not checked. [2024-10-24 11:45:05,444 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:45:05,618 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:45:05,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 32 [2024-10-24 11:45:05,706 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:45:05,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [261910232] [2024-10-24 11:45:05,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [261910232] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 11:45:05,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [308813439] [2024-10-24 11:45:05,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:45:05,707 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-24 11:45:05,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-24 11:45:05,709 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-24 11:45:05,710 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (38)] Waiting until timeout for monitored process [2024-10-24 11:45:06,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:06,203 INFO L255 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-24 11:45:06,205 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:45:06,598 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 18 treesize of output 14 [2024-10-24 11:45:06,600 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 14 treesize of output 10 [2024-10-24 11:45:06,684 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-10-24 11:45:06,757 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 32 treesize of output 20 [2024-10-24 11:45:06,788 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-24 11:45:06,788 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:45:06,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [308813439] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:45:06,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 11:45:06,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 14 [2024-10-24 11:45:06,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005442398] [2024-10-24 11:45:06,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:45:06,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 11:45:06,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:45:06,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 11:45:06,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=397, Unknown=0, NotChecked=0, Total=462 [2024-10-24 11:45:06,790 INFO L87 Difference]: Start difference. First operand 452 states and 534 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 11:45:07,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:45:07,463 INFO L93 Difference]: Finished difference Result 1404 states and 1644 transitions. [2024-10-24 11:45:07,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 11:45:07,463 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 139 [2024-10-24 11:45:07,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:45:07,467 INFO L225 Difference]: With dead ends: 1404 [2024-10-24 11:45:07,467 INFO L226 Difference]: Without dead ends: 979 [2024-10-24 11:45:07,467 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 341 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=85, Invalid=515, Unknown=0, NotChecked=0, Total=600 [2024-10-24 11:45:07,468 INFO L432 NwaCegarLoop]: 220 mSDtfsCounter, 311 mSDsluCounter, 718 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 938 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 11:45:07,468 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 938 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 11:45:07,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 979 states. [2024-10-24 11:45:07,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 979 to 749. [2024-10-24 11:45:07,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 749 states, 618 states have (on average 1.1213592233009708) internal successors, (693), 623 states have internal predecessors, (693), 95 states have call successors, (95), 35 states have call predecessors, (95), 35 states have return successors, (95), 90 states have call predecessors, (95), 95 states have call successors, (95) [2024-10-24 11:45:07,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 749 states to 749 states and 883 transitions. [2024-10-24 11:45:07,577 INFO L78 Accepts]: Start accepts. Automaton has 749 states and 883 transitions. Word has length 139 [2024-10-24 11:45:07,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:45:07,578 INFO L471 AbstractCegarLoop]: Abstraction has 749 states and 883 transitions. [2024-10-24 11:45:07,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 11:45:07,578 INFO L276 IsEmpty]: Start isEmpty. Operand 749 states and 883 transitions. [2024-10-24 11:45:07,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-24 11:45:07,579 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:45:07,579 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:45:07,586 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 (37)] Forceful destruction successful, exit code 0 [2024-10-24 11:45:07,787 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (38)] Forceful destruction successful, exit code 0 [2024-10-24 11:45:07,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /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,38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-10-24 11:45:07,980 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:45:07,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:45:07,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1764261230, now seen corresponding path program 1 times [2024-10-24 11:45:07,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:45:07,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [56019018] [2024-10-24 11:45:07,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:45:07,981 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-10-24 11:45:07,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:45:07,982 INFO L229 MonitoredProcess]: Starting monitored process 39 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-10-24 11:45:07,983 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 (39)] Waiting until timeout for monitored process [2024-10-24 11:45:08,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:08,231 INFO L255 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-24 11:45:08,233 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:45:08,435 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 18 treesize of output 14 [2024-10-24 11:45:08,466 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 23 treesize of output 15 [2024-10-24 11:45:08,500 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-10-24 11:45:08,580 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 78 treesize of output 58 [2024-10-24 11:45:08,583 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-10-24 11:45:08,632 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 8 proven. 312 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2024-10-24 11:45:08,632 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:45:08,741 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-24 11:45:08,741 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:45:08,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [56019018] [2024-10-24 11:45:08,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [56019018] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-24 11:45:08,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 11:45:08,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [16] total 20 [2024-10-24 11:45:08,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854693339] [2024-10-24 11:45:08,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:45:08,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 11:45:08,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:45:08,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 11:45:08,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2024-10-24 11:45:08,742 INFO L87 Difference]: Start difference. First operand 749 states and 883 transitions. Second operand has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 11:45:09,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:45:09,073 INFO L93 Difference]: Finished difference Result 1662 states and 1957 transitions. [2024-10-24 11:45:09,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-24 11:45:09,074 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 140 [2024-10-24 11:45:09,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:45:09,081 INFO L225 Difference]: With dead ends: 1662 [2024-10-24 11:45:09,081 INFO L226 Difference]: Without dead ends: 940 [2024-10-24 11:45:09,083 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 260 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=534, Unknown=0, NotChecked=0, Total=600 [2024-10-24 11:45:09,083 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 62 mSDsluCounter, 979 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 1158 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:45:09,083 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 1158 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:45:09,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 940 states. [2024-10-24 11:45:09,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 940 to 809. [2024-10-24 11:45:09,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 809 states, 678 states have (on average 1.1238938053097345) internal successors, (762), 683 states have internal predecessors, (762), 95 states have call successors, (95), 35 states have call predecessors, (95), 35 states have return successors, (95), 90 states have call predecessors, (95), 95 states have call successors, (95) [2024-10-24 11:45:09,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 809 states and 952 transitions. [2024-10-24 11:45:09,202 INFO L78 Accepts]: Start accepts. Automaton has 809 states and 952 transitions. Word has length 140 [2024-10-24 11:45:09,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:45:09,203 INFO L471 AbstractCegarLoop]: Abstraction has 809 states and 952 transitions. [2024-10-24 11:45:09,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 11:45:09,203 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 952 transitions. [2024-10-24 11:45:09,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-24 11:45:09,204 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:45:09,204 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:45:09,211 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 (39)] Forceful destruction successful, exit code 0 [2024-10-24 11:45:09,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /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-10-24 11:45:09,404 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:45:09,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:45:09,405 INFO L85 PathProgramCache]: Analyzing trace with hash -195503687, now seen corresponding path program 1 times [2024-10-24 11:45:09,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:45:09,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1409006285] [2024-10-24 11:45:09,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:45:09,405 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-10-24 11:45:09,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:45:09,406 INFO L229 MonitoredProcess]: Starting monitored process 40 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-10-24 11:45:09,407 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 (40)] Waiting until timeout for monitored process [2024-10-24 11:45:09,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:45:09,670 INFO L255 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-24 11:45:09,673 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:45:10,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-24 11:45:10,242 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 86 treesize of output 50 [2024-10-24 11:45:10,273 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 113 treesize of output 53 [2024-10-24 11:45:10,297 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-24 11:45:10,298 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:45:10,369 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:45:10,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1409006285] [2024-10-24 11:45:10,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1409006285] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 11:45:10,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1930429404] [2024-10-24 11:45:10,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:45:10,369 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-24 11:45:10,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-24 11:45:10,371 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-24 11:45:10,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (41)] Waiting until timeout for monitored process