./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-a_file-37.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d 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-a_file-37.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 90de0053d184a453dc3a33f57409c1c246f48963f5fd9431c484b6f29206cf7b --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 05:56:59,523 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 05:56:59,572 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 05:56:59,578 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 05:56:59,578 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 05:56:59,604 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 05:56:59,605 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 05:56:59,605 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 05:56:59,607 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 05:56:59,608 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 05:56:59,608 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 05:56:59,608 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 05:56:59,609 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 05:56:59,609 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 05:56:59,610 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 05:56:59,610 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 05:56:59,611 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 05:56:59,613 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 05:56:59,613 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 05:56:59,613 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 05:56:59,613 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 05:56:59,614 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 05:56:59,614 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 05:56:59,614 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 05:56:59,614 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 05:56:59,615 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 05:56:59,615 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 05:56:59,616 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 05:56:59,616 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 05:56:59,616 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 05:56:59,616 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 05:56:59,617 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 05:56:59,617 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 05:56:59,617 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 05:56:59,618 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 05:56:59,618 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 05:56:59,618 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 05:56:59,618 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 05:56:59,619 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 05:56:59,619 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 05:56:59,620 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 05:56:59,620 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 05:56:59,620 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 -> 90de0053d184a453dc3a33f57409c1c246f48963f5fd9431c484b6f29206cf7b [2024-10-13 05:56:59,849 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 05:56:59,870 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 05:56:59,872 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 05:56:59,873 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 05:56:59,874 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 05:56:59,875 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-37.i [2024-10-13 05:57:01,106 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 05:57:01,251 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 05:57:01,252 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-37.i [2024-10-13 05:57:01,258 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ca5844fe/657400bb56b946b293ece33d408614f7/FLAG9aafd698e [2024-10-13 05:57:01,268 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ca5844fe/657400bb56b946b293ece33d408614f7 [2024-10-13 05:57:01,270 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 05:57:01,271 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 05:57:01,272 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 05:57:01,272 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 05:57:01,276 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 05:57:01,276 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 05:57:01" (1/1) ... [2024-10-13 05:57:01,277 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@615e4597 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:57:01, skipping insertion in model container [2024-10-13 05:57:01,277 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 05:57:01" (1/1) ... [2024-10-13 05:57:01,298 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 05:57:01,430 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-a_file-37.i[916,929] [2024-10-13 05:57:01,492 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 05:57:01,502 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 05:57:01,511 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-a_file-37.i[916,929] [2024-10-13 05:57:01,535 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 05:57:01,555 INFO L204 MainTranslator]: Completed translation [2024-10-13 05:57:01,556 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:57:01 WrapperNode [2024-10-13 05:57:01,558 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 05:57:01,559 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 05:57:01,559 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 05:57:01,559 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 05:57:01,568 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:57:01" (1/1) ... [2024-10-13 05:57:01,584 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:57:01" (1/1) ... [2024-10-13 05:57:01,617 INFO L138 Inliner]: procedures = 29, calls = 157, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 478 [2024-10-13 05:57:01,618 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 05:57:01,618 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 05:57:01,619 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 05:57:01,619 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 05:57:01,627 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:57:01" (1/1) ... [2024-10-13 05:57:01,627 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:57:01" (1/1) ... [2024-10-13 05:57:01,632 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:57:01" (1/1) ... [2024-10-13 05:57:01,648 INFO L175 MemorySlicer]: Split 124 memory accesses to 8 slices as follows [2, 8, 52, 20, 7, 15, 6, 14]. 42 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 1, 5, 2, 1, 2, 1, 2]. The 17 writes are split as follows [0, 1, 7, 2, 1, 3, 1, 2]. [2024-10-13 05:57:01,648 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:57:01" (1/1) ... [2024-10-13 05:57:01,649 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:57:01" (1/1) ... [2024-10-13 05:57:01,688 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:57:01" (1/1) ... [2024-10-13 05:57:01,692 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:57:01" (1/1) ... [2024-10-13 05:57:01,698 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:57:01" (1/1) ... [2024-10-13 05:57:01,700 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:57:01" (1/1) ... [2024-10-13 05:57:01,704 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 05:57:01,705 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 05:57:01,708 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 05:57:01,708 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 05:57:01,709 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:57:01" (1/1) ... [2024-10-13 05:57:01,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 05:57:01,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 05:57:01,759 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-13 05:57:01,763 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-13 05:57:01,798 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 05:57:01,799 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-13 05:57:01,799 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-13 05:57:01,799 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-10-13 05:57:01,799 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-10-13 05:57:01,800 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-10-13 05:57:01,800 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-10-13 05:57:01,801 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2024-10-13 05:57:01,801 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2024-10-13 05:57:01,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-13 05:57:01,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-13 05:57:01,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-13 05:57:01,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-13 05:57:01,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-13 05:57:01,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-10-13 05:57:01,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-10-13 05:57:01,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-10-13 05:57:01,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-13 05:57:01,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-13 05:57:01,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-10-13 05:57:01,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-10-13 05:57:01,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-10-13 05:57:01,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-10-13 05:57:01,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2024-10-13 05:57:01,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2024-10-13 05:57:01,803 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-13 05:57:01,804 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-13 05:57:01,804 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-13 05:57:01,804 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-13 05:57:01,805 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-13 05:57:01,805 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-10-13 05:57:01,805 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-10-13 05:57:01,805 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-10-13 05:57:01,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-13 05:57:01,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-13 05:57:01,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-10-13 05:57:01,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-10-13 05:57:01,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-10-13 05:57:01,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-10-13 05:57:01,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2024-10-13 05:57:01,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2024-10-13 05:57:01,806 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 05:57:01,806 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 05:57:01,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 05:57:01,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-13 05:57:01,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-13 05:57:01,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-13 05:57:01,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-13 05:57:01,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-13 05:57:01,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-10-13 05:57:01,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-10-13 05:57:01,807 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 05:57:01,807 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 05:57:01,935 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 05:57:01,937 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 05:57:02,301 INFO L? ?]: Removed 140 outVars from TransFormulas that were not future-live. [2024-10-13 05:57:02,301 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 05:57:02,333 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 05:57:02,333 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 05:57:02,333 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:57:02 BoogieIcfgContainer [2024-10-13 05:57:02,333 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 05:57:02,335 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 05:57:02,335 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 05:57:02,338 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 05:57:02,338 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 05:57:01" (1/3) ... [2024-10-13 05:57:02,339 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38d95cbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 05:57:02, skipping insertion in model container [2024-10-13 05:57:02,339 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:57:01" (2/3) ... [2024-10-13 05:57:02,339 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38d95cbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 05:57:02, skipping insertion in model container [2024-10-13 05:57:02,339 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:57:02" (3/3) ... [2024-10-13 05:57:02,340 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-37.i [2024-10-13 05:57:02,353 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 05:57:02,354 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 05:57:02,407 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 05:57:02,412 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;@571ce675, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 05:57:02,412 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 05:57:02,415 INFO L276 IsEmpty]: Start isEmpty. Operand has 98 states, 80 states have (on average 1.4625) internal successors, (117), 81 states have internal predecessors, (117), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-13 05:57:02,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-13 05:57:02,427 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:57:02,428 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 05:57:02,428 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:57:02,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:57:02,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1181780877, now seen corresponding path program 1 times [2024-10-13 05:57:02,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:57:02,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112861055] [2024-10-13 05:57:02,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:57:02,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:57:02,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:02,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 05:57:02,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:02,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-13 05:57:02,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:02,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 05:57:02,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:02,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 05:57:02,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:02,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 05:57:02,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:02,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 05:57:02,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:02,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 05:57:02,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:02,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 05:57:02,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:02,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 05:57:02,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:02,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 05:57:02,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:02,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 05:57:02,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:02,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 05:57:02,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:02,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-13 05:57:02,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:02,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-13 05:57:02,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:02,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 05:57:02,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:02,787 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-13 05:57:02,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:57:02,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112861055] [2024-10-13 05:57:02,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112861055] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:57:02,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:57:02,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 05:57:02,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695738194] [2024-10-13 05:57:02,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:57:02,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 05:57:02,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:57:02,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 05:57:02,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 05:57:02,821 INFO L87 Difference]: Start difference. First operand has 98 states, 80 states have (on average 1.4625) internal successors, (117), 81 states have internal predecessors, (117), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-13 05:57:02,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:57:02,876 INFO L93 Difference]: Finished difference Result 193 states and 307 transitions. [2024-10-13 05:57:02,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 05:57:02,878 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 119 [2024-10-13 05:57:02,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:57:02,884 INFO L225 Difference]: With dead ends: 193 [2024-10-13 05:57:02,885 INFO L226 Difference]: Without dead ends: 96 [2024-10-13 05:57:02,888 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 47 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-13 05:57:02,890 INFO L432 NwaCegarLoop]: 138 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, 138 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-13 05:57:02,890 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 138 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 05:57:02,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-10-13 05:57:02,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-10-13 05:57:02,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 79 states have (on average 1.4177215189873418) internal successors, (112), 79 states have internal predecessors, (112), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-13 05:57:02,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 142 transitions. [2024-10-13 05:57:02,925 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 142 transitions. Word has length 119 [2024-10-13 05:57:02,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:57:02,926 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 142 transitions. [2024-10-13 05:57:02,926 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-13 05:57:02,926 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 142 transitions. [2024-10-13 05:57:02,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-13 05:57:02,929 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:57:02,930 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 05:57:02,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 05:57:02,931 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:57:02,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:57:02,931 INFO L85 PathProgramCache]: Analyzing trace with hash -931313899, now seen corresponding path program 1 times [2024-10-13 05:57:02,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:57:02,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237272924] [2024-10-13 05:57:02,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:57:02,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:57:03,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:03,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 05:57:03,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:03,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-13 05:57:03,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:03,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 05:57:03,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:03,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 05:57:03,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:03,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 05:57:03,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:03,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 05:57:03,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:03,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 05:57:03,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:03,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 05:57:03,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:03,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 05:57:03,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:03,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 05:57:03,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:03,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 05:57:03,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:03,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 05:57:03,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:03,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-13 05:57:03,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:03,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-13 05:57:03,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:03,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 05:57:03,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:03,148 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-13 05:57:03,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:57:03,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237272924] [2024-10-13 05:57:03,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237272924] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:57:03,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:57:03,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 05:57:03,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905387334] [2024-10-13 05:57:03,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:57:03,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 05:57:03,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:57:03,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 05:57:03,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 05:57:03,151 INFO L87 Difference]: Start difference. First operand 96 states and 142 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-13 05:57:03,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:57:03,195 INFO L93 Difference]: Finished difference Result 194 states and 287 transitions. [2024-10-13 05:57:03,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 05:57:03,196 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 119 [2024-10-13 05:57:03,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:57:03,197 INFO L225 Difference]: With dead ends: 194 [2024-10-13 05:57:03,197 INFO L226 Difference]: Without dead ends: 99 [2024-10-13 05:57:03,198 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 32 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-13 05:57:03,199 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 1 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 398 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-13 05:57:03,199 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 398 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 05:57:03,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-10-13 05:57:03,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2024-10-13 05:57:03,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 81 states have (on average 1.4074074074074074) internal successors, (114), 81 states have internal predecessors, (114), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-13 05:57:03,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 144 transitions. [2024-10-13 05:57:03,215 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 144 transitions. Word has length 119 [2024-10-13 05:57:03,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:57:03,216 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 144 transitions. [2024-10-13 05:57:03,216 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-13 05:57:03,218 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 144 transitions. [2024-10-13 05:57:03,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-13 05:57:03,220 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:57:03,220 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 05:57:03,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 05:57:03,220 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:57:03,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:57:03,221 INFO L85 PathProgramCache]: Analyzing trace with hash -1740660525, now seen corresponding path program 1 times [2024-10-13 05:57:03,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:57:03,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83600696] [2024-10-13 05:57:03,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:57:03,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:57:03,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:03,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 05:57:03,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:03,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-13 05:57:03,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:03,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 05:57:03,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:03,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 05:57:03,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:03,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 05:57:03,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:03,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 05:57:03,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:03,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 05:57:03,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:03,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 05:57:03,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:03,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 05:57:03,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:03,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 05:57:03,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:03,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 05:57:03,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:03,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 05:57:03,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:03,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-13 05:57:03,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:03,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-13 05:57:03,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:03,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 05:57:03,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:03,433 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-13 05:57:03,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:57:03,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83600696] [2024-10-13 05:57:03,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83600696] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:57:03,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:57:03,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 05:57:03,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523140875] [2024-10-13 05:57:03,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:57:03,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 05:57:03,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:57:03,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 05:57:03,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 05:57:03,436 INFO L87 Difference]: Start difference. First operand 98 states and 144 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-13 05:57:03,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:57:03,472 INFO L93 Difference]: Finished difference Result 198 states and 291 transitions. [2024-10-13 05:57:03,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 05:57:03,473 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 119 [2024-10-13 05:57:03,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:57:03,474 INFO L225 Difference]: With dead ends: 198 [2024-10-13 05:57:03,474 INFO L226 Difference]: Without dead ends: 101 [2024-10-13 05:57:03,474 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 32 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-13 05:57:03,475 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 1 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 402 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-13 05:57:03,476 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 402 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 05:57:03,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-10-13 05:57:03,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2024-10-13 05:57:03,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 83 states have (on average 1.3975903614457832) internal successors, (116), 83 states have internal predecessors, (116), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-13 05:57:03,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 146 transitions. [2024-10-13 05:57:03,484 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 146 transitions. Word has length 119 [2024-10-13 05:57:03,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:57:03,484 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 146 transitions. [2024-10-13 05:57:03,484 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-13 05:57:03,484 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 146 transitions. [2024-10-13 05:57:03,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-13 05:57:03,485 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:57:03,486 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 05:57:03,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 05:57:03,486 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:57:03,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:57:03,489 INFO L85 PathProgramCache]: Analyzing trace with hash -1740600943, now seen corresponding path program 1 times [2024-10-13 05:57:03,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:57:03,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67013377] [2024-10-13 05:57:03,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:57:03,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:57:03,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:04,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 05:57:04,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:04,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-13 05:57:04,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:04,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 05:57:04,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:04,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 05:57:04,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:04,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 05:57:04,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:04,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 05:57:04,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:04,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 05:57:04,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:04,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 05:57:04,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:04,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 05:57:04,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:04,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 05:57:04,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:04,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 05:57:04,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:04,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 05:57:04,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:04,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-13 05:57:04,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:04,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-13 05:57:04,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:04,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 05:57:04,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:04,260 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-13 05:57:04,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:57:04,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67013377] [2024-10-13 05:57:04,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67013377] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:57:04,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:57:04,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 05:57:04,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588873153] [2024-10-13 05:57:04,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:57:04,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 05:57:04,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:57:04,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 05:57:04,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 05:57:04,264 INFO L87 Difference]: Start difference. First operand 100 states and 146 transitions. Second operand has 6 states, 5 states have (on average 9.4) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-13 05:57:04,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:57:04,377 INFO L93 Difference]: Finished difference Result 223 states and 324 transitions. [2024-10-13 05:57:04,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 05:57:04,377 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.4) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 119 [2024-10-13 05:57:04,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:57:04,380 INFO L225 Difference]: With dead ends: 223 [2024-10-13 05:57:04,380 INFO L226 Difference]: Without dead ends: 124 [2024-10-13 05:57:04,381 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-13 05:57:04,382 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 96 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 687 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 05:57:04,382 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 687 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 05:57:04,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-10-13 05:57:04,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 123. [2024-10-13 05:57:04,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 98 states have (on average 1.3571428571428572) internal successors, (133), 99 states have internal predecessors, (133), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-13 05:57:04,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 177 transitions. [2024-10-13 05:57:04,399 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 177 transitions. Word has length 119 [2024-10-13 05:57:04,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:57:04,399 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 177 transitions. [2024-10-13 05:57:04,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.4) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-13 05:57:04,399 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 177 transitions. [2024-10-13 05:57:04,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-13 05:57:04,402 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:57:04,402 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 05:57:04,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 05:57:04,403 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:57:04,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:57:04,403 INFO L85 PathProgramCache]: Analyzing trace with hash -840852342, now seen corresponding path program 1 times [2024-10-13 05:57:04,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:57:04,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425693536] [2024-10-13 05:57:04,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:57:04,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:57:04,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:04,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 05:57:04,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:04,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-13 05:57:04,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:04,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 05:57:04,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:04,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 05:57:04,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:04,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 05:57:04,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:04,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 05:57:04,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:04,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 05:57:04,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:04,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 05:57:04,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:04,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 05:57:04,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:04,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 05:57:04,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:04,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 05:57:04,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:04,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 05:57:04,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:04,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-13 05:57:04,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:04,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-13 05:57:04,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:04,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 05:57:04,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:04,736 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-13 05:57:04,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:57:04,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425693536] [2024-10-13 05:57:04,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425693536] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:57:04,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:57:04,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 05:57:04,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830519505] [2024-10-13 05:57:04,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:57:04,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 05:57:04,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:57:04,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 05:57:04,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 05:57:04,742 INFO L87 Difference]: Start difference. First operand 123 states and 177 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-13 05:57:04,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:57:04,855 INFO L93 Difference]: Finished difference Result 328 states and 469 transitions. [2024-10-13 05:57:04,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 05:57:04,856 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 122 [2024-10-13 05:57:04,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:57:04,860 INFO L225 Difference]: With dead ends: 328 [2024-10-13 05:57:04,862 INFO L226 Difference]: Without dead ends: 225 [2024-10-13 05:57:04,863 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 33 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-13 05:57:04,864 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 125 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 627 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 05:57:04,864 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 627 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 05:57:04,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2024-10-13 05:57:04,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 222. [2024-10-13 05:57:04,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 180 states have (on average 1.3611111111111112) internal successors, (245), 182 states have internal predecessors, (245), 37 states have call successors, (37), 4 states have call predecessors, (37), 4 states have return successors, (37), 35 states have call predecessors, (37), 37 states have call successors, (37) [2024-10-13 05:57:04,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 319 transitions. [2024-10-13 05:57:04,894 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 319 transitions. Word has length 122 [2024-10-13 05:57:04,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:57:04,895 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 319 transitions. [2024-10-13 05:57:04,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-13 05:57:04,896 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 319 transitions. [2024-10-13 05:57:04,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-13 05:57:04,898 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:57:04,899 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 05:57:04,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 05:57:04,899 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:57:04,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:57:04,899 INFO L85 PathProgramCache]: Analyzing trace with hash -1851969592, now seen corresponding path program 1 times [2024-10-13 05:57:04,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:57:04,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852801606] [2024-10-13 05:57:04,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:57:04,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:57:04,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:05,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 05:57:05,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:05,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-13 05:57:05,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:05,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 05:57:05,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:05,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 05:57:05,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:05,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 05:57:05,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:05,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 05:57:05,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:05,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 05:57:05,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:05,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 05:57:05,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:05,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 05:57:05,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:05,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 05:57:05,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:05,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 05:57:05,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:05,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 05:57:05,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:05,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-13 05:57:05,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:05,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-13 05:57:05,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:05,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 05:57:05,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:05,566 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 39 proven. 3 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-10-13 05:57:05,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:57:05,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852801606] [2024-10-13 05:57:05,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852801606] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 05:57:05,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [623892398] [2024-10-13 05:57:05,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:57:05,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 05:57:05,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 05:57:05,569 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-13 05:57:05,571 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-13 05:57:05,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:05,822 INFO L255 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-13 05:57:05,832 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:57:05,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 9 treesize of output 3 [2024-10-13 05:57:05,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 19 treesize of output 1 [2024-10-13 05:57:05,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-10-13 05:57:06,011 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 19 treesize of output 1 [2024-10-13 05:57:06,124 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-13 05:57:06,129 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 11 [2024-10-13 05:57:06,178 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 13 [2024-10-13 05:57:06,183 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-10-13 05:57:06,230 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 9 [2024-10-13 05:57:06,253 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 15 treesize of output 7 [2024-10-13 05:57:06,274 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 215 proven. 3 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2024-10-13 05:57:06,274 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 05:57:06,645 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 39 proven. 3 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-10-13 05:57:06,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [623892398] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 05:57:06,646 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 05:57:06,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 24 [2024-10-13 05:57:06,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557048586] [2024-10-13 05:57:06,646 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 05:57:06,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-13 05:57:06,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:57:06,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-13 05:57:06,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=472, Unknown=0, NotChecked=0, Total=552 [2024-10-13 05:57:06,648 INFO L87 Difference]: Start difference. First operand 222 states and 319 transitions. Second operand has 24 states, 22 states have (on average 5.0) internal successors, (110), 24 states have internal predecessors, (110), 8 states have call successors, (39), 3 states have call predecessors, (39), 6 states have return successors, (39), 6 states have call predecessors, (39), 8 states have call successors, (39) [2024-10-13 05:57:07,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:57:07,680 INFO L93 Difference]: Finished difference Result 462 states and 651 transitions. [2024-10-13 05:57:07,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-13 05:57:07,681 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 5.0) internal successors, (110), 24 states have internal predecessors, (110), 8 states have call successors, (39), 3 states have call predecessors, (39), 6 states have return successors, (39), 6 states have call predecessors, (39), 8 states have call successors, (39) Word has length 122 [2024-10-13 05:57:07,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:57:07,682 INFO L225 Difference]: With dead ends: 462 [2024-10-13 05:57:07,682 INFO L226 Difference]: Without dead ends: 260 [2024-10-13 05:57:07,683 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 262 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=309, Invalid=1251, Unknown=0, NotChecked=0, Total=1560 [2024-10-13 05:57:07,684 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 523 mSDsluCounter, 758 mSDsCounter, 0 mSdLazyCounter, 1013 mSolverCounterSat, 271 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 524 SdHoareTripleChecker+Valid, 847 SdHoareTripleChecker+Invalid, 1284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 271 IncrementalHoareTripleChecker+Valid, 1013 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-13 05:57:07,684 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [524 Valid, 847 Invalid, 1284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [271 Valid, 1013 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-13 05:57:07,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2024-10-13 05:57:07,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 227. [2024-10-13 05:57:07,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 185 states have (on average 1.3405405405405406) internal successors, (248), 187 states have internal predecessors, (248), 35 states have call successors, (35), 6 states have call predecessors, (35), 6 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) [2024-10-13 05:57:07,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 318 transitions. [2024-10-13 05:57:07,702 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 318 transitions. Word has length 122 [2024-10-13 05:57:07,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:57:07,703 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 318 transitions. [2024-10-13 05:57:07,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 5.0) internal successors, (110), 24 states have internal predecessors, (110), 8 states have call successors, (39), 3 states have call predecessors, (39), 6 states have return successors, (39), 6 states have call predecessors, (39), 8 states have call successors, (39) [2024-10-13 05:57:07,703 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 318 transitions. [2024-10-13 05:57:07,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-13 05:57:07,704 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:57:07,704 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 05:57:07,721 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-13 05:57:07,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-13 05:57:07,905 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:57:07,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:57:07,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1996740300, now seen corresponding path program 1 times [2024-10-13 05:57:07,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:57:07,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008760491] [2024-10-13 05:57:07,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:57:07,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:57:07,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:08,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 05:57:08,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:08,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-13 05:57:08,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:08,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 05:57:08,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:08,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 05:57:08,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:08,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 05:57:08,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:08,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 05:57:08,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:08,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 05:57:08,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:08,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 05:57:08,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:08,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 05:57:08,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:08,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 05:57:08,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:08,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 05:57:08,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:08,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 05:57:08,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:08,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-13 05:57:08,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:08,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-13 05:57:08,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:08,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 05:57:08,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:08,243 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-13 05:57:08,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:57:08,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008760491] [2024-10-13 05:57:08,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008760491] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:57:08,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:57:08,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 05:57:08,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431574876] [2024-10-13 05:57:08,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:57:08,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 05:57:08,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:57:08,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 05:57:08,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 05:57:08,245 INFO L87 Difference]: Start difference. First operand 227 states and 318 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-13 05:57:08,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:57:08,384 INFO L93 Difference]: Finished difference Result 516 states and 721 transitions. [2024-10-13 05:57:08,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 05:57:08,384 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 122 [2024-10-13 05:57:08,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:57:08,386 INFO L225 Difference]: With dead ends: 516 [2024-10-13 05:57:08,386 INFO L226 Difference]: Without dead ends: 309 [2024-10-13 05:57:08,386 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 34 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-13 05:57:08,387 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 93 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 688 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 05:57:08,387 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 688 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 05:57:08,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2024-10-13 05:57:08,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 306. [2024-10-13 05:57:08,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 257 states have (on average 1.3579766536964981) internal successors, (349), 260 states have internal predecessors, (349), 40 states have call successors, (40), 8 states have call predecessors, (40), 8 states have return successors, (40), 37 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-13 05:57:08,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 429 transitions. [2024-10-13 05:57:08,403 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 429 transitions. Word has length 122 [2024-10-13 05:57:08,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:57:08,403 INFO L471 AbstractCegarLoop]: Abstraction has 306 states and 429 transitions. [2024-10-13 05:57:08,403 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-13 05:57:08,403 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 429 transitions. [2024-10-13 05:57:08,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-13 05:57:08,404 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:57:08,404 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 05:57:08,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 05:57:08,405 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:57:08,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:57:08,405 INFO L85 PathProgramCache]: Analyzing trace with hash 1530886920, now seen corresponding path program 1 times [2024-10-13 05:57:08,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:57:08,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292358374] [2024-10-13 05:57:08,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:57:08,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:57:08,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:08,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 05:57:08,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:08,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-13 05:57:08,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:08,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 05:57:08,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:08,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 05:57:08,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:08,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 05:57:08,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:08,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 05:57:08,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:08,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 05:57:08,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:08,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 05:57:08,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:08,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 05:57:08,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:08,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 05:57:08,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:08,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 05:57:08,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:08,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 05:57:08,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:08,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-13 05:57:08,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:08,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-13 05:57:08,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:08,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 05:57:08,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:08,825 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 9 proven. 33 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-10-13 05:57:08,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:57:08,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292358374] [2024-10-13 05:57:08,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292358374] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 05:57:08,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [164155925] [2024-10-13 05:57:08,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:57:08,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 05:57:08,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 05:57:08,828 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-13 05:57:08,829 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-13 05:57:08,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:08,993 INFO L255 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-13 05:57:08,997 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:57:09,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-10-13 05:57:09,119 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 11 [2024-10-13 05:57:09,128 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 152 proven. 33 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2024-10-13 05:57:09,128 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 05:57:09,262 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 9 proven. 33 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-10-13 05:57:09,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [164155925] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 05:57:09,262 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 05:57:09,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2024-10-13 05:57:09,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521098178] [2024-10-13 05:57:09,263 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 05:57:09,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-13 05:57:09,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:57:09,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-13 05:57:09,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-10-13 05:57:09,264 INFO L87 Difference]: Start difference. First operand 306 states and 429 transitions. Second operand has 11 states, 8 states have (on average 7.625) internal successors, (61), 11 states have internal predecessors, (61), 5 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (28), 2 states have call predecessors, (28), 5 states have call successors, (28) [2024-10-13 05:57:09,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:57:09,486 INFO L93 Difference]: Finished difference Result 447 states and 610 transitions. [2024-10-13 05:57:09,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 05:57:09,487 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 7.625) internal successors, (61), 11 states have internal predecessors, (61), 5 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (28), 2 states have call predecessors, (28), 5 states have call successors, (28) Word has length 122 [2024-10-13 05:57:09,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:57:09,488 INFO L225 Difference]: With dead ends: 447 [2024-10-13 05:57:09,489 INFO L226 Difference]: Without dead ends: 161 [2024-10-13 05:57:09,489 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 268 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2024-10-13 05:57:09,491 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 262 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 05:57:09,491 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 387 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 05:57:09,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2024-10-13 05:57:09,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 157. [2024-10-13 05:57:09,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 120 states have (on average 1.25) internal successors, (150), 121 states have internal predecessors, (150), 28 states have call successors, (28), 8 states have call predecessors, (28), 8 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-13 05:57:09,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 206 transitions. [2024-10-13 05:57:09,507 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 206 transitions. Word has length 122 [2024-10-13 05:57:09,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:57:09,507 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 206 transitions. [2024-10-13 05:57:09,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 7.625) internal successors, (61), 11 states have internal predecessors, (61), 5 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (28), 2 states have call predecessors, (28), 5 states have call successors, (28) [2024-10-13 05:57:09,508 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 206 transitions. [2024-10-13 05:57:09,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-13 05:57:09,508 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:57:09,508 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 05:57:09,524 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-13 05:57:09,709 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-13 05:57:09,709 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:57:09,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:57:09,709 INFO L85 PathProgramCache]: Analyzing trace with hash -1550258061, now seen corresponding path program 1 times [2024-10-13 05:57:09,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:57:09,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336996967] [2024-10-13 05:57:09,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:57:09,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:57:09,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:10,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 05:57:10,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:10,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-13 05:57:10,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:10,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 05:57:10,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:10,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 05:57:10,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:10,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 05:57:10,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:10,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 05:57:10,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:10,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 05:57:10,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:10,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 05:57:10,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:10,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 05:57:10,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:10,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 05:57:10,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:10,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 05:57:10,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:10,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 05:57:10,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:10,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-13 05:57:10,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:10,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-13 05:57:10,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:10,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 05:57:10,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:10,039 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-13 05:57:10,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:57:10,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336996967] [2024-10-13 05:57:10,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336996967] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:57:10,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:57:10,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 05:57:10,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026965724] [2024-10-13 05:57:10,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:57:10,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 05:57:10,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:57:10,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 05:57:10,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 05:57:10,041 INFO L87 Difference]: Start difference. First operand 157 states and 206 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-13 05:57:10,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:57:10,139 INFO L93 Difference]: Finished difference Result 280 states and 364 transitions. [2024-10-13 05:57:10,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 05:57:10,139 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2024-10-13 05:57:10,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:57:10,140 INFO L225 Difference]: With dead ends: 280 [2024-10-13 05:57:10,140 INFO L226 Difference]: Without dead ends: 163 [2024-10-13 05:57:10,141 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 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-13 05:57:10,142 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 77 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 05:57:10,143 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 396 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 05:57:10,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-10-13 05:57:10,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2024-10-13 05:57:10,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 125 states have (on average 1.24) internal successors, (155), 126 states have internal predecessors, (155), 28 states have call successors, (28), 9 states have call predecessors, (28), 9 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-13 05:57:10,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 211 transitions. [2024-10-13 05:57:10,159 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 211 transitions. Word has length 124 [2024-10-13 05:57:10,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:57:10,160 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 211 transitions. [2024-10-13 05:57:10,160 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-13 05:57:10,160 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 211 transitions. [2024-10-13 05:57:10,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-13 05:57:10,161 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:57:10,161 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 05:57:10,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 05:57:10,162 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:57:10,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:57:10,162 INFO L85 PathProgramCache]: Analyzing trace with hash -1607575945, now seen corresponding path program 1 times [2024-10-13 05:57:10,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:57:10,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952305444] [2024-10-13 05:57:10,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:57:10,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:57:10,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:11,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 05:57:11,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:11,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-13 05:57:11,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:11,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 05:57:11,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:11,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 05:57:11,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:11,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 05:57:11,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:11,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 05:57:11,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:11,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 05:57:11,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:11,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 05:57:11,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:11,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 05:57:11,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:11,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 05:57:11,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:11,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 05:57:11,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:11,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 05:57:11,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:11,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-13 05:57:11,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:11,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-13 05:57:11,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:11,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 05:57:11,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:11,381 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 12 proven. 30 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-10-13 05:57:11,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:57:11,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952305444] [2024-10-13 05:57:11,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952305444] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 05:57:11,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1568307409] [2024-10-13 05:57:11,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:57:11,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 05:57:11,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 05:57:11,383 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-13 05:57:11,384 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-13 05:57:11,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:11,561 INFO L255 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-10-13 05:57:11,566 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:57:11,574 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 19 treesize of output 1 [2024-10-13 05:57:11,590 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 11 [2024-10-13 05:57:11,592 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-13 05:57:11,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 51 [2024-10-13 05:57:11,603 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2024-10-13 05:57:11,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2024-10-13 05:57:11,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 54 [2024-10-13 05:57:12,049 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 116 treesize of output 96 [2024-10-13 05:57:12,056 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 05:57:12,056 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 111 treesize of output 55 [2024-10-13 05:57:12,075 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 21 proven. 21 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-10-13 05:57:12,075 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 05:57:12,375 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 57 [2024-10-13 05:57:12,383 INFO L349 Elim1Store]: treesize reduction 30, result has 3.2 percent of original size [2024-10-13 05:57:12,383 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 57 treesize of output 1 [2024-10-13 05:57:12,425 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-13 05:57:12,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1568307409] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-13 05:57:12,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-13 05:57:12,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [13, 8] total 17 [2024-10-13 05:57:12,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743077170] [2024-10-13 05:57:12,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:57:12,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 05:57:12,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:57:12,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 05:57:12,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2024-10-13 05:57:12,427 INFO L87 Difference]: Start difference. First operand 163 states and 211 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-13 05:57:12,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:57:12,523 INFO L93 Difference]: Finished difference Result 180 states and 228 transitions. [2024-10-13 05:57:12,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 05:57:12,524 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2024-10-13 05:57:12,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:57:12,525 INFO L225 Difference]: With dead ends: 180 [2024-10-13 05:57:12,525 INFO L226 Difference]: Without dead ends: 178 [2024-10-13 05:57:12,525 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 274 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2024-10-13 05:57:12,526 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 111 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 05:57:12,526 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 573 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 05:57:12,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2024-10-13 05:57:12,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 165. [2024-10-13 05:57:12,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 127 states have (on average 1.236220472440945) internal successors, (157), 128 states have internal predecessors, (157), 28 states have call successors, (28), 9 states have call predecessors, (28), 9 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-13 05:57:12,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 213 transitions. [2024-10-13 05:57:12,540 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 213 transitions. Word has length 124 [2024-10-13 05:57:12,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:57:12,540 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 213 transitions. [2024-10-13 05:57:12,540 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-13 05:57:12,540 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 213 transitions. [2024-10-13 05:57:12,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-13 05:57:12,541 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:57:12,541 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 05:57:12,561 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-13 05:57:12,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 05:57:12,742 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:57:12,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:57:12,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1607516363, now seen corresponding path program 1 times [2024-10-13 05:57:12,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:57:12,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010864943] [2024-10-13 05:57:12,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:57:12,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:57:12,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:12,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 05:57:12,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:12,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-13 05:57:12,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:12,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 05:57:12,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:12,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 05:57:12,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:12,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 05:57:12,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:12,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 05:57:12,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:12,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 05:57:12,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:12,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 05:57:12,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:12,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 05:57:12,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:12,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 05:57:12,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:12,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 05:57:12,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:12,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 05:57:12,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:12,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-13 05:57:12,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:12,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-13 05:57:12,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:12,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 05:57:12,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:12,914 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-13 05:57:12,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:57:12,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010864943] [2024-10-13 05:57:12,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010864943] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:57:12,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:57:12,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 05:57:12,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580448505] [2024-10-13 05:57:12,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:57:12,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 05:57:12,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:57:12,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 05:57:12,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 05:57:12,917 INFO L87 Difference]: Start difference. First operand 165 states and 213 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-13 05:57:12,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:57:12,990 INFO L93 Difference]: Finished difference Result 303 states and 385 transitions. [2024-10-13 05:57:12,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 05:57:12,990 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2024-10-13 05:57:12,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:57:12,992 INFO L225 Difference]: With dead ends: 303 [2024-10-13 05:57:12,992 INFO L226 Difference]: Without dead ends: 178 [2024-10-13 05:57:12,992 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 32 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-13 05:57:12,992 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 112 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 05:57:12,993 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 582 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 05:57:12,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2024-10-13 05:57:13,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 165. [2024-10-13 05:57:13,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 127 states have (on average 1.2283464566929134) internal successors, (156), 128 states have internal predecessors, (156), 28 states have call successors, (28), 9 states have call predecessors, (28), 9 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-13 05:57:13,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 212 transitions. [2024-10-13 05:57:13,006 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 212 transitions. Word has length 124 [2024-10-13 05:57:13,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:57:13,006 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 212 transitions. [2024-10-13 05:57:13,007 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-13 05:57:13,007 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 212 transitions. [2024-10-13 05:57:13,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-13 05:57:13,007 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:57:13,007 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 05:57:13,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 05:57:13,008 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:57:13,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:57:13,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1935362609, now seen corresponding path program 1 times [2024-10-13 05:57:13,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:57:13,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110954928] [2024-10-13 05:57:13,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:57:13,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:57:13,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:14,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 05:57:14,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:14,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-13 05:57:14,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:14,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 05:57:14,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:14,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 05:57:14,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:14,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 05:57:14,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:14,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 05:57:14,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:14,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 05:57:14,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:14,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 05:57:14,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:14,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 05:57:14,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:14,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 05:57:14,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:14,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 05:57:14,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:14,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 05:57:14,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:14,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-13 05:57:14,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:14,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-13 05:57:14,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:14,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 05:57:14,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:14,850 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 24 proven. 54 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2024-10-13 05:57:14,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:57:14,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110954928] [2024-10-13 05:57:14,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110954928] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 05:57:14,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1342217057] [2024-10-13 05:57:14,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:57:14,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 05:57:14,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 05:57:14,852 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 05:57:14,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-13 05:57:15,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:15,175 INFO L255 TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-10-13 05:57:15,180 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:57:15,192 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 19 treesize of output 1 [2024-10-13 05:57:15,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 18 [2024-10-13 05:57:16,121 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 05:57:16,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 42 [2024-10-13 05:57:16,207 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 05:57:16,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 166 treesize of output 90 [2024-10-13 05:57:16,462 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 05:57:16,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 330 treesize of output 132 [2024-10-13 05:57:16,529 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 223 proven. 72 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2024-10-13 05:57:16,529 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 05:57:16,824 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-13 05:57:16,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1342217057] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-13 05:57:16,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-13 05:57:16,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [19, 23] total 38 [2024-10-13 05:57:16,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294730089] [2024-10-13 05:57:16,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:57:16,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 05:57:16,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:57:16,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 05:57:16,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=1214, Unknown=0, NotChecked=0, Total=1406 [2024-10-13 05:57:16,828 INFO L87 Difference]: Start difference. First operand 165 states and 212 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-13 05:57:17,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:57:17,046 INFO L93 Difference]: Finished difference Result 351 states and 449 transitions. [2024-10-13 05:57:17,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 05:57:17,047 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2024-10-13 05:57:17,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:57:17,049 INFO L225 Difference]: With dead ends: 351 [2024-10-13 05:57:17,049 INFO L226 Difference]: Without dead ends: 226 [2024-10-13 05:57:17,050 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 259 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 328 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=204, Invalid=1436, Unknown=0, NotChecked=0, Total=1640 [2024-10-13 05:57:17,052 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 61 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 659 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 05:57:17,052 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 659 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 05:57:17,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2024-10-13 05:57:17,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 182. [2024-10-13 05:57:17,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 144 states have (on average 1.2361111111111112) internal successors, (178), 145 states have internal predecessors, (178), 28 states have call successors, (28), 9 states have call predecessors, (28), 9 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-13 05:57:17,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 234 transitions. [2024-10-13 05:57:17,068 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 234 transitions. Word has length 124 [2024-10-13 05:57:17,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:57:17,069 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 234 transitions. [2024-10-13 05:57:17,069 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-13 05:57:17,069 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 234 transitions. [2024-10-13 05:57:17,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-13 05:57:17,071 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:57:17,071 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 05:57:17,088 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-13 05:57:17,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 05:57:17,272 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:57:17,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:57:17,272 INFO L85 PathProgramCache]: Analyzing trace with hash -19428654, now seen corresponding path program 1 times [2024-10-13 05:57:17,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:57:17,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980363911] [2024-10-13 05:57:17,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:57:17,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:57:17,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:17,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 05:57:17,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:17,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-13 05:57:17,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:17,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 05:57:17,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:17,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 05:57:17,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:17,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 05:57:17,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:17,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 05:57:17,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:17,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 05:57:17,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:17,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 05:57:17,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:17,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 05:57:17,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:17,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 05:57:17,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:17,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 05:57:17,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:17,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 05:57:17,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:17,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-13 05:57:17,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:17,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-13 05:57:17,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:17,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 05:57:17,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:17,512 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-13 05:57:17,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:57:17,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980363911] [2024-10-13 05:57:17,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980363911] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:57:17,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:57:17,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 05:57:17,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396005467] [2024-10-13 05:57:17,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:57:17,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 05:57:17,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:57:17,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 05:57:17,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 05:57:17,515 INFO L87 Difference]: Start difference. First operand 182 states and 234 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-13 05:57:17,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:57:17,615 INFO L93 Difference]: Finished difference Result 328 states and 417 transitions. [2024-10-13 05:57:17,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 05:57:17,615 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 126 [2024-10-13 05:57:17,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:57:17,616 INFO L225 Difference]: With dead ends: 328 [2024-10-13 05:57:17,617 INFO L226 Difference]: Without dead ends: 186 [2024-10-13 05:57:17,617 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-13 05:57:17,617 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 87 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 05:57:17,617 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 318 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 05:57:17,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-10-13 05:57:17,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2024-10-13 05:57:17,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 147 states have (on average 1.2244897959183674) internal successors, (180), 148 states have internal predecessors, (180), 28 states have call successors, (28), 10 states have call predecessors, (28), 10 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-13 05:57:17,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 236 transitions. [2024-10-13 05:57:17,634 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 236 transitions. Word has length 126 [2024-10-13 05:57:17,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:57:17,635 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 236 transitions. [2024-10-13 05:57:17,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-13 05:57:17,635 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 236 transitions. [2024-10-13 05:57:17,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-13 05:57:17,637 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:57:17,637 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 05:57:17,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-13 05:57:17,637 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:57:17,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:57:17,638 INFO L85 PathProgramCache]: Analyzing trace with hash -1824866988, now seen corresponding path program 1 times [2024-10-13 05:57:17,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:57:17,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169864333] [2024-10-13 05:57:17,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:57:17,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:57:17,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:18,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 05:57:18,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:18,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-13 05:57:18,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:18,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 05:57:18,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:18,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 05:57:18,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:18,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 05:57:18,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:18,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 05:57:18,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:18,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 05:57:18,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:18,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 05:57:18,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:18,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 05:57:18,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:18,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 05:57:18,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:18,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 05:57:18,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:18,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 05:57:18,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:18,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-13 05:57:18,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:18,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-13 05:57:18,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:18,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 05:57:18,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:18,304 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 36 proven. 42 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2024-10-13 05:57:18,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:57:18,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169864333] [2024-10-13 05:57:18,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169864333] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 05:57:18,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [17892483] [2024-10-13 05:57:18,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:57:18,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 05:57:18,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 05:57:18,307 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 05:57:18,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-13 05:57:18,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:18,706 INFO L255 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 71 conjuncts are in the unsatisfiable core [2024-10-13 05:57:18,713 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:57:18,720 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 9 treesize of output 3 [2024-10-13 05:57:18,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2024-10-13 05:57:19,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 29 [2024-10-13 05:57:19,405 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 05:57:19,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 63 treesize of output 43 [2024-10-13 05:57:20,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 59 [2024-10-13 05:57:20,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2024-10-13 05:57:20,874 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 13 [2024-10-13 05:57:20,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2024-10-13 05:57:20,884 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 15 treesize of output 11 [2024-10-13 05:57:21,010 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 05:57:21,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 61 treesize of output 59 [2024-10-13 05:57:21,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2024-10-13 05:57:21,204 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 05:57:21,205 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 32 treesize of output 12 [2024-10-13 05:57:21,279 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-13 05:57:21,339 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 05:57:21,340 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 66 treesize of output 22 [2024-10-13 05:57:21,385 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 163 proven. 201 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-10-13 05:57:21,385 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 05:57:21,891 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 35 treesize of output 27 [2024-10-13 05:57:22,131 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 23 [2024-10-13 05:57:22,383 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 54 proven. 63 refuted. 0 times theorem prover too weak. 303 trivial. 0 not checked. [2024-10-13 05:57:22,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [17892483] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 05:57:22,384 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 05:57:22,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 27, 20] total 56 [2024-10-13 05:57:22,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951607069] [2024-10-13 05:57:22,384 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 05:57:22,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2024-10-13 05:57:22,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:57:22,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2024-10-13 05:57:22,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=517, Invalid=2563, Unknown=0, NotChecked=0, Total=3080 [2024-10-13 05:57:22,386 INFO L87 Difference]: Start difference. First operand 186 states and 236 transitions. Second operand has 56 states, 47 states have (on average 3.0851063829787235) internal successors, (145), 53 states have internal predecessors, (145), 19 states have call successors, (41), 8 states have call predecessors, (41), 14 states have return successors, (41), 12 states have call predecessors, (41), 19 states have call successors, (41) [2024-10-13 05:57:25,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:57:25,023 INFO L93 Difference]: Finished difference Result 396 states and 485 transitions. [2024-10-13 05:57:25,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2024-10-13 05:57:25,024 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 47 states have (on average 3.0851063829787235) internal successors, (145), 53 states have internal predecessors, (145), 19 states have call successors, (41), 8 states have call predecessors, (41), 14 states have return successors, (41), 12 states have call predecessors, (41), 19 states have call successors, (41) Word has length 126 [2024-10-13 05:57:25,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:57:25,025 INFO L225 Difference]: With dead ends: 396 [2024-10-13 05:57:25,025 INFO L226 Difference]: Without dead ends: 254 [2024-10-13 05:57:25,028 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3512 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=1906, Invalid=9224, Unknown=0, NotChecked=0, Total=11130 [2024-10-13 05:57:25,028 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 1097 mSDsluCounter, 1167 mSDsCounter, 0 mSdLazyCounter, 1572 mSolverCounterSat, 318 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1100 SdHoareTripleChecker+Valid, 1246 SdHoareTripleChecker+Invalid, 1890 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 318 IncrementalHoareTripleChecker+Valid, 1572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-13 05:57:25,029 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1100 Valid, 1246 Invalid, 1890 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [318 Valid, 1572 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-13 05:57:25,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2024-10-13 05:57:25,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 204. [2024-10-13 05:57:25,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 162 states have (on average 1.1975308641975309) internal successors, (194), 163 states have internal predecessors, (194), 25 states have call successors, (25), 16 states have call predecessors, (25), 16 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-13 05:57:25,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 244 transitions. [2024-10-13 05:57:25,047 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 244 transitions. Word has length 126 [2024-10-13 05:57:25,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:57:25,047 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 244 transitions. [2024-10-13 05:57:25,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 47 states have (on average 3.0851063829787235) internal successors, (145), 53 states have internal predecessors, (145), 19 states have call successors, (41), 8 states have call predecessors, (41), 14 states have return successors, (41), 12 states have call predecessors, (41), 19 states have call successors, (41) [2024-10-13 05:57:25,048 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 244 transitions. [2024-10-13 05:57:25,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-10-13 05:57:25,048 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:57:25,049 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 05:57:25,064 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-13 05:57:25,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-10-13 05:57:25,249 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:57:25,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:57:25,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1881137271, now seen corresponding path program 1 times [2024-10-13 05:57:25,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:57:25,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568825606] [2024-10-13 05:57:25,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:57:25,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:57:25,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:25,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-13 05:57:25,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:25,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-13 05:57:25,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:25,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 05:57:25,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:25,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 05:57:25,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:25,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 05:57:25,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:25,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 05:57:25,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:25,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 05:57:25,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:25,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 05:57:25,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:25,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 05:57:25,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:25,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 05:57:25,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:25,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 05:57:25,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:25,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 05:57:25,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:25,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-13 05:57:25,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:25,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-13 05:57:25,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:25,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 05:57:25,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:25,389 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-13 05:57:25,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:57:25,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568825606] [2024-10-13 05:57:25,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568825606] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:57:25,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:57:25,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 05:57:25,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728896402] [2024-10-13 05:57:25,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:57:25,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 05:57:25,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:57:25,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 05:57:25,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 05:57:25,392 INFO L87 Difference]: Start difference. First operand 204 states and 244 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-13 05:57:25,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:57:25,439 INFO L93 Difference]: Finished difference Result 354 states and 430 transitions. [2024-10-13 05:57:25,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 05:57:25,439 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 128 [2024-10-13 05:57:25,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:57:25,441 INFO L225 Difference]: With dead ends: 354 [2024-10-13 05:57:25,441 INFO L226 Difference]: Without dead ends: 208 [2024-10-13 05:57:25,442 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 33 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-13 05:57:25,442 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 0 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 629 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 05:57:25,443 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 629 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 05:57:25,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2024-10-13 05:57:25,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 205. [2024-10-13 05:57:25,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 163 states have (on average 1.196319018404908) internal successors, (195), 164 states have internal predecessors, (195), 25 states have call successors, (25), 16 states have call predecessors, (25), 16 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-13 05:57:25,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 245 transitions. [2024-10-13 05:57:25,462 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 245 transitions. Word has length 128 [2024-10-13 05:57:25,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:57:25,463 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 245 transitions. [2024-10-13 05:57:25,463 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-13 05:57:25,463 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 245 transitions. [2024-10-13 05:57:25,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-13 05:57:25,464 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:57:25,464 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 05:57:25,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-13 05:57:25,464 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:57:25,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:57:25,464 INFO L85 PathProgramCache]: Analyzing trace with hash -62169531, now seen corresponding path program 1 times [2024-10-13 05:57:25,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:57:25,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079758430] [2024-10-13 05:57:25,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:57:25,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:57:25,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 05:57:25,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [655573320] [2024-10-13 05:57:25,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:57:25,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 05:57:25,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 05:57:25,526 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 05:57:25,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-13 05:57:25,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:25,785 INFO L255 TraceCheckSpWp]: Trace formula consists of 514 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-10-13 05:57:25,789 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:57:25,800 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 19 treesize of output 1 [2024-10-13 05:57:25,808 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-13 05:57:25,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 51 [2024-10-13 05:57:25,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2024-10-13 05:57:25,831 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2024-10-13 05:57:25,899 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 05:57:25,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 35 [2024-10-13 05:57:25,949 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 66 [2024-10-13 05:57:26,083 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-13 05:57:26,083 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 05:57:26,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:57:26,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079758430] [2024-10-13 05:57:26,084 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-13 05:57:26,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [655573320] [2024-10-13 05:57:26,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [655573320] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:57:26,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:57:26,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 05:57:26,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989053271] [2024-10-13 05:57:26,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:57:26,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 05:57:26,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:57:26,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 05:57:26,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-13 05:57:26,085 INFO L87 Difference]: Start difference. First operand 205 states and 245 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-13 05:57:26,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:57:26,328 INFO L93 Difference]: Finished difference Result 353 states and 429 transitions. [2024-10-13 05:57:26,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 05:57:26,328 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 130 [2024-10-13 05:57:26,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:57:26,329 INFO L225 Difference]: With dead ends: 353 [2024-10-13 05:57:26,329 INFO L226 Difference]: Without dead ends: 206 [2024-10-13 05:57:26,330 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-13 05:57:26,330 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 172 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 05:57:26,330 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 351 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 05:57:26,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2024-10-13 05:57:26,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2024-10-13 05:57:26,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 164 states have (on average 1.1951219512195121) internal successors, (196), 165 states have internal predecessors, (196), 25 states have call successors, (25), 16 states have call predecessors, (25), 16 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-13 05:57:26,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 246 transitions. [2024-10-13 05:57:26,351 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 246 transitions. Word has length 130 [2024-10-13 05:57:26,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:57:26,352 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 246 transitions. [2024-10-13 05:57:26,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-13 05:57:26,352 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 246 transitions. [2024-10-13 05:57:26,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-13 05:57:26,353 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:57:26,353 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 05:57:26,369 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-13 05:57:26,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-10-13 05:57:26,554 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:57:26,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:57:26,554 INFO L85 PathProgramCache]: Analyzing trace with hash -39537277, now seen corresponding path program 1 times [2024-10-13 05:57:26,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:57:26,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948797116] [2024-10-13 05:57:26,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:57:26,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:57:26,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 05:57:26,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [221089780] [2024-10-13 05:57:26,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:57:26,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 05:57:26,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 05:57:26,640 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 05:57:26,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-13 05:57:26,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:26,980 INFO L255 TraceCheckSpWp]: Trace formula consists of 514 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-13 05:57:26,985 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:57:26,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 19 treesize of output 1 [2024-10-13 05:57:27,000 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 19 treesize of output 1 [2024-10-13 05:57:27,007 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-13 05:57:27,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 51 [2024-10-13 05:57:27,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2024-10-13 05:57:27,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2024-10-13 05:57:27,109 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 05:57:27,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 35 [2024-10-13 05:57:27,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 66 [2024-10-13 05:57:27,295 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 05:57:27,295 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 14 [2024-10-13 05:57:27,377 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-13 05:57:27,379 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 05:57:27,380 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 44 treesize of output 16 [2024-10-13 05:57:27,426 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-13 05:57:27,426 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 05:57:27,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:57:27,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948797116] [2024-10-13 05:57:27,426 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-13 05:57:27,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [221089780] [2024-10-13 05:57:27,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [221089780] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:57:27,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:57:27,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-13 05:57:27,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56795752] [2024-10-13 05:57:27,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:57:27,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 05:57:27,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:57:27,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 05:57:27,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-10-13 05:57:27,427 INFO L87 Difference]: Start difference. First operand 206 states and 246 transitions. Second operand has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-13 05:57:28,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:57:28,131 INFO L93 Difference]: Finished difference Result 476 states and 578 transitions. [2024-10-13 05:57:28,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-13 05:57:28,131 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 130 [2024-10-13 05:57:28,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:57:28,137 INFO L225 Difference]: With dead ends: 476 [2024-10-13 05:57:28,137 INFO L226 Difference]: Without dead ends: 328 [2024-10-13 05:57:28,138 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2024-10-13 05:57:28,138 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 383 mSDsluCounter, 823 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 383 SdHoareTripleChecker+Valid, 1010 SdHoareTripleChecker+Invalid, 554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 05:57:28,138 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [383 Valid, 1010 Invalid, 554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 05:57:28,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2024-10-13 05:57:28,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 215. [2024-10-13 05:57:28,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 173 states have (on average 1.2023121387283238) internal successors, (208), 174 states have internal predecessors, (208), 25 states have call successors, (25), 16 states have call predecessors, (25), 16 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-13 05:57:28,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 258 transitions. [2024-10-13 05:57:28,158 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 258 transitions. Word has length 130 [2024-10-13 05:57:28,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:57:28,159 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 258 transitions. [2024-10-13 05:57:28,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-13 05:57:28,159 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 258 transitions. [2024-10-13 05:57:28,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-13 05:57:28,161 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:57:28,161 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 05:57:28,176 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-13 05:57:28,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 05:57:28,362 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:57:28,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:57:28,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1728481019, now seen corresponding path program 1 times [2024-10-13 05:57:28,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:57:28,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791343330] [2024-10-13 05:57:28,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:57:28,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:57:28,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 05:57:28,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [206323242] [2024-10-13 05:57:28,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:57:28,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 05:57:28,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 05:57:28,413 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 05:57:28,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-13 05:57:28,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 05:57:28,751 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 05:57:28,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 05:57:29,074 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 05:57:29,075 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 05:57:29,075 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 05:57:29,096 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-13 05:57:29,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-13 05:57:29,281 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:57:29,370 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 05:57:29,371 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 05:57:29 BoogieIcfgContainer [2024-10-13 05:57:29,371 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 05:57:29,372 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 05:57:29,372 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 05:57:29,372 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 05:57:29,373 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:57:02" (3/4) ... [2024-10-13 05:57:29,374 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 05:57:29,375 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 05:57:29,375 INFO L158 Benchmark]: Toolchain (without parser) took 28104.38ms. Allocated memory was 188.7MB in the beginning and 652.2MB in the end (delta: 463.5MB). Free memory was 120.8MB in the beginning and 334.0MB in the end (delta: -213.1MB). Peak memory consumption was 252.1MB. Max. memory is 16.1GB. [2024-10-13 05:57:29,375 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 109.1MB. Free memory is still 81.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 05:57:29,376 INFO L158 Benchmark]: CACSL2BoogieTranslator took 286.25ms. Allocated memory is still 188.7MB. Free memory was 120.6MB in the beginning and 104.8MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-13 05:57:29,376 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.24ms. Allocated memory is still 188.7MB. Free memory was 104.8MB in the beginning and 100.4MB in the end (delta: 4.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 05:57:29,376 INFO L158 Benchmark]: Boogie Preprocessor took 86.05ms. Allocated memory is still 188.7MB. Free memory was 100.4MB in the beginning and 157.6MB in the end (delta: -57.2MB). Peak memory consumption was 12.4MB. Max. memory is 16.1GB. [2024-10-13 05:57:29,376 INFO L158 Benchmark]: RCFGBuilder took 628.21ms. Allocated memory is still 188.7MB. Free memory was 157.6MB in the beginning and 115.7MB in the end (delta: 41.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2024-10-13 05:57:29,377 INFO L158 Benchmark]: TraceAbstraction took 27036.20ms. Allocated memory was 188.7MB in the beginning and 652.2MB in the end (delta: 463.5MB). Free memory was 114.9MB in the beginning and 335.0MB in the end (delta: -220.1MB). Peak memory consumption was 246.0MB. Max. memory is 16.1GB. [2024-10-13 05:57:29,379 INFO L158 Benchmark]: Witness Printer took 3.05ms. Allocated memory is still 652.2MB. Free memory was 335.0MB in the beginning and 334.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 05:57:29,380 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.12ms. Allocated memory is still 109.1MB. Free memory is still 81.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 286.25ms. Allocated memory is still 188.7MB. Free memory was 120.6MB in the beginning and 104.8MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.24ms. Allocated memory is still 188.7MB. Free memory was 104.8MB in the beginning and 100.4MB in the end (delta: 4.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 86.05ms. Allocated memory is still 188.7MB. Free memory was 100.4MB in the beginning and 157.6MB in the end (delta: -57.2MB). Peak memory consumption was 12.4MB. Max. memory is 16.1GB. * RCFGBuilder took 628.21ms. Allocated memory is still 188.7MB. Free memory was 157.6MB in the beginning and 115.7MB in the end (delta: 41.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 27036.20ms. Allocated memory was 188.7MB in the beginning and 652.2MB in the end (delta: 463.5MB). Free memory was 114.9MB in the beginning and 335.0MB in the end (delta: -220.1MB). Peak memory consumption was 246.0MB. Max. memory is 16.1GB. * Witness Printer took 3.05ms. Allocated memory is still 652.2MB. Free memory was 335.0MB in the beginning and 334.0MB 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 97. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] float float_Array_0[1] = { 25.1 }; [L22-L24] float float_Array_0[1] = { 25.1 }; [L25-L27] signed char signed_char_Array_0[5] = { 25, 16, -10, -25, 0 }; [L25-L27] signed char signed_char_Array_0[5] = { 25, 16, -10, -25, 0 }; [L25-L27] signed char signed_char_Array_0[5] = { 25, 16, -10, -25, 0 }; [L25-L27] signed char signed_char_Array_0[5] = { 25, 16, -10, -25, 0 }; [L25-L27] signed char signed_char_Array_0[5] = { 25, 16, -10, -25, 0 }; [L25-L27] signed char signed_char_Array_0[5] = { 25, 16, -10, -25, 0 }; [L28-L30] signed long int signed_long_int_Array_0[2] = { -128, 256 }; [L28-L30] signed long int signed_long_int_Array_0[2] = { -128, 256 }; [L28-L30] signed long int signed_long_int_Array_0[2] = { -128, 256 }; [L31-L33] signed short int signed_short_int_Array_0[1] = { -16 }; [L31-L33] signed short int signed_short_int_Array_0[1] = { -16 }; [L34-L36] unsigned char unsigned_char_Array_0[2] = { 16, 8 }; [L34-L36] unsigned char unsigned_char_Array_0[2] = { 16, 8 }; [L34-L36] unsigned char unsigned_char_Array_0[2] = { 16, 8 }; [L37-L39] unsigned long int unsigned_long_int_Array_0[1] = { 2531521428 }; [L37-L39] unsigned long int unsigned_long_int_Array_0[1] = { 2531521428 }; [L40-L42] unsigned short int unsigned_short_int_Array_0[2] = { 100, 59049 }; [L40-L42] unsigned short int unsigned_short_int_Array_0[2] = { 100, 59049 }; [L40-L42] unsigned short int unsigned_short_int_Array_0[2] = { 100, 59049 }; [L101] isInitial = 1 [L102] FCALL initially() [L103] COND TRUE 1 [L104] FCALL updateLastVariables() [L105] CALL updateVariables() [L70] float_Array_0[0] = __VERIFIER_nondet_float() [L71] EXPR float_Array_0[0] [L71] EXPR float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L71] EXPR float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F [L71] EXPR float_Array_0[0] [L71] EXPR float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L71] EXPR (float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L71] EXPR (float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L71] CALL assume_abort_if_not((float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L71] RET assume_abort_if_not((float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L72] signed_char_Array_0[0] = __VERIFIER_nondet_char() [L73] EXPR signed_char_Array_0[0] VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L73] CALL assume_abort_if_not(signed_char_Array_0[0] >= 0) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L73] RET assume_abort_if_not(signed_char_Array_0[0] >= 0) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L74] EXPR signed_char_Array_0[0] VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L74] CALL assume_abort_if_not(signed_char_Array_0[0] <= 31) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L74] RET assume_abort_if_not(signed_char_Array_0[0] <= 31) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L75] signed_char_Array_0[1] = __VERIFIER_nondet_char() [L76] EXPR signed_char_Array_0[1] VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L76] CALL assume_abort_if_not(signed_char_Array_0[1] >= 0) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L76] RET assume_abort_if_not(signed_char_Array_0[1] >= 0) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L77] EXPR signed_char_Array_0[1] VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L77] CALL assume_abort_if_not(signed_char_Array_0[1] <= 63) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L77] RET assume_abort_if_not(signed_char_Array_0[1] <= 63) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L78] signed_char_Array_0[2] = __VERIFIER_nondet_char() [L79] EXPR signed_char_Array_0[2] VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L79] CALL assume_abort_if_not(signed_char_Array_0[2] >= -63) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L79] RET assume_abort_if_not(signed_char_Array_0[2] >= -63) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L80] EXPR signed_char_Array_0[2] VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L80] CALL assume_abort_if_not(signed_char_Array_0[2] <= 63) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L80] RET assume_abort_if_not(signed_char_Array_0[2] <= 63) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L81] unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L82] EXPR unsigned_char_Array_0[0] VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L82] CALL assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L82] RET assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L83] EXPR unsigned_char_Array_0[0] VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L83] CALL assume_abort_if_not(unsigned_char_Array_0[0] <= 254) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L83] RET assume_abort_if_not(unsigned_char_Array_0[0] <= 254) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L84] unsigned_long_int_Array_0[0] = __VERIFIER_nondet_ulong() [L85] EXPR unsigned_long_int_Array_0[0] VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L85] CALL assume_abort_if_not(unsigned_long_int_Array_0[0] >= 2147483647) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L85] RET assume_abort_if_not(unsigned_long_int_Array_0[0] >= 2147483647) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L86] EXPR unsigned_long_int_Array_0[0] VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L86] CALL assume_abort_if_not(unsigned_long_int_Array_0[0] <= 4294967295) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L86] RET assume_abort_if_not(unsigned_long_int_Array_0[0] <= 4294967295) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L87] unsigned_short_int_Array_0[0] = __VERIFIER_nondet_ushort() [L88] EXPR unsigned_short_int_Array_0[0] VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L88] CALL assume_abort_if_not(unsigned_short_int_Array_0[0] >= 0) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L88] RET assume_abort_if_not(unsigned_short_int_Array_0[0] >= 0) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L89] EXPR unsigned_short_int_Array_0[0] VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L89] CALL assume_abort_if_not(unsigned_short_int_Array_0[0] <= 32767) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L89] RET assume_abort_if_not(unsigned_short_int_Array_0[0] <= 32767) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L90] unsigned_short_int_Array_0[1] = __VERIFIER_nondet_ushort() [L91] EXPR unsigned_short_int_Array_0[1] VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L91] CALL assume_abort_if_not(unsigned_short_int_Array_0[1] >= 32767) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L91] RET assume_abort_if_not(unsigned_short_int_Array_0[1] >= 32767) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L92] EXPR unsigned_short_int_Array_0[1] VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L92] CALL assume_abort_if_not(unsigned_short_int_Array_0[1] <= 65535) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L92] RET assume_abort_if_not(unsigned_short_int_Array_0[1] <= 65535) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L105] RET updateVariables() [L106] CALL step() [L46] EXPR signed_char_Array_0[1] [L46] signed_long_int_Array_0[0] = signed_char_Array_0[1] [L47] EXPR signed_long_int_Array_0[0] [L47] signed_short_int_Array_0[0] = signed_long_int_Array_0[0] [L48] EXPR signed_long_int_Array_0[0] VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L48] EXPR ((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0]) [L48] EXPR signed_long_int_Array_0[0] [L48] EXPR ((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0]) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L48] signed long int stepLocal_0 = (((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0])); [L49] EXPR unsigned_short_int_Array_0[1] VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L49] COND FALSE !(unsigned_short_int_Array_0[1] <= stepLocal_0) [L52] EXPR signed_char_Array_0[2] [L52] signed_char_Array_0[3] = signed_char_Array_0[2] [L54] EXPR signed_short_int_Array_0[0] [L54] signed_long_int_Array_0[1] = signed_short_int_Array_0[0] [L55] EXPR unsigned_short_int_Array_0[1] [L55] EXPR unsigned_short_int_Array_0[0] [L55] EXPR signed_long_int_Array_0[1] [L55] EXPR signed_short_int_Array_0[0] VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L55] EXPR (unsigned_short_int_Array_0[1] - unsigned_short_int_Array_0[0]) ^ (signed_long_int_Array_0[1] * signed_short_int_Array_0[0]) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L55] COND FALSE !(((unsigned_short_int_Array_0[1] - unsigned_short_int_Array_0[0]) ^ (signed_long_int_Array_0[1] * signed_short_int_Array_0[0])) <= -64) [L58] EXPR unsigned_char_Array_0[0] [L58] unsigned_char_Array_0[1] = unsigned_char_Array_0[0] [L60] EXPR unsigned_char_Array_0[1] [L60] unsigned char stepLocal_1 = unsigned_char_Array_0[1]; [L61] EXPR float_Array_0[0] VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L61] COND FALSE !(2.75f > float_Array_0[0]) [L64] EXPR unsigned_long_int_Array_0[0] [L64] EXPR signed_long_int_Array_0[0] [L64] EXPR signed_char_Array_0[1] VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L64] EXPR ((signed_long_int_Array_0[0]) > (signed_char_Array_0[1])) ? (signed_long_int_Array_0[0]) : (signed_char_Array_0[1]) [L64] EXPR signed_char_Array_0[1] [L64] EXPR ((signed_long_int_Array_0[0]) > (signed_char_Array_0[1])) ? (signed_long_int_Array_0[0]) : (signed_char_Array_0[1]) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, stepLocal_1=0, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L64] COND TRUE (unsigned_long_int_Array_0[0] - ((((signed_long_int_Array_0[0]) > (signed_char_Array_0[1])) ? (signed_long_int_Array_0[0]) : (signed_char_Array_0[1])))) > stepLocal_1 [L65] EXPR signed_char_Array_0[1] VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L65] EXPR ((signed_char_Array_0[1]) < ((1 + 5))) ? (signed_char_Array_0[1]) : ((1 + 5)) [L65] EXPR signed_char_Array_0[1] [L65] EXPR ((signed_char_Array_0[1]) < ((1 + 5))) ? (signed_char_Array_0[1]) : ((1 + 5)) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L65] EXPR signed_char_Array_0[2] VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L65] EXPR ((((((signed_char_Array_0[1]) < ((1 + 5))) ? (signed_char_Array_0[1]) : ((1 + 5))))) < (signed_char_Array_0[2])) ? (((((signed_char_Array_0[1]) < ((1 + 5))) ? (signed_char_Array_0[1]) : ((1 + 5))))) : (signed_char_Array_0[2]) [L65] EXPR signed_char_Array_0[2] [L65] EXPR ((((((signed_char_Array_0[1]) < ((1 + 5))) ? (signed_char_Array_0[1]) : ((1 + 5))))) < (signed_char_Array_0[2])) ? (((((signed_char_Array_0[1]) < ((1 + 5))) ? (signed_char_Array_0[1]) : ((1 + 5))))) : (signed_char_Array_0[2]) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L65] signed_char_Array_0[4] = ((((((((signed_char_Array_0[1]) < ((1 + 5))) ? (signed_char_Array_0[1]) : ((1 + 5))))) < (signed_char_Array_0[2])) ? (((((signed_char_Array_0[1]) < ((1 + 5))) ? (signed_char_Array_0[1]) : ((1 + 5))))) : (signed_char_Array_0[2]))) [L106] RET step() [L107] CALL, EXPR property() [L97] EXPR unsigned_short_int_Array_0[1] [L97] EXPR unsigned_short_int_Array_0[0] [L97] EXPR signed_long_int_Array_0[1] [L97] EXPR signed_short_int_Array_0[0] VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L97] EXPR (unsigned_short_int_Array_0[1] - unsigned_short_int_Array_0[0]) ^ (signed_long_int_Array_0[1] * signed_short_int_Array_0[0]) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L97] EXPR (((unsigned_short_int_Array_0[1] - unsigned_short_int_Array_0[0]) ^ (signed_long_int_Array_0[1] * signed_short_int_Array_0[0])) <= -64) ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) [L97] EXPR unsigned_char_Array_0[1] [L97] EXPR unsigned_char_Array_0[0] [L97] EXPR (((unsigned_short_int_Array_0[1] - unsigned_short_int_Array_0[0]) ^ (signed_long_int_Array_0[1] * signed_short_int_Array_0[0])) <= -64) ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L97] EXPR ((((unsigned_short_int_Array_0[1] - unsigned_short_int_Array_0[0]) ^ (signed_long_int_Array_0[1] * signed_short_int_Array_0[0])) <= -64) ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0]))) && ((unsigned_short_int_Array_0[1] <= ((((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0])))) ? (signed_char_Array_0[3] == ((signed char) ((signed_char_Array_0[1] - (1 + signed_char_Array_0[0])) + signed_char_Array_0[2]))) : (signed_char_Array_0[3] == ((signed char) signed_char_Array_0[2]))) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L97] EXPR ((((unsigned_short_int_Array_0[1] - unsigned_short_int_Array_0[0]) ^ (signed_long_int_Array_0[1] * signed_short_int_Array_0[0])) <= -64) ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0]))) && ((unsigned_short_int_Array_0[1] <= ((((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0])))) ? (signed_char_Array_0[3] == ((signed char) ((signed_char_Array_0[1] - (1 + signed_char_Array_0[0])) + signed_char_Array_0[2]))) : (signed_char_Array_0[3] == ((signed char) signed_char_Array_0[2]))) [L97] EXPR unsigned_short_int_Array_0[1] [L97] EXPR signed_long_int_Array_0[0] VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L97] EXPR ((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0]) [L97] EXPR signed_long_int_Array_0[0] [L97] EXPR ((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0]) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L97] EXPR (unsigned_short_int_Array_0[1] <= ((((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0])))) ? (signed_char_Array_0[3] == ((signed char) ((signed_char_Array_0[1] - (1 + signed_char_Array_0[0])) + signed_char_Array_0[2]))) : (signed_char_Array_0[3] == ((signed char) signed_char_Array_0[2])) [L97] EXPR signed_char_Array_0[3] [L97] EXPR signed_char_Array_0[2] [L97] EXPR (unsigned_short_int_Array_0[1] <= ((((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0])))) ? (signed_char_Array_0[3] == ((signed char) ((signed_char_Array_0[1] - (1 + signed_char_Array_0[0])) + signed_char_Array_0[2]))) : (signed_char_Array_0[3] == ((signed char) signed_char_Array_0[2])) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L97] EXPR ((((unsigned_short_int_Array_0[1] - unsigned_short_int_Array_0[0]) ^ (signed_long_int_Array_0[1] * signed_short_int_Array_0[0])) <= -64) ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0]))) && ((unsigned_short_int_Array_0[1] <= ((((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0])))) ? (signed_char_Array_0[3] == ((signed char) ((signed_char_Array_0[1] - (1 + signed_char_Array_0[0])) + signed_char_Array_0[2]))) : (signed_char_Array_0[3] == ((signed char) signed_char_Array_0[2]))) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L97] EXPR (((((unsigned_short_int_Array_0[1] - unsigned_short_int_Array_0[0]) ^ (signed_long_int_Array_0[1] * signed_short_int_Array_0[0])) <= -64) ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0]))) && ((unsigned_short_int_Array_0[1] <= ((((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0])))) ? (signed_char_Array_0[3] == ((signed char) ((signed_char_Array_0[1] - (1 + signed_char_Array_0[0])) + signed_char_Array_0[2]))) : (signed_char_Array_0[3] == ((signed char) signed_char_Array_0[2])))) && ((2.75f > float_Array_0[0]) ? (signed_char_Array_0[4] == ((signed char) (signed_char_Array_0[2] + signed_char_Array_0[1]))) : (((unsigned_long_int_Array_0[0] - ((((signed_long_int_Array_0[0]) > (signed_char_Array_0[1])) ? (signed_long_int_Array_0[0]) : (signed_char_Array_0[1])))) > unsigned_char_Array_0[1]) ? (signed_char_Array_0[4] == ((signed char) ((((((((signed_char_Array_0[1]) < ((1 + 5))) ? (signed_char_Array_0[1]) : ((1 + 5))))) < (signed_char_Array_0[2])) ? (((((signed_char_Array_0[1]) < ((1 + 5))) ? (signed_char_Array_0[1]) : ((1 + 5))))) : (signed_char_Array_0[2]))))) : 1)) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L97] EXPR (((((unsigned_short_int_Array_0[1] - unsigned_short_int_Array_0[0]) ^ (signed_long_int_Array_0[1] * signed_short_int_Array_0[0])) <= -64) ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0]))) && ((unsigned_short_int_Array_0[1] <= ((((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0])))) ? (signed_char_Array_0[3] == ((signed char) ((signed_char_Array_0[1] - (1 + signed_char_Array_0[0])) + signed_char_Array_0[2]))) : (signed_char_Array_0[3] == ((signed char) signed_char_Array_0[2])))) && ((2.75f > float_Array_0[0]) ? (signed_char_Array_0[4] == ((signed char) (signed_char_Array_0[2] + signed_char_Array_0[1]))) : (((unsigned_long_int_Array_0[0] - ((((signed_long_int_Array_0[0]) > (signed_char_Array_0[1])) ? (signed_long_int_Array_0[0]) : (signed_char_Array_0[1])))) > unsigned_char_Array_0[1]) ? (signed_char_Array_0[4] == ((signed char) ((((((((signed_char_Array_0[1]) < ((1 + 5))) ? (signed_char_Array_0[1]) : ((1 + 5))))) < (signed_char_Array_0[2])) ? (((((signed_char_Array_0[1]) < ((1 + 5))) ? (signed_char_Array_0[1]) : ((1 + 5))))) : (signed_char_Array_0[2]))))) : 1)) [L97] EXPR float_Array_0[0] VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L97] EXPR (2.75f > float_Array_0[0]) ? (signed_char_Array_0[4] == ((signed char) (signed_char_Array_0[2] + signed_char_Array_0[1]))) : (((unsigned_long_int_Array_0[0] - ((((signed_long_int_Array_0[0]) > (signed_char_Array_0[1])) ? (signed_long_int_Array_0[0]) : (signed_char_Array_0[1])))) > unsigned_char_Array_0[1]) ? (signed_char_Array_0[4] == ((signed char) ((((((((signed_char_Array_0[1]) < ((1 + 5))) ? (signed_char_Array_0[1]) : ((1 + 5))))) < (signed_char_Array_0[2])) ? (((((signed_char_Array_0[1]) < ((1 + 5))) ? (signed_char_Array_0[1]) : ((1 + 5))))) : (signed_char_Array_0[2]))))) : 1) [L97] EXPR signed_char_Array_0[4] [L97] EXPR signed_char_Array_0[2] [L97] EXPR signed_char_Array_0[1] [L97] EXPR (2.75f > float_Array_0[0]) ? (signed_char_Array_0[4] == ((signed char) (signed_char_Array_0[2] + signed_char_Array_0[1]))) : (((unsigned_long_int_Array_0[0] - ((((signed_long_int_Array_0[0]) > (signed_char_Array_0[1])) ? (signed_long_int_Array_0[0]) : (signed_char_Array_0[1])))) > unsigned_char_Array_0[1]) ? (signed_char_Array_0[4] == ((signed char) ((((((((signed_char_Array_0[1]) < ((1 + 5))) ? (signed_char_Array_0[1]) : ((1 + 5))))) < (signed_char_Array_0[2])) ? (((((signed_char_Array_0[1]) < ((1 + 5))) ? (signed_char_Array_0[1]) : ((1 + 5))))) : (signed_char_Array_0[2]))))) : 1) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L97] EXPR (((((unsigned_short_int_Array_0[1] - unsigned_short_int_Array_0[0]) ^ (signed_long_int_Array_0[1] * signed_short_int_Array_0[0])) <= -64) ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0]))) && ((unsigned_short_int_Array_0[1] <= ((((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0])))) ? (signed_char_Array_0[3] == ((signed char) ((signed_char_Array_0[1] - (1 + signed_char_Array_0[0])) + signed_char_Array_0[2]))) : (signed_char_Array_0[3] == ((signed char) signed_char_Array_0[2])))) && ((2.75f > float_Array_0[0]) ? (signed_char_Array_0[4] == ((signed char) (signed_char_Array_0[2] + signed_char_Array_0[1]))) : (((unsigned_long_int_Array_0[0] - ((((signed_long_int_Array_0[0]) > (signed_char_Array_0[1])) ? (signed_long_int_Array_0[0]) : (signed_char_Array_0[1])))) > unsigned_char_Array_0[1]) ? (signed_char_Array_0[4] == ((signed char) ((((((((signed_char_Array_0[1]) < ((1 + 5))) ? (signed_char_Array_0[1]) : ((1 + 5))))) < (signed_char_Array_0[2])) ? (((((signed_char_Array_0[1]) < ((1 + 5))) ? (signed_char_Array_0[1]) : ((1 + 5))))) : (signed_char_Array_0[2]))))) : 1)) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L97] EXPR ((((((unsigned_short_int_Array_0[1] - unsigned_short_int_Array_0[0]) ^ (signed_long_int_Array_0[1] * signed_short_int_Array_0[0])) <= -64) ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0]))) && ((unsigned_short_int_Array_0[1] <= ((((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0])))) ? (signed_char_Array_0[3] == ((signed char) ((signed_char_Array_0[1] - (1 + signed_char_Array_0[0])) + signed_char_Array_0[2]))) : (signed_char_Array_0[3] == ((signed char) signed_char_Array_0[2])))) && ((2.75f > float_Array_0[0]) ? (signed_char_Array_0[4] == ((signed char) (signed_char_Array_0[2] + signed_char_Array_0[1]))) : (((unsigned_long_int_Array_0[0] - ((((signed_long_int_Array_0[0]) > (signed_char_Array_0[1])) ? (signed_long_int_Array_0[0]) : (signed_char_Array_0[1])))) > unsigned_char_Array_0[1]) ? (signed_char_Array_0[4] == ((signed char) ((((((((signed_char_Array_0[1]) < ((1 + 5))) ? (signed_char_Array_0[1]) : ((1 + 5))))) < (signed_char_Array_0[2])) ? (((((signed_char_Array_0[1]) < ((1 + 5))) ? (signed_char_Array_0[1]) : ((1 + 5))))) : (signed_char_Array_0[2]))))) : 1))) && (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1])) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L97] EXPR ((((((unsigned_short_int_Array_0[1] - unsigned_short_int_Array_0[0]) ^ (signed_long_int_Array_0[1] * signed_short_int_Array_0[0])) <= -64) ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0]))) && ((unsigned_short_int_Array_0[1] <= ((((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0])))) ? (signed_char_Array_0[3] == ((signed char) ((signed_char_Array_0[1] - (1 + signed_char_Array_0[0])) + signed_char_Array_0[2]))) : (signed_char_Array_0[3] == ((signed char) signed_char_Array_0[2])))) && ((2.75f > float_Array_0[0]) ? (signed_char_Array_0[4] == ((signed char) (signed_char_Array_0[2] + signed_char_Array_0[1]))) : (((unsigned_long_int_Array_0[0] - ((((signed_long_int_Array_0[0]) > (signed_char_Array_0[1])) ? (signed_long_int_Array_0[0]) : (signed_char_Array_0[1])))) > unsigned_char_Array_0[1]) ? (signed_char_Array_0[4] == ((signed char) ((((((((signed_char_Array_0[1]) < ((1 + 5))) ? (signed_char_Array_0[1]) : ((1 + 5))))) < (signed_char_Array_0[2])) ? (((((signed_char_Array_0[1]) < ((1 + 5))) ? (signed_char_Array_0[1]) : ((1 + 5))))) : (signed_char_Array_0[2]))))) : 1))) && (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1])) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L97] EXPR (((((((unsigned_short_int_Array_0[1] - unsigned_short_int_Array_0[0]) ^ (signed_long_int_Array_0[1] * signed_short_int_Array_0[0])) <= -64) ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0]))) && ((unsigned_short_int_Array_0[1] <= ((((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0])))) ? (signed_char_Array_0[3] == ((signed char) ((signed_char_Array_0[1] - (1 + signed_char_Array_0[0])) + signed_char_Array_0[2]))) : (signed_char_Array_0[3] == ((signed char) signed_char_Array_0[2])))) && ((2.75f > float_Array_0[0]) ? (signed_char_Array_0[4] == ((signed char) (signed_char_Array_0[2] + signed_char_Array_0[1]))) : (((unsigned_long_int_Array_0[0] - ((((signed_long_int_Array_0[0]) > (signed_char_Array_0[1])) ? (signed_long_int_Array_0[0]) : (signed_char_Array_0[1])))) > unsigned_char_Array_0[1]) ? (signed_char_Array_0[4] == ((signed char) ((((((((signed_char_Array_0[1]) < ((1 + 5))) ? (signed_char_Array_0[1]) : ((1 + 5))))) < (signed_char_Array_0[2])) ? (((((signed_char_Array_0[1]) < ((1 + 5))) ? (signed_char_Array_0[1]) : ((1 + 5))))) : (signed_char_Array_0[2]))))) : 1))) && (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1]))) && (signed_long_int_Array_0[1] == ((signed long int) signed_short_int_Array_0[0])) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L97] EXPR (((((((unsigned_short_int_Array_0[1] - unsigned_short_int_Array_0[0]) ^ (signed_long_int_Array_0[1] * signed_short_int_Array_0[0])) <= -64) ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0]))) && ((unsigned_short_int_Array_0[1] <= ((((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0])))) ? (signed_char_Array_0[3] == ((signed char) ((signed_char_Array_0[1] - (1 + signed_char_Array_0[0])) + signed_char_Array_0[2]))) : (signed_char_Array_0[3] == ((signed char) signed_char_Array_0[2])))) && ((2.75f > float_Array_0[0]) ? (signed_char_Array_0[4] == ((signed char) (signed_char_Array_0[2] + signed_char_Array_0[1]))) : (((unsigned_long_int_Array_0[0] - ((((signed_long_int_Array_0[0]) > (signed_char_Array_0[1])) ? (signed_long_int_Array_0[0]) : (signed_char_Array_0[1])))) > unsigned_char_Array_0[1]) ? (signed_char_Array_0[4] == ((signed char) ((((((((signed_char_Array_0[1]) < ((1 + 5))) ? (signed_char_Array_0[1]) : ((1 + 5))))) < (signed_char_Array_0[2])) ? (((((signed_char_Array_0[1]) < ((1 + 5))) ? (signed_char_Array_0[1]) : ((1 + 5))))) : (signed_char_Array_0[2]))))) : 1))) && (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1]))) && (signed_long_int_Array_0[1] == ((signed long int) signed_short_int_Array_0[0])) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L97] EXPR ((((((((unsigned_short_int_Array_0[1] - unsigned_short_int_Array_0[0]) ^ (signed_long_int_Array_0[1] * signed_short_int_Array_0[0])) <= -64) ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0]))) && ((unsigned_short_int_Array_0[1] <= ((((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0])))) ? (signed_char_Array_0[3] == ((signed char) ((signed_char_Array_0[1] - (1 + signed_char_Array_0[0])) + signed_char_Array_0[2]))) : (signed_char_Array_0[3] == ((signed char) signed_char_Array_0[2])))) && ((2.75f > float_Array_0[0]) ? (signed_char_Array_0[4] == ((signed char) (signed_char_Array_0[2] + signed_char_Array_0[1]))) : (((unsigned_long_int_Array_0[0] - ((((signed_long_int_Array_0[0]) > (signed_char_Array_0[1])) ? (signed_long_int_Array_0[0]) : (signed_char_Array_0[1])))) > unsigned_char_Array_0[1]) ? (signed_char_Array_0[4] == ((signed char) ((((((((signed_char_Array_0[1]) < ((1 + 5))) ? (signed_char_Array_0[1]) : ((1 + 5))))) < (signed_char_Array_0[2])) ? (((((signed_char_Array_0[1]) < ((1 + 5))) ? (signed_char_Array_0[1]) : ((1 + 5))))) : (signed_char_Array_0[2]))))) : 1))) && (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1]))) && (signed_long_int_Array_0[1] == ((signed long int) signed_short_int_Array_0[0]))) && (signed_short_int_Array_0[0] == ((signed short int) signed_long_int_Array_0[0])) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L97] EXPR ((((((((unsigned_short_int_Array_0[1] - unsigned_short_int_Array_0[0]) ^ (signed_long_int_Array_0[1] * signed_short_int_Array_0[0])) <= -64) ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0]))) && ((unsigned_short_int_Array_0[1] <= ((((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0])))) ? (signed_char_Array_0[3] == ((signed char) ((signed_char_Array_0[1] - (1 + signed_char_Array_0[0])) + signed_char_Array_0[2]))) : (signed_char_Array_0[3] == ((signed char) signed_char_Array_0[2])))) && ((2.75f > float_Array_0[0]) ? (signed_char_Array_0[4] == ((signed char) (signed_char_Array_0[2] + signed_char_Array_0[1]))) : (((unsigned_long_int_Array_0[0] - ((((signed_long_int_Array_0[0]) > (signed_char_Array_0[1])) ? (signed_long_int_Array_0[0]) : (signed_char_Array_0[1])))) > unsigned_char_Array_0[1]) ? (signed_char_Array_0[4] == ((signed char) ((((((((signed_char_Array_0[1]) < ((1 + 5))) ? (signed_char_Array_0[1]) : ((1 + 5))))) < (signed_char_Array_0[2])) ? (((((signed_char_Array_0[1]) < ((1 + 5))) ? (signed_char_Array_0[1]) : ((1 + 5))))) : (signed_char_Array_0[2]))))) : 1))) && (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1]))) && (signed_long_int_Array_0[1] == ((signed long int) signed_short_int_Array_0[0]))) && (signed_short_int_Array_0[0] == ((signed short int) signed_long_int_Array_0[0])) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L97-L98] return ((((((((unsigned_short_int_Array_0[1] - unsigned_short_int_Array_0[0]) ^ (signed_long_int_Array_0[1] * signed_short_int_Array_0[0])) <= -64) ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0]))) && ((unsigned_short_int_Array_0[1] <= ((((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0])))) ? (signed_char_Array_0[3] == ((signed char) ((signed_char_Array_0[1] - (1 + signed_char_Array_0[0])) + signed_char_Array_0[2]))) : (signed_char_Array_0[3] == ((signed char) signed_char_Array_0[2])))) && ((2.75f > float_Array_0[0]) ? (signed_char_Array_0[4] == ((signed char) (signed_char_Array_0[2] + signed_char_Array_0[1]))) : (((unsigned_long_int_Array_0[0] - ((((signed_long_int_Array_0[0]) > (signed_char_Array_0[1])) ? (signed_long_int_Array_0[0]) : (signed_char_Array_0[1])))) > unsigned_char_Array_0[1]) ? (signed_char_Array_0[4] == ((signed char) ((((((((signed_char_Array_0[1]) < ((1 + 5))) ? (signed_char_Array_0[1]) : ((1 + 5))))) < (signed_char_Array_0[2])) ? (((((signed_char_Array_0[1]) < ((1 + 5))) ? (signed_char_Array_0[1]) : ((1 + 5))))) : (signed_char_Array_0[2]))))) : 1))) && (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1]))) && (signed_long_int_Array_0[1] == ((signed long int) signed_short_int_Array_0[0]))) && (signed_short_int_Array_0[0] == ((signed short int) signed_long_int_Array_0[0])) ; [L107] RET, EXPR property() [L107] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] [L19] reach_error() VAL [float_Array_0={4:0}, isInitial=1, signed_char_Array_0={5:0}, signed_long_int_Array_0={6:0}, signed_short_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_long_int_Array_0={9:0}, unsigned_short_int_Array_0={10:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 98 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 26.9s, OverallIterations: 18, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3210 SdHoareTripleChecker+Valid, 3.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3201 mSDsluCounter, 9938 SdHoareTripleChecker+Invalid, 3.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7653 mSDsCounter, 678 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4592 IncrementalHoareTripleChecker+Invalid, 5270 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 678 mSolverCounterUnsat, 2285 mSDtfsCounter, 4592 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2172 GetRequests, 1900 SyntacticMatches, 3 SemanticMatches, 269 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4167 ImplicationChecksByTransitivity, 5.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=306occurred in iteration=7, InterpolantAutomatonStates: 177, 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, 17 MinimizatonAttempts, 282 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 15.2s InterpolantComputationTime, 3238 NumberOfCodeBlocks, 3238 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 3309 ConstructedInterpolants, 1 QuantifiedInterpolants, 29386 SizeOfPredicates, 83 NumberOfNonLiveVariables, 3471 ConjunctsInSsa, 254 ConjunctsInUnsatCore, 27 InterpolantComputations, 14 PerfectInterpolantSequences, 10749/11340 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-13 05:57:29,437 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-a_file-37.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 90de0053d184a453dc3a33f57409c1c246f48963f5fd9431c484b6f29206cf7b --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 05:57:31,262 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 05:57:31,311 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-13 05:57:31,314 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 05:57:31,314 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 05:57:31,330 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 05:57:31,331 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 05:57:31,332 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 05:57:31,332 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 05:57:31,332 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 05:57:31,332 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 05:57:31,333 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 05:57:31,333 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 05:57:31,333 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 05:57:31,334 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 05:57:31,334 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 05:57:31,334 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 05:57:31,334 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 05:57:31,335 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 05:57:31,335 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 05:57:31,335 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 05:57:31,338 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 05:57:31,338 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 05:57:31,338 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 05:57:31,338 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 05:57:31,339 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 05:57:31,339 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 05:57:31,339 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 05:57:31,339 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 05:57:31,339 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 05:57:31,340 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 05:57:31,340 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 05:57:31,340 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 05:57:31,340 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 05:57:31,340 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 05:57:31,341 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 05:57:31,341 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 05:57:31,341 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 05:57:31,342 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 05:57:31,342 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 05:57:31,342 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 05:57:31,345 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 05:57:31,346 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 05:57:31,346 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 05:57:31,346 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 05:57:31,346 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 -> 90de0053d184a453dc3a33f57409c1c246f48963f5fd9431c484b6f29206cf7b [2024-10-13 05:57:31,631 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 05:57:31,651 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 05:57:31,653 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 05:57:31,654 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 05:57:31,655 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 05:57:31,656 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-37.i [2024-10-13 05:57:32,917 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 05:57:33,101 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 05:57:33,101 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-37.i [2024-10-13 05:57:33,114 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a135146f/4a03a6829f1f45948c4e5b026252ddb6/FLAG739b77ce9 [2024-10-13 05:57:33,128 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a135146f/4a03a6829f1f45948c4e5b026252ddb6 [2024-10-13 05:57:33,130 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 05:57:33,131 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 05:57:33,133 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 05:57:33,133 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 05:57:33,137 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 05:57:33,137 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 05:57:33" (1/1) ... [2024-10-13 05:57:33,139 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c4126 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:57:33, skipping insertion in model container [2024-10-13 05:57:33,139 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 05:57:33" (1/1) ... [2024-10-13 05:57:33,160 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 05:57:33,301 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-a_file-37.i[916,929] [2024-10-13 05:57:33,366 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 05:57:33,378 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 05:57:33,387 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-a_file-37.i[916,929] [2024-10-13 05:57:33,415 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 05:57:33,435 INFO L204 MainTranslator]: Completed translation [2024-10-13 05:57:33,436 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:57:33 WrapperNode [2024-10-13 05:57:33,436 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 05:57:33,437 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 05:57:33,437 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 05:57:33,437 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 05:57:33,442 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:57:33" (1/1) ... [2024-10-13 05:57:33,459 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:57:33" (1/1) ... [2024-10-13 05:57:33,511 INFO L138 Inliner]: procedures = 36, calls = 157, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 453 [2024-10-13 05:57:33,513 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 05:57:33,514 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 05:57:33,514 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 05:57:33,514 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 05:57:33,522 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:57:33" (1/1) ... [2024-10-13 05:57:33,522 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:57:33" (1/1) ... [2024-10-13 05:57:33,527 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:57:33" (1/1) ... [2024-10-13 05:57:33,550 INFO L175 MemorySlicer]: Split 124 memory accesses to 8 slices as follows [2, 8, 52, 20, 7, 15, 6, 14]. 42 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 1, 5, 2, 1, 2, 1, 2]. The 17 writes are split as follows [0, 1, 7, 2, 1, 3, 1, 2]. [2024-10-13 05:57:33,554 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:57:33" (1/1) ... [2024-10-13 05:57:33,554 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:57:33" (1/1) ... [2024-10-13 05:57:33,579 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:57:33" (1/1) ... [2024-10-13 05:57:33,588 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:57:33" (1/1) ... [2024-10-13 05:57:33,592 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:57:33" (1/1) ... [2024-10-13 05:57:33,598 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:57:33" (1/1) ... [2024-10-13 05:57:33,610 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 05:57:33,615 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 05:57:33,615 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 05:57:33,615 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 05:57:33,616 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:57:33" (1/1) ... [2024-10-13 05:57:33,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 05:57:33,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 05:57:33,646 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-13 05:57:33,652 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-13 05:57:33,702 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 05:57:33,702 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-13 05:57:33,702 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-13 05:57:33,702 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-13 05:57:33,703 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-10-13 05:57:33,704 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-10-13 05:57:33,704 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-10-13 05:57:33,704 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2024-10-13 05:57:33,704 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7 [2024-10-13 05:57:33,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-10-13 05:57:33,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-10-13 05:57:33,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-10-13 05:57:33,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-10-13 05:57:33,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-10-13 05:57:33,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2024-10-13 05:57:33,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2024-10-13 05:57:33,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#7 [2024-10-13 05:57:33,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 05:57:33,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-13 05:57:33,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-13 05:57:33,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-10-13 05:57:33,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-10-13 05:57:33,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-10-13 05:57:33,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2024-10-13 05:57:33,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2024-10-13 05:57:33,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-10-13 05:57:33,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-10-13 05:57:33,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-10-13 05:57:33,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-10-13 05:57:33,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-10-13 05:57:33,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2024-10-13 05:57:33,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2024-10-13 05:57:33,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#7 [2024-10-13 05:57:33,709 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-10-13 05:57:33,709 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-10-13 05:57:33,709 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-10-13 05:57:33,709 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-10-13 05:57:33,709 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-10-13 05:57:33,709 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2024-10-13 05:57:33,709 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#6 [2024-10-13 05:57:33,710 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#7 [2024-10-13 05:57:33,710 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-13 05:57:33,710 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-13 05:57:33,710 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-10-13 05:57:33,710 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-10-13 05:57:33,710 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-10-13 05:57:33,710 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2024-10-13 05:57:33,711 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2024-10-13 05:57:33,711 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#7 [2024-10-13 05:57:33,711 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-10-13 05:57:33,712 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-10-13 05:57:33,712 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-10-13 05:57:33,712 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-10-13 05:57:33,712 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2024-10-13 05:57:33,712 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2024-10-13 05:57:33,712 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#6 [2024-10-13 05:57:33,712 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#7 [2024-10-13 05:57:33,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-10-13 05:57:33,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-10-13 05:57:33,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-10-13 05:57:33,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-10-13 05:57:33,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2024-10-13 05:57:33,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2024-10-13 05:57:33,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#6 [2024-10-13 05:57:33,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#7 [2024-10-13 05:57:33,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-10-13 05:57:33,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-10-13 05:57:33,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-10-13 05:57:33,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-10-13 05:57:33,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-10-13 05:57:33,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2024-10-13 05:57:33,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#6 [2024-10-13 05:57:33,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#7 [2024-10-13 05:57:33,716 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 05:57:33,716 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 05:57:33,716 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 05:57:33,716 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 05:57:33,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-10-13 05:57:33,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-10-13 05:57:33,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-10-13 05:57:33,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-10-13 05:57:33,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-10-13 05:57:33,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-10-13 05:57:33,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2024-10-13 05:57:33,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7 [2024-10-13 05:57:33,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-10-13 05:57:33,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-10-13 05:57:33,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-10-13 05:57:33,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-10-13 05:57:33,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2024-10-13 05:57:33,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2024-10-13 05:57:33,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#6 [2024-10-13 05:57:33,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#7 [2024-10-13 05:57:33,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-13 05:57:33,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-13 05:57:33,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-10-13 05:57:33,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-10-13 05:57:33,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-10-13 05:57:33,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2024-10-13 05:57:33,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2024-10-13 05:57:33,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#7 [2024-10-13 05:57:33,887 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 05:57:33,888 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 05:57:34,373 INFO L? ?]: Removed 114 outVars from TransFormulas that were not future-live. [2024-10-13 05:57:34,373 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 05:57:34,400 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 05:57:34,400 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 05:57:34,400 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:57:34 BoogieIcfgContainer [2024-10-13 05:57:34,400 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 05:57:34,402 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 05:57:34,402 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 05:57:34,405 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 05:57:34,405 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 05:57:33" (1/3) ... [2024-10-13 05:57:34,406 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22021950 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 05:57:34, skipping insertion in model container [2024-10-13 05:57:34,406 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:57:33" (2/3) ... [2024-10-13 05:57:34,406 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22021950 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 05:57:34, skipping insertion in model container [2024-10-13 05:57:34,407 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:57:34" (3/3) ... [2024-10-13 05:57:34,407 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-37.i [2024-10-13 05:57:34,420 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 05:57:34,421 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 05:57:34,471 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 05:57:34,490 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;@4e91834c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 05:57:34,490 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 05:57:34,493 INFO L276 IsEmpty]: Start isEmpty. Operand has 90 states, 72 states have (on average 1.4305555555555556) internal successors, (103), 73 states have internal predecessors, (103), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-13 05:57:34,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-13 05:57:34,503 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:57:34,504 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 05:57:34,505 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:57:34,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:57:34,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1753225376, now seen corresponding path program 1 times [2024-10-13 05:57:34,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 05:57:34,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [802133379] [2024-10-13 05:57:34,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:57:34,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-13 05:57:34,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 05:57:34,525 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-13 05:57:34,526 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-13 05:57:34,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:34,790 INFO L255 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 05:57:34,797 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:57:34,831 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 220 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2024-10-13 05:57:34,832 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 05:57:34,832 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 05:57:34,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [802133379] [2024-10-13 05:57:34,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [802133379] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:57:34,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:57:34,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 05:57:34,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878377807] [2024-10-13 05:57:34,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:57:34,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 05:57:34,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 05:57:34,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 05:57:34,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 05:57:34,866 INFO L87 Difference]: Start difference. First operand has 90 states, 72 states have (on average 1.4305555555555556) internal successors, (103), 73 states have internal predecessors, (103), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-13 05:57:34,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:57:34,906 INFO L93 Difference]: Finished difference Result 177 states and 279 transitions. [2024-10-13 05:57:34,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 05:57:34,909 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 117 [2024-10-13 05:57:34,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:57:34,917 INFO L225 Difference]: With dead ends: 177 [2024-10-13 05:57:34,917 INFO L226 Difference]: Without dead ends: 88 [2024-10-13 05:57:34,921 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 116 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-13 05:57:34,924 INFO L432 NwaCegarLoop]: 124 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, 124 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-13 05:57:34,925 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 124 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 05:57:34,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-10-13 05:57:34,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-10-13 05:57:34,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 71 states have (on average 1.380281690140845) internal successors, (98), 71 states have internal predecessors, (98), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-13 05:57:34,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 128 transitions. [2024-10-13 05:57:34,977 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 128 transitions. Word has length 117 [2024-10-13 05:57:34,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:57:34,977 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 128 transitions. [2024-10-13 05:57:34,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-13 05:57:34,978 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 128 transitions. [2024-10-13 05:57:34,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-13 05:57:34,981 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:57:34,981 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 05:57:34,992 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-13 05:57:35,184 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-13 05:57:35,185 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:57:35,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:57:35,186 INFO L85 PathProgramCache]: Analyzing trace with hash 396753538, now seen corresponding path program 1 times [2024-10-13 05:57:35,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 05:57:35,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2126124685] [2024-10-13 05:57:35,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:57:35,187 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-13 05:57:35,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 05:57:35,190 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-13 05:57:35,191 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-13 05:57:35,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:35,429 INFO L255 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 05:57:35,435 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:57:35,482 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-13 05:57:35,482 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 05:57:35,482 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 05:57:35,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2126124685] [2024-10-13 05:57:35,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2126124685] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:57:35,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:57:35,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 05:57:35,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105764130] [2024-10-13 05:57:35,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:57:35,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 05:57:35,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 05:57:35,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 05:57:35,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 05:57:35,487 INFO L87 Difference]: Start difference. First operand 88 states and 128 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-13 05:57:35,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:57:35,552 INFO L93 Difference]: Finished difference Result 180 states and 262 transitions. [2024-10-13 05:57:35,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 05:57:35,553 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 117 [2024-10-13 05:57:35,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:57:35,554 INFO L225 Difference]: With dead ends: 180 [2024-10-13 05:57:35,554 INFO L226 Difference]: Without dead ends: 93 [2024-10-13 05:57:35,555 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 113 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-13 05:57:35,556 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 1 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 466 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-13 05:57:35,556 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 466 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 05:57:35,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-10-13 05:57:35,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2024-10-13 05:57:35,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 75 states have (on average 1.36) internal successors, (102), 75 states have internal predecessors, (102), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-13 05:57:35,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 132 transitions. [2024-10-13 05:57:35,566 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 132 transitions. Word has length 117 [2024-10-13 05:57:35,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:57:35,567 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 132 transitions. [2024-10-13 05:57:35,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-13 05:57:35,568 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 132 transitions. [2024-10-13 05:57:35,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-13 05:57:35,571 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:57:35,571 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 05:57:35,581 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-13 05:57:35,771 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-13 05:57:35,774 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:57:35,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:57:35,775 INFO L85 PathProgramCache]: Analyzing trace with hash -412593088, now seen corresponding path program 1 times [2024-10-13 05:57:35,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 05:57:35,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1936044481] [2024-10-13 05:57:35,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:57:35,776 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-13 05:57:35,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 05:57:35,779 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-13 05:57:35,780 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-13 05:57:35,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:35,998 INFO L255 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 05:57:36,003 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:57:36,042 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-13 05:57:36,042 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 05:57:36,042 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 05:57:36,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1936044481] [2024-10-13 05:57:36,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1936044481] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:57:36,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:57:36,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 05:57:36,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195991736] [2024-10-13 05:57:36,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:57:36,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 05:57:36,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 05:57:36,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 05:57:36,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 05:57:36,046 INFO L87 Difference]: Start difference. First operand 92 states and 132 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-13 05:57:36,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:57:36,136 INFO L93 Difference]: Finished difference Result 186 states and 267 transitions. [2024-10-13 05:57:36,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 05:57:36,140 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 117 [2024-10-13 05:57:36,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:57:36,141 INFO L225 Difference]: With dead ends: 186 [2024-10-13 05:57:36,141 INFO L226 Difference]: Without dead ends: 95 [2024-10-13 05:57:36,142 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 112 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-13 05:57:36,142 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 1 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 573 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.1s IncrementalHoareTripleChecker+Time [2024-10-13 05:57:36,145 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 573 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 05:57:36,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-10-13 05:57:36,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2024-10-13 05:57:36,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 77 states have (on average 1.3506493506493507) internal successors, (104), 77 states have internal predecessors, (104), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-13 05:57:36,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 134 transitions. [2024-10-13 05:57:36,160 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 134 transitions. Word has length 117 [2024-10-13 05:57:36,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:57:36,161 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 134 transitions. [2024-10-13 05:57:36,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-13 05:57:36,161 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 134 transitions. [2024-10-13 05:57:36,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-13 05:57:36,162 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:57:36,162 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 05:57:36,173 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-13 05:57:36,362 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-13 05:57:36,363 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:57:36,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:57:36,364 INFO L85 PathProgramCache]: Analyzing trace with hash -355334786, now seen corresponding path program 1 times [2024-10-13 05:57:36,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 05:57:36,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1652744933] [2024-10-13 05:57:36,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:57:36,365 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-13 05:57:36,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 05:57:36,367 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-13 05:57:36,368 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-13 05:57:36,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:36,567 INFO L255 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 05:57:36,569 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:57:36,604 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-13 05:57:36,604 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 05:57:36,604 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 05:57:36,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1652744933] [2024-10-13 05:57:36,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1652744933] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:57:36,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:57:36,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 05:57:36,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790182394] [2024-10-13 05:57:36,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:57:36,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 05:57:36,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 05:57:36,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 05:57:36,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-13 05:57:36,606 INFO L87 Difference]: Start difference. First operand 94 states and 134 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-13 05:57:36,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:57:36,729 INFO L93 Difference]: Finished difference Result 190 states and 271 transitions. [2024-10-13 05:57:36,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 05:57:36,729 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 117 [2024-10-13 05:57:36,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:57:36,730 INFO L225 Difference]: With dead ends: 190 [2024-10-13 05:57:36,730 INFO L226 Difference]: Without dead ends: 97 [2024-10-13 05:57:36,731 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 111 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-13 05:57:36,732 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 1 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 682 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-13 05:57:36,734 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 682 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 05:57:36,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-10-13 05:57:36,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2024-10-13 05:57:36,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 79 states have (on average 1.3417721518987342) internal successors, (106), 79 states have internal predecessors, (106), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-13 05:57:36,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 136 transitions. [2024-10-13 05:57:36,742 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 136 transitions. Word has length 117 [2024-10-13 05:57:36,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:57:36,743 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 136 transitions. [2024-10-13 05:57:36,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-13 05:57:36,743 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 136 transitions. [2024-10-13 05:57:36,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-13 05:57:36,746 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:57:36,746 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 05:57:36,756 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-13 05:57:36,946 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-13 05:57:36,947 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:57:36,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:57:36,947 INFO L85 PathProgramCache]: Analyzing trace with hash -355275204, now seen corresponding path program 1 times [2024-10-13 05:57:36,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 05:57:36,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [52204681] [2024-10-13 05:57:36,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:57:36,948 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-13 05:57:36,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 05:57:36,951 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-13 05:57:36,952 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-13 05:57:37,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:37,155 INFO L255 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-13 05:57:37,159 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:57:37,248 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 13 [2024-10-13 05:57:37,255 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 13 treesize of output 9 [2024-10-13 05:57:37,302 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 13 [2024-10-13 05:57:37,342 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 22 treesize of output 10 [2024-10-13 05:57:37,389 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 92 proven. 3 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-10-13 05:57:37,389 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 05:57:37,465 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-13 05:57:37,528 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 05:57:37,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [52204681] [2024-10-13 05:57:37,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [52204681] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 05:57:37,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [437788151] [2024-10-13 05:57:37,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:57:37,529 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-13 05:57:37,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-13 05:57:37,532 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-13 05:57:37,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2024-10-13 05:57:37,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:37,936 INFO L255 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-13 05:57:37,941 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:57:38,243 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 13 [2024-10-13 05:57:38,247 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 13 treesize of output 9 [2024-10-13 05:57:38,309 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 13 [2024-10-13 05:57:38,375 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 10 [2024-10-13 05:57:38,405 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 92 proven. 3 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-10-13 05:57:38,405 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 05:57:38,423 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-13 05:57:38,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [437788151] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 05:57:38,463 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 05:57:38,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2024-10-13 05:57:38,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413445552] [2024-10-13 05:57:38,464 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 05:57:38,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-13 05:57:38,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 05:57:38,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-13 05:57:38,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2024-10-13 05:57:38,466 INFO L87 Difference]: Start difference. First operand 96 states and 136 transitions. Second operand has 16 states, 14 states have (on average 5.857142857142857) internal successors, (82), 16 states have internal predecessors, (82), 6 states have call successors, (30), 4 states have call predecessors, (30), 6 states have return successors, (30), 4 states have call predecessors, (30), 6 states have call successors, (30) [2024-10-13 05:57:39,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:57:39,078 INFO L93 Difference]: Finished difference Result 199 states and 279 transitions. [2024-10-13 05:57:39,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-13 05:57:39,082 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 5.857142857142857) internal successors, (82), 16 states have internal predecessors, (82), 6 states have call successors, (30), 4 states have call predecessors, (30), 6 states have return successors, (30), 4 states have call predecessors, (30), 6 states have call successors, (30) Word has length 117 [2024-10-13 05:57:39,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:57:39,083 INFO L225 Difference]: With dead ends: 199 [2024-10-13 05:57:39,083 INFO L226 Difference]: Without dead ends: 104 [2024-10-13 05:57:39,085 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 261 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=110, Invalid=490, Unknown=0, NotChecked=0, Total=600 [2024-10-13 05:57:39,087 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 272 mSDsluCounter, 821 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 918 SdHoareTripleChecker+Invalid, 522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 05:57:39,087 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 918 Invalid, 522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 488 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 05:57:39,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-10-13 05:57:39,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 102. [2024-10-13 05:57:39,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 84 states have (on average 1.3214285714285714) internal successors, (111), 84 states have internal predecessors, (111), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-13 05:57:39,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 141 transitions. [2024-10-13 05:57:39,107 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 141 transitions. Word has length 117 [2024-10-13 05:57:39,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:57:39,107 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 141 transitions. [2024-10-13 05:57:39,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 5.857142857142857) internal successors, (82), 16 states have internal predecessors, (82), 6 states have call successors, (30), 4 states have call predecessors, (30), 6 states have return successors, (30), 4 states have call predecessors, (30), 6 states have call successors, (30) [2024-10-13 05:57:39,108 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 141 transitions. [2024-10-13 05:57:39,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-13 05:57:39,109 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:57:39,109 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 05:57:39,117 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Forceful destruction successful, exit code 0 [2024-10-13 05:57:39,317 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-13 05:57:39,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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-13 05:57:39,510 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:57:39,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:57:39,511 INFO L85 PathProgramCache]: Analyzing trace with hash -1172923654, now seen corresponding path program 1 times [2024-10-13 05:57:39,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 05:57:39,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1760944974] [2024-10-13 05:57:39,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:57:39,512 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-13 05:57:39,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 05:57:39,514 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-13 05:57:39,515 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-13 05:57:39,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:39,735 INFO L255 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-10-13 05:57:39,740 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:57:39,748 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 8 treesize of output 1 [2024-10-13 05:57:39,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 20 [2024-10-13 05:57:40,012 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-13 05:57:40,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 27 [2024-10-13 05:57:40,819 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 24 [2024-10-13 05:57:40,827 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 13 treesize of output 9 [2024-10-13 05:57:40,845 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-13 05:57:41,005 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 05:57:41,006 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 57 treesize of output 27 [2024-10-13 05:57:41,018 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-13 05:57:41,021 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 29 treesize of output 17 [2024-10-13 05:57:41,088 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 290 proven. 54 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2024-10-13 05:57:41,088 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 05:57:44,644 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 05:57:44,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1760944974] [2024-10-13 05:57:44,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1760944974] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 05:57:44,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1591429719] [2024-10-13 05:57:44,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:57:44,645 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-13 05:57:44,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-13 05:57:44,646 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-13 05:57:44,647 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2024-10-13 05:57:45,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:57:45,076 INFO L255 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-10-13 05:57:45,080 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:57:45,247 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-13 05:57:45,616 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2024-10-13 05:57:47,712 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 13 [2024-10-13 05:57:47,716 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 13 treesize of output 9 [2024-10-13 05:57:47,729 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-13 05:57:48,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 46 [2024-10-13 05:57:48,730 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-13 05:57:48,734 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 05:57:48,734 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 63 treesize of output 31 [2024-10-13 05:57:48,747 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 05:57:48,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 23 [2024-10-13 05:57:48,900 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 138 proven. 6 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2024-10-13 05:57:48,901 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 05:57:55,439 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 73 treesize of output 49 [2024-10-13 05:57:56,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1591429719] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 05:57:56,885 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 05:57:56,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 17] total 38 [2024-10-13 05:57:56,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265616442] [2024-10-13 05:57:56,886 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 05:57:56,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-10-13 05:57:56,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 05:57:56,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-10-13 05:57:56,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=2301, Unknown=0, NotChecked=0, Total=2652 [2024-10-13 05:57:56,888 INFO L87 Difference]: Start difference. First operand 102 states and 141 transitions. Second operand has 38 states, 32 states have (on average 3.34375) internal successors, (107), 33 states have internal predecessors, (107), 12 states have call successors, (30), 9 states have call predecessors, (30), 12 states have return successors, (30), 9 states have call predecessors, (30), 12 states have call successors, (30) [2024-10-13 05:58:04,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:58:04,858 INFO L93 Difference]: Finished difference Result 265 states and 349 transitions. [2024-10-13 05:58:04,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-10-13 05:58:04,859 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 32 states have (on average 3.34375) internal successors, (107), 33 states have internal predecessors, (107), 12 states have call successors, (30), 9 states have call predecessors, (30), 12 states have return successors, (30), 9 states have call predecessors, (30), 12 states have call successors, (30) Word has length 117 [2024-10-13 05:58:04,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:58:04,861 INFO L225 Difference]: With dead ends: 265 [2024-10-13 05:58:04,861 INFO L226 Difference]: Without dead ends: 164 [2024-10-13 05:58:04,864 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2636 ImplicationChecksByTransitivity, 19.6s TimeCoverageRelationStatistics Valid=1674, Invalid=8226, Unknown=0, NotChecked=0, Total=9900 [2024-10-13 05:58:04,865 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 501 mSDsluCounter, 968 mSDsCounter, 0 mSdLazyCounter, 1903 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 501 SdHoareTripleChecker+Valid, 1051 SdHoareTripleChecker+Invalid, 2063 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 1903 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-10-13 05:58:04,865 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [501 Valid, 1051 Invalid, 2063 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 1903 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-10-13 05:58:04,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2024-10-13 05:58:04,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 155. [2024-10-13 05:58:04,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 119 states have (on average 1.218487394957983) internal successors, (145), 120 states have internal predecessors, (145), 26 states have call successors, (26), 9 states have call predecessors, (26), 9 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-13 05:58:04,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 197 transitions. [2024-10-13 05:58:04,883 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 197 transitions. Word has length 117 [2024-10-13 05:58:04,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:58:04,884 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 197 transitions. [2024-10-13 05:58:04,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 32 states have (on average 3.34375) internal successors, (107), 33 states have internal predecessors, (107), 12 states have call successors, (30), 9 states have call predecessors, (30), 12 states have return successors, (30), 9 states have call predecessors, (30), 12 states have call successors, (30) [2024-10-13 05:58:04,884 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 197 transitions. [2024-10-13 05:58:04,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-13 05:58:04,886 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:58:04,886 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 05:58:04,895 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Ended with exit code 0 [2024-10-13 05:58:05,096 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-13 05:58:05,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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-13 05:58:05,287 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:58:05,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:58:05,287 INFO L85 PathProgramCache]: Analyzing trace with hash 116781686, now seen corresponding path program 1 times [2024-10-13 05:58:05,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 05:58:05,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [407867690] [2024-10-13 05:58:05,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:58:05,288 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-13 05:58:05,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 05:58:05,289 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-13 05:58:05,292 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-13 05:58:05,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:05,532 INFO L255 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-13 05:58:05,535 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:58:05,540 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-13 05:58:05,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 19 [2024-10-13 05:58:05,566 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 05:58:05,567 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 60 treesize of output 30 [2024-10-13 05:58:05,579 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-13 05:58:05,579 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 05:58:05,580 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 05:58:05,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [407867690] [2024-10-13 05:58:05,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [407867690] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:58:05,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:58:05,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 05:58:05,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706217121] [2024-10-13 05:58:05,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:58:05,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 05:58:05,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 05:58:05,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 05:58:05,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 05:58:05,581 INFO L87 Difference]: Start difference. First operand 155 states and 197 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-13 05:58:05,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:58:05,662 INFO L93 Difference]: Finished difference Result 272 states and 344 transitions. [2024-10-13 05:58:05,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 05:58:05,665 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 117 [2024-10-13 05:58:05,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:58:05,667 INFO L225 Difference]: With dead ends: 272 [2024-10-13 05:58:05,668 INFO L226 Difference]: Without dead ends: 157 [2024-10-13 05:58:05,668 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 113 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-13 05:58:05,668 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 89 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 05:58:05,668 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 488 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 05:58:05,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-10-13 05:58:05,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2024-10-13 05:58:05,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 120 states have (on average 1.2083333333333333) internal successors, (145), 121 states have internal predecessors, (145), 26 states have call successors, (26), 10 states have call predecessors, (26), 10 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-13 05:58:05,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 197 transitions. [2024-10-13 05:58:05,685 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 197 transitions. Word has length 117 [2024-10-13 05:58:05,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:58:05,688 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 197 transitions. [2024-10-13 05:58:05,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-13 05:58:05,689 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 197 transitions. [2024-10-13 05:58:05,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-13 05:58:05,689 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:58:05,689 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 05:58:05,698 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-13 05:58:05,890 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-13 05:58:05,890 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:58:05,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:58:05,891 INFO L85 PathProgramCache]: Analyzing trace with hash 381340067, now seen corresponding path program 1 times [2024-10-13 05:58:05,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 05:58:05,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2137636602] [2024-10-13 05:58:05,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:58:05,891 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-13 05:58:05,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 05:58:05,892 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-13 05:58:05,893 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-13 05:58:06,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:06,140 INFO L255 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-13 05:58:06,144 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:58:06,166 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 8 treesize of output 1 [2024-10-13 05:58:06,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-10-13 05:58:06,290 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-13 05:58:06,292 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 13 treesize of output 9 [2024-10-13 05:58:06,329 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-10-13 05:58:06,360 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-13 05:58:06,383 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 152 proven. 33 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2024-10-13 05:58:06,383 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 05:58:06,615 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 9 proven. 33 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-10-13 05:58:06,615 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 05:58:06,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2137636602] [2024-10-13 05:58:06,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2137636602] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 05:58:06,615 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 05:58:06,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2024-10-13 05:58:06,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692543699] [2024-10-13 05:58:06,616 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 05:58:06,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-13 05:58:06,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 05:58:06,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-13 05:58:06,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-10-13 05:58:06,617 INFO L87 Difference]: Start difference. First operand 157 states and 197 transitions. Second operand has 13 states, 11 states have (on average 6.454545454545454) internal successors, (71), 13 states have internal predecessors, (71), 4 states have call successors, (27), 2 states have call predecessors, (27), 4 states have return successors, (27), 2 states have call predecessors, (27), 4 states have call successors, (27) [2024-10-13 05:58:07,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:58:07,459 INFO L93 Difference]: Finished difference Result 305 states and 375 transitions. [2024-10-13 05:58:07,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-13 05:58:07,459 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 6.454545454545454) internal successors, (71), 13 states have internal predecessors, (71), 4 states have call successors, (27), 2 states have call predecessors, (27), 4 states have return successors, (27), 2 states have call predecessors, (27), 4 states have call successors, (27) Word has length 120 [2024-10-13 05:58:07,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:58:07,461 INFO L225 Difference]: With dead ends: 305 [2024-10-13 05:58:07,461 INFO L226 Difference]: Without dead ends: 188 [2024-10-13 05:58:07,461 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 227 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=156, Invalid=494, Unknown=0, NotChecked=0, Total=650 [2024-10-13 05:58:07,462 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 242 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 624 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 624 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 05:58:07,462 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 527 Invalid, 693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 624 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 05:58:07,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2024-10-13 05:58:07,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 177. [2024-10-13 05:58:07,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 133 states have (on average 1.1804511278195489) internal successors, (157), 134 states have internal predecessors, (157), 30 states have call successors, (30), 13 states have call predecessors, (30), 13 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-13 05:58:07,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 217 transitions. [2024-10-13 05:58:07,483 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 217 transitions. Word has length 120 [2024-10-13 05:58:07,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:58:07,492 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 217 transitions. [2024-10-13 05:58:07,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 6.454545454545454) internal successors, (71), 13 states have internal predecessors, (71), 4 states have call successors, (27), 2 states have call predecessors, (27), 4 states have return successors, (27), 2 states have call predecessors, (27), 4 states have call successors, (27) [2024-10-13 05:58:07,492 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 217 transitions. [2024-10-13 05:58:07,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-13 05:58:07,493 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:58:07,493 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 05:58:07,502 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-13 05:58:07,694 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-13 05:58:07,694 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:58:07,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:58:07,695 INFO L85 PathProgramCache]: Analyzing trace with hash -629777183, now seen corresponding path program 1 times [2024-10-13 05:58:07,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 05:58:07,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1531329248] [2024-10-13 05:58:07,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:58:07,695 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-13 05:58:07,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 05:58:07,698 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-13 05:58:07,699 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-13 05:58:07,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:07,951 INFO L255 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-13 05:58:07,954 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:58:07,960 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 8 treesize of output 1 [2024-10-13 05:58:07,992 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2024-10-13 05:58:08,367 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 05:58:08,367 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 41 treesize of output 23 [2024-10-13 05:58:08,374 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 13 treesize of output 9 [2024-10-13 05:58:08,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-10-13 05:58:08,491 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 22 treesize of output 10 [2024-10-13 05:58:08,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 17 treesize of output 9 [2024-10-13 05:58:08,560 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 252 proven. 33 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2024-10-13 05:58:08,560 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 05:58:08,846 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 33 treesize of output 21 [2024-10-13 05:58:08,882 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 39 proven. 3 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-10-13 05:58:08,883 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 05:58:08,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1531329248] [2024-10-13 05:58:08,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1531329248] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 05:58:08,883 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 05:58:08,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 21 [2024-10-13 05:58:08,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770275706] [2024-10-13 05:58:08,883 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 05:58:08,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-13 05:58:08,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 05:58:08,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-13 05:58:08,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2024-10-13 05:58:08,884 INFO L87 Difference]: Start difference. First operand 177 states and 217 transitions. Second operand has 21 states, 18 states have (on average 5.111111111111111) internal successors, (92), 21 states have internal predecessors, (92), 8 states have call successors, (27), 4 states have call predecessors, (27), 7 states have return successors, (27), 5 states have call predecessors, (27), 8 states have call successors, (27) [2024-10-13 05:58:11,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:58:11,798 INFO L93 Difference]: Finished difference Result 307 states and 374 transitions. [2024-10-13 05:58:11,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-10-13 05:58:11,798 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 5.111111111111111) internal successors, (92), 21 states have internal predecessors, (92), 8 states have call successors, (27), 4 states have call predecessors, (27), 7 states have return successors, (27), 5 states have call predecessors, (27), 8 states have call successors, (27) Word has length 120 [2024-10-13 05:58:11,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:58:11,800 INFO L225 Difference]: With dead ends: 307 [2024-10-13 05:58:11,800 INFO L226 Difference]: Without dead ends: 190 [2024-10-13 05:58:11,801 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 759 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=624, Invalid=2682, Unknown=0, NotChecked=0, Total=3306 [2024-10-13 05:58:11,801 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 648 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 1027 mSolverCounterSat, 380 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 649 SdHoareTripleChecker+Valid, 625 SdHoareTripleChecker+Invalid, 1407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 380 IncrementalHoareTripleChecker+Valid, 1027 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-13 05:58:11,801 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [649 Valid, 625 Invalid, 1407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [380 Valid, 1027 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-13 05:58:11,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2024-10-13 05:58:11,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 161. [2024-10-13 05:58:11,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 123 states have (on average 1.1869918699186992) internal successors, (146), 124 states have internal predecessors, (146), 26 states have call successors, (26), 11 states have call predecessors, (26), 11 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-13 05:58:11,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 198 transitions. [2024-10-13 05:58:11,824 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 198 transitions. Word has length 120 [2024-10-13 05:58:11,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:58:11,825 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 198 transitions. [2024-10-13 05:58:11,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 5.111111111111111) internal successors, (92), 21 states have internal predecessors, (92), 8 states have call successors, (27), 4 states have call predecessors, (27), 7 states have return successors, (27), 5 states have call predecessors, (27), 8 states have call successors, (27) [2024-10-13 05:58:11,825 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 198 transitions. [2024-10-13 05:58:11,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-13 05:58:11,826 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:58:11,826 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 05:58:11,835 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-13 05:58:12,026 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-13 05:58:12,027 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:58:12,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:58:12,028 INFO L85 PathProgramCache]: Analyzing trace with hash -1216583197, now seen corresponding path program 1 times [2024-10-13 05:58:12,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 05:58:12,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [106836677] [2024-10-13 05:58:12,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:58:12,028 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-13 05:58:12,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 05:58:12,029 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-13 05:58:12,030 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-13 05:58:12,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:12,270 INFO L255 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-13 05:58:12,274 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:58:12,279 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-13 05:58:12,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 35 [2024-10-13 05:58:12,767 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 05:58:12,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 38 [2024-10-13 05:58:12,828 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 05:58:12,829 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 98 treesize of output 44 [2024-10-13 05:58:12,873 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 220 proven. 48 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2024-10-13 05:58:12,873 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 05:58:12,993 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-13 05:58:12,993 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 05:58:12,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [106836677] [2024-10-13 05:58:12,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [106836677] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-13 05:58:12,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 05:58:12,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [15] total 17 [2024-10-13 05:58:12,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827137205] [2024-10-13 05:58:12,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:58:12,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 05:58:12,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 05:58:12,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 05:58:12,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2024-10-13 05:58:12,995 INFO L87 Difference]: Start difference. First operand 161 states and 198 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-13 05:58:13,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:58:13,181 INFO L93 Difference]: Finished difference Result 280 states and 343 transitions. [2024-10-13 05:58:13,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 05:58:13,182 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 120 [2024-10-13 05:58:13,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:58:13,183 INFO L225 Difference]: With dead ends: 280 [2024-10-13 05:58:13,183 INFO L226 Difference]: Without dead ends: 163 [2024-10-13 05:58:13,183 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2024-10-13 05:58:13,184 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 73 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 05:58:13,184 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 496 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 05:58:13,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-10-13 05:58:13,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2024-10-13 05:58:13,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 124 states have (on average 1.1774193548387097) internal successors, (146), 125 states have internal predecessors, (146), 26 states have call successors, (26), 12 states have call predecessors, (26), 12 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-13 05:58:13,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 198 transitions. [2024-10-13 05:58:13,214 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 198 transitions. Word has length 120 [2024-10-13 05:58:13,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:58:13,215 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 198 transitions. [2024-10-13 05:58:13,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-13 05:58:13,216 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 198 transitions. [2024-10-13 05:58:13,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-13 05:58:13,216 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:58:13,217 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 05:58:13,224 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 (13)] Forceful destruction successful, exit code 0 [2024-10-13 05:58:13,417 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-13 05:58:13,418 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:58:13,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:58:13,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1529971826, now seen corresponding path program 1 times [2024-10-13 05:58:13,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 05:58:13,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1995091353] [2024-10-13 05:58:13,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:58:13,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-13 05:58:13,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 05:58:13,420 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-13 05:58:13,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 (14)] Waiting until timeout for monitored process [2024-10-13 05:58:13,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:13,715 INFO L255 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-13 05:58:13,718 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:58:13,726 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 8 treesize of output 1 [2024-10-13 05:58:13,812 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 30 [2024-10-13 05:58:14,167 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 05:58:14,167 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 52 treesize of output 28 [2024-10-13 05:58:14,169 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 13 treesize of output 9 [2024-10-13 05:58:14,175 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-13 05:58:14,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 22 [2024-10-13 05:58:14,419 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 51 treesize of output 39 [2024-10-13 05:58:14,421 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 51 treesize of output 31 [2024-10-13 05:58:14,456 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 165 proven. 60 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2024-10-13 05:58:14,456 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 05:58:14,585 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-13 05:58:14,585 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 05:58:14,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1995091353] [2024-10-13 05:58:14,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1995091353] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-13 05:58:14,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 05:58:14,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [14] total 16 [2024-10-13 05:58:14,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353042093] [2024-10-13 05:58:14,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:58:14,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 05:58:14,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 05:58:14,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 05:58:14,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2024-10-13 05:58:14,586 INFO L87 Difference]: Start difference. First operand 163 states and 198 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-13 05:58:14,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:58:14,692 INFO L93 Difference]: Finished difference Result 188 states and 224 transitions. [2024-10-13 05:58:14,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 05:58:14,693 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 122 [2024-10-13 05:58:14,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:58:14,694 INFO L225 Difference]: With dead ends: 188 [2024-10-13 05:58:14,694 INFO L226 Difference]: Without dead ends: 186 [2024-10-13 05:58:14,695 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 227 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2024-10-13 05:58:14,695 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 97 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 05:58:14,695 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 525 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 05:58:14,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-10-13 05:58:14,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 165. [2024-10-13 05:58:14,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 126 states have (on average 1.1746031746031746) internal successors, (148), 127 states have internal predecessors, (148), 26 states have call successors, (26), 12 states have call predecessors, (26), 12 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-13 05:58:14,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 200 transitions. [2024-10-13 05:58:14,717 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 200 transitions. Word has length 122 [2024-10-13 05:58:14,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:58:14,718 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 200 transitions. [2024-10-13 05:58:14,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-13 05:58:14,718 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 200 transitions. [2024-10-13 05:58:14,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-13 05:58:14,718 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:58:14,719 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 05:58:14,728 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-13 05:58:14,919 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-13 05:58:14,920 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:58:14,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:58:14,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1529912244, now seen corresponding path program 1 times [2024-10-13 05:58:14,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 05:58:14,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1036671667] [2024-10-13 05:58:14,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:58:14,921 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-13 05:58:14,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 05:58:14,923 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-13 05:58:14,924 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-13 05:58:15,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:15,108 INFO L255 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 05:58:15,111 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:58:15,115 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 19 treesize of output 15 [2024-10-13 05:58:15,165 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-13 05:58:15,165 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 05:58:15,165 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 05:58:15,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1036671667] [2024-10-13 05:58:15,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1036671667] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:58:15,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:58:15,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 05:58:15,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925554342] [2024-10-13 05:58:15,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:58:15,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 05:58:15,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 05:58:15,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 05:58:15,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 05:58:15,167 INFO L87 Difference]: Start difference. First operand 165 states and 200 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-13 05:58:15,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:58:15,262 INFO L93 Difference]: Finished difference Result 307 states and 368 transitions. [2024-10-13 05:58:15,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 05:58:15,263 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 122 [2024-10-13 05:58:15,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:58:15,267 INFO L225 Difference]: With dead ends: 307 [2024-10-13 05:58:15,267 INFO L226 Difference]: Without dead ends: 186 [2024-10-13 05:58:15,267 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 118 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-13 05:58:15,268 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 98 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 05:58:15,268 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 534 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 05:58:15,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-10-13 05:58:15,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 165. [2024-10-13 05:58:15,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 126 states have (on average 1.1666666666666667) internal successors, (147), 127 states have internal predecessors, (147), 26 states have call successors, (26), 12 states have call predecessors, (26), 12 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-13 05:58:15,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 199 transitions. [2024-10-13 05:58:15,289 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 199 transitions. Word has length 122 [2024-10-13 05:58:15,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:58:15,289 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 199 transitions. [2024-10-13 05:58:15,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-13 05:58:15,290 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 199 transitions. [2024-10-13 05:58:15,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-13 05:58:15,290 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:58:15,290 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 05:58:15,298 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 (15)] Forceful destruction successful, exit code 0 [2024-10-13 05:58:15,490 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-13 05:58:15,491 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:58:15,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:58:15,491 INFO L85 PathProgramCache]: Analyzing trace with hash -1472653942, now seen corresponding path program 1 times [2024-10-13 05:58:15,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 05:58:15,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1500512346] [2024-10-13 05:58:15,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:58:15,492 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-13 05:58:15,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 05:58:15,494 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-13 05:58:15,495 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-13 05:58:15,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:15,737 INFO L255 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-13 05:58:15,741 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:58:15,749 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 8 treesize of output 1 [2024-10-13 05:58:15,751 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-13 05:58:15,862 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 19 treesize of output 15 [2024-10-13 05:58:15,888 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 05:58:15,888 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 43 [2024-10-13 05:58:15,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2024-10-13 05:58:15,938 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 05:58:15,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 46 [2024-10-13 05:58:16,066 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 200 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-13 05:58:16,066 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 05:58:16,066 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 05:58:16,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1500512346] [2024-10-13 05:58:16,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1500512346] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:58:16,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:58:16,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 05:58:16,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730886435] [2024-10-13 05:58:16,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:58:16,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 05:58:16,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 05:58:16,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 05:58:16,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-13 05:58:16,068 INFO L87 Difference]: Start difference. First operand 165 states and 199 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-13 05:58:16,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:58:16,385 INFO L93 Difference]: Finished difference Result 286 states and 344 transitions. [2024-10-13 05:58:16,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 05:58:16,386 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), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 122 [2024-10-13 05:58:16,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:58:16,387 INFO L225 Difference]: With dead ends: 286 [2024-10-13 05:58:16,387 INFO L226 Difference]: Without dead ends: 165 [2024-10-13 05:58:16,387 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-10-13 05:58:16,387 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 182 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 05:58:16,388 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 301 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 05:58:16,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-10-13 05:58:16,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2024-10-13 05:58:16,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 126 states have (on average 1.1587301587301588) internal successors, (146), 127 states have internal predecessors, (146), 26 states have call successors, (26), 12 states have call predecessors, (26), 12 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-13 05:58:16,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 198 transitions. [2024-10-13 05:58:16,411 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 198 transitions. Word has length 122 [2024-10-13 05:58:16,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:58:16,412 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 198 transitions. [2024-10-13 05:58:16,412 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), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-13 05:58:16,412 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 198 transitions. [2024-10-13 05:58:16,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-13 05:58:16,413 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:58:16,413 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 05:58:16,421 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-13 05:58:16,613 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-13 05:58:16,613 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:58:16,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:58:16,614 INFO L85 PathProgramCache]: Analyzing trace with hash 2012966728, now seen corresponding path program 1 times [2024-10-13 05:58:16,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 05:58:16,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [847790777] [2024-10-13 05:58:16,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:58:16,614 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-13 05:58:16,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 05:58:16,615 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-13 05:58:16,617 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-13 05:58:16,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:16,862 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-10-13 05:58:16,867 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:58:16,871 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 8 treesize of output 1 [2024-10-13 05:58:16,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 30 [2024-10-13 05:58:17,806 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 05:58:17,806 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 54 [2024-10-13 05:58:17,936 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 05:58:17,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 78 treesize of output 65 [2024-10-13 05:58:18,208 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 05:58:18,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 141 treesize of output 69 [2024-10-13 05:58:18,278 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 197 proven. 96 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2024-10-13 05:58:18,278 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 05:58:18,418 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-13 05:58:18,418 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 05:58:18,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [847790777] [2024-10-13 05:58:18,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [847790777] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-13 05:58:18,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 05:58:18,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [24] total 26 [2024-10-13 05:58:18,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325646102] [2024-10-13 05:58:18,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:58:18,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 05:58:18,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 05:58:18,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 05:58:18,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=542, Unknown=0, NotChecked=0, Total=650 [2024-10-13 05:58:18,420 INFO L87 Difference]: Start difference. First operand 165 states and 198 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-13 05:58:18,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:58:18,640 INFO L93 Difference]: Finished difference Result 343 states and 412 transitions. [2024-10-13 05:58:18,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 05:58:18,641 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 122 [2024-10-13 05:58:18,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:58:18,642 INFO L225 Difference]: With dead ends: 343 [2024-10-13 05:58:18,642 INFO L226 Difference]: Without dead ends: 222 [2024-10-13 05:58:18,643 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=120, Invalid=692, Unknown=0, NotChecked=0, Total=812 [2024-10-13 05:58:18,643 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 54 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 05:58:18,643 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 579 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 05:58:18,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2024-10-13 05:58:18,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 178. [2024-10-13 05:58:18,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 139 states have (on average 1.1510791366906474) internal successors, (160), 140 states have internal predecessors, (160), 26 states have call successors, (26), 12 states have call predecessors, (26), 12 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-13 05:58:18,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 212 transitions. [2024-10-13 05:58:18,674 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 212 transitions. Word has length 122 [2024-10-13 05:58:18,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:58:18,674 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 212 transitions. [2024-10-13 05:58:18,674 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-13 05:58:18,674 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 212 transitions. [2024-10-13 05:58:18,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-13 05:58:18,675 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:58:18,675 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 05:58:18,683 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 (17)] Forceful destruction successful, exit code 0 [2024-10-13 05:58:18,875 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-13 05:58:18,876 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:58:18,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:58:18,876 INFO L85 PathProgramCache]: Analyzing trace with hash 885155239, now seen corresponding path program 1 times [2024-10-13 05:58:18,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 05:58:18,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1587676991] [2024-10-13 05:58:18,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:58:18,877 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-13 05:58:18,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 05:58:18,879 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-13 05:58:18,880 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-13 05:58:19,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:19,076 INFO L255 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-13 05:58:19,078 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:58:19,840 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 70 treesize of output 34 [2024-10-13 05:58:19,873 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-13 05:58:19,873 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 05:58:19,873 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 05:58:19,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1587676991] [2024-10-13 05:58:19,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1587676991] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:58:19,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:58:19,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 05:58:19,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044723042] [2024-10-13 05:58:19,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:58:19,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 05:58:19,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 05:58:19,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 05:58:19,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-13 05:58:19,874 INFO L87 Difference]: Start difference. First operand 178 states and 212 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-13 05:58:20,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:58:20,300 INFO L93 Difference]: Finished difference Result 464 states and 546 transitions. [2024-10-13 05:58:20,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 05:58:20,301 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2024-10-13 05:58:20,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:58:20,302 INFO L225 Difference]: With dead ends: 464 [2024-10-13 05:58:20,302 INFO L226 Difference]: Without dead ends: 330 [2024-10-13 05:58:20,303 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-10-13 05:58:20,303 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 205 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 05:58:20,303 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 469 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 05:58:20,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2024-10-13 05:58:20,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 288. [2024-10-13 05:58:20,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 211 states have (on average 1.1090047393364928) internal successors, (234), 213 states have internal predecessors, (234), 52 states have call successors, (52), 24 states have call predecessors, (52), 24 states have return successors, (52), 50 states have call predecessors, (52), 52 states have call successors, (52) [2024-10-13 05:58:20,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 338 transitions. [2024-10-13 05:58:20,348 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 338 transitions. Word has length 124 [2024-10-13 05:58:20,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:58:20,348 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 338 transitions. [2024-10-13 05:58:20,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-13 05:58:20,349 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 338 transitions. [2024-10-13 05:58:20,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-13 05:58:20,349 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:58:20,349 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 05:58:20,358 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-13 05:58:20,550 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-13 05:58:20,550 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:58:20,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:58:20,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1165253659, now seen corresponding path program 1 times [2024-10-13 05:58:20,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 05:58:20,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1102907485] [2024-10-13 05:58:20,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:58:20,551 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-13 05:58:20,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 05:58:20,552 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-13 05:58:20,553 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-13 05:58:20,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:58:20,733 INFO L255 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 05:58:20,735 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:58:20,742 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-13 05:58:20,743 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 05:58:20,743 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 05:58:20,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1102907485] [2024-10-13 05:58:20,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1102907485] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:58:20,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:58:20,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 05:58:20,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200828772] [2024-10-13 05:58:20,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:58:20,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 05:58:20,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 05:58:20,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 05:58:20,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 05:58:20,744 INFO L87 Difference]: Start difference. First operand 288 states and 338 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-13 05:58:20,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:58:20,816 INFO L93 Difference]: Finished difference Result 530 states and 619 transitions. [2024-10-13 05:58:20,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 05:58:20,816 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2024-10-13 05:58:20,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:58:20,819 INFO L225 Difference]: With dead ends: 530 [2024-10-13 05:58:20,819 INFO L226 Difference]: Without dead ends: 288 [2024-10-13 05:58:20,819 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 121 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-13 05:58:20,820 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 0 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 05:58:20,820 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 339 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 05:58:20,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2024-10-13 05:58:20,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 288. [2024-10-13 05:58:20,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 211 states have (on average 1.099526066350711) internal successors, (232), 213 states have internal predecessors, (232), 52 states have call successors, (52), 24 states have call predecessors, (52), 24 states have return successors, (52), 50 states have call predecessors, (52), 52 states have call successors, (52) [2024-10-13 05:58:20,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 336 transitions. [2024-10-13 05:58:20,866 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 336 transitions. Word has length 124 [2024-10-13 05:58:20,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:58:20,867 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 336 transitions. [2024-10-13 05:58:20,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-13 05:58:20,867 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 336 transitions. [2024-10-13 05:58:20,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-13 05:58:20,868 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:58:20,868 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 05:58:20,875 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 (19)] Forceful destruction successful, exit code 0