./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-pthread/cs_stateful-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-pthread/cs_stateful-2.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 c1d6cba599289c2637bd3d8da41e464d318a32e6ae6e6e0e391ff437e6ce1fcc --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 15:24:09,686 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 15:24:09,737 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 15:24:09,743 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 15:24:09,743 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 15:24:09,766 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 15:24:09,767 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 15:24:09,767 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 15:24:09,768 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 15:24:09,768 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 15:24:09,768 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 15:24:09,768 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 15:24:09,769 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 15:24:09,769 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 15:24:09,769 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 15:24:09,769 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 15:24:09,769 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 15:24:09,769 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 15:24:09,769 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 15:24:09,769 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 15:24:09,769 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 15:24:09,770 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 15:24:09,770 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 15:24:09,770 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 15:24:09,770 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 15:24:09,770 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 15:24:09,770 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 15:24:09,770 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 15:24:09,770 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 15:24:09,770 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 15:24:09,770 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 15:24:09,770 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 15:24:09,770 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:24:09,770 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 15:24:09,770 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 15:24:09,770 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 15:24:09,770 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 15:24:09,771 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 15:24:09,771 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 15:24:09,771 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 15:24:09,771 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 15:24:09,771 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 15:24:09,771 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 15:24:09,771 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /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 -> c1d6cba599289c2637bd3d8da41e464d318a32e6ae6e6e0e391ff437e6ce1fcc [2025-03-03 15:24:10,021 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 15:24:10,031 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 15:24:10,033 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 15:24:10,035 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 15:24:10,035 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 15:24:10,037 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-pthread/cs_stateful-2.i [2025-03-03 15:24:11,219 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2b612e67/eb23811b3c8a4627bdcb2591373cf8f3/FLAG45dad61ba [2025-03-03 15:24:11,495 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 15:24:11,496 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_stateful-2.i [2025-03-03 15:24:11,513 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2b612e67/eb23811b3c8a4627bdcb2591373cf8f3/FLAG45dad61ba [2025-03-03 15:24:11,527 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2b612e67/eb23811b3c8a4627bdcb2591373cf8f3 [2025-03-03 15:24:11,530 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 15:24:11,537 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 15:24:11,539 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 15:24:11,539 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 15:24:11,543 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 15:24:11,543 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:24:11" (1/1) ... [2025-03-03 15:24:11,544 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17c5f70e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:24:11, skipping insertion in model container [2025-03-03 15:24:11,544 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:24:11" (1/1) ... [2025-03-03 15:24:11,575 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 15:24:11,752 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_stateful-2.i[23607,23620] [2025-03-03 15:24:11,818 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:24:11,826 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 15:24:11,849 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_stateful-2.i[23607,23620] [2025-03-03 15:24:11,873 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:24:11,900 INFO L204 MainTranslator]: Completed translation [2025-03-03 15:24:11,901 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:24:11 WrapperNode [2025-03-03 15:24:11,902 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 15:24:11,903 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 15:24:11,903 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 15:24:11,903 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 15:24:11,907 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:24:11" (1/1) ... [2025-03-03 15:24:11,927 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:24:11" (1/1) ... [2025-03-03 15:24:11,963 INFO L138 Inliner]: procedures = 145, calls = 254, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 548 [2025-03-03 15:24:11,963 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 15:24:11,964 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 15:24:11,964 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 15:24:11,964 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 15:24:11,970 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:24:11" (1/1) ... [2025-03-03 15:24:11,970 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:24:11" (1/1) ... [2025-03-03 15:24:11,980 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:24:11" (1/1) ... [2025-03-03 15:24:12,013 INFO L175 MemorySlicer]: Split 122 memory accesses to 17 slices as follows [2, 8, 8, 8, 0, 20, 12, 3, 7, 10, 10, 3, 12, 3, 3, 6, 7]. 16 percent of accesses are in the largest equivalence class. The 33 initializations are split as follows [2, 3, 3, 3, 0, 6, 6, 0, 0, 2, 2, 0, 4, 0, 0, 2, 0]. The 37 writes are split as follows [0, 2, 2, 2, 0, 8, 3, 1, 1, 4, 4, 1, 4, 1, 1, 2, 1]. [2025-03-03 15:24:12,016 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:24:11" (1/1) ... [2025-03-03 15:24:12,017 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:24:11" (1/1) ... [2025-03-03 15:24:12,037 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:24:11" (1/1) ... [2025-03-03 15:24:12,040 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:24:11" (1/1) ... [2025-03-03 15:24:12,049 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:24:11" (1/1) ... [2025-03-03 15:24:12,052 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:24:11" (1/1) ... [2025-03-03 15:24:12,069 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 15:24:12,073 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 15:24:12,073 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 15:24:12,073 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 15:24:12,074 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:24:11" (1/1) ... [2025-03-03 15:24:12,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:24:12,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:24:12,099 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) [2025-03-03 15:24:12,102 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 [2025-03-03 15:24:12,121 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-03 15:24:12,121 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-03 15:24:12,121 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-03 15:24:12,121 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-03 15:24:12,121 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-03 15:24:12,121 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-03 15:24:12,121 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-03 15:24:12,121 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-03 15:24:12,121 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-03 15:24:12,122 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-03 15:24:12,122 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-03 15:24:12,122 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-03-03 15:24:12,122 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-03-03 15:24:12,123 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-03-03 15:24:12,123 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-03-03 15:24:12,123 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-03-03 15:24:12,123 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-03-03 15:24:12,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-03 15:24:12,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-03 15:24:12,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-03 15:24:12,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-03 15:24:12,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-03 15:24:12,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-03 15:24:12,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-03 15:24:12,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-03 15:24:12,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-03 15:24:12,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-03 15:24:12,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-03 15:24:12,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-03-03 15:24:12,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-03-03 15:24:12,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-03-03 15:24:12,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-03-03 15:24:12,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-03-03 15:24:12,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-03-03 15:24:12,125 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 15:24:12,125 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 15:24:12,125 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 15:24:12,125 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-03 15:24:12,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-03 15:24:12,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-03 15:24:12,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-03 15:24:12,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-03 15:24:12,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-03 15:24:12,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-03 15:24:12,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-03 15:24:12,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-03-03 15:24:12,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-03-03 15:24:12,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-03-03 15:24:12,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-03-03 15:24:12,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-03-03 15:24:12,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-03-03 15:24:12,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-03-03 15:24:12,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-03-03 15:24:12,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-03-03 15:24:12,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2025-03-03 15:24:12,127 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_init [2025-03-03 15:24:12,127 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_init [2025-03-03 15:24:12,127 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_lock [2025-03-03 15:24:12,128 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_lock [2025-03-03 15:24:12,128 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_create [2025-03-03 15:24:12,128 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_create [2025-03-03 15:24:12,128 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-03 15:24:12,128 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-03 15:24:12,128 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-03 15:24:12,128 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-03 15:24:12,128 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-03 15:24:12,128 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-03 15:24:12,128 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-03 15:24:12,128 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-03-03 15:24:12,128 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-03-03 15:24:12,128 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-03-03 15:24:12,129 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-03-03 15:24:12,129 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-03-03 15:24:12,129 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-03-03 15:24:12,130 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-03-03 15:24:12,130 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-03-03 15:24:12,130 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-03-03 15:24:12,130 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2025-03-03 15:24:12,130 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_join [2025-03-03 15:24:12,130 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_join [2025-03-03 15:24:12,130 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~$Pointer$ [2025-03-03 15:24:12,130 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~$Pointer$ [2025-03-03 15:24:12,130 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-03 15:24:12,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-03 15:24:12,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-03 15:24:12,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-03 15:24:12,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-03-03 15:24:12,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-03-03 15:24:12,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-03-03 15:24:12,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-03-03 15:24:12,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-03-03 15:24:12,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-03-03 15:24:12,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-03-03 15:24:12,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-03-03 15:24:12,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-03-03 15:24:12,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-03-03 15:24:12,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-03-03 15:24:12,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2025-03-03 15:24:12,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2025-03-03 15:24:12,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#16 [2025-03-03 15:24:12,131 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_cs [2025-03-03 15:24:12,131 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_cs [2025-03-03 15:24:12,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 15:24:12,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 15:24:12,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-03 15:24:12,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-03 15:24:12,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-03 15:24:12,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-03 15:24:12,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-03 15:24:12,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-03 15:24:12,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-03 15:24:12,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-03 15:24:12,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-03 15:24:12,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-03 15:24:12,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-03 15:24:12,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-03 15:24:12,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-03 15:24:12,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-03 15:24:12,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-03-03 15:24:12,131 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_unlock [2025-03-03 15:24:12,132 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_unlock [2025-03-03 15:24:12,132 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 15:24:12,132 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 15:24:12,349 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 15:24:12,351 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 15:24:12,644 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L746-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset; [2025-03-03 15:24:12,645 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L746-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-03-03 15:24:12,645 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L746-2: SUMMARY for call __CS_cs(); srcloc: null [2025-03-03 15:24:12,645 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L748-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset; [2025-03-03 15:24:12,645 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L748-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-03-03 15:24:12,645 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L748-2: SUMMARY for call __CS_cs(); srcloc: null [2025-03-03 15:24:12,645 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L750-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset; [2025-03-03 15:24:12,645 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L750-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-03-03 15:24:12,645 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L750-2: SUMMARY for call __CS_cs(); srcloc: null [2025-03-03 15:24:15,020 INFO L? ?]: Removed 78 outVars from TransFormulas that were not future-live. [2025-03-03 15:24:15,021 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 15:24:15,028 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 15:24:15,028 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 15:24:15,028 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:24:15 BoogieIcfgContainer [2025-03-03 15:24:15,028 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 15:24:15,030 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 15:24:15,030 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 15:24:15,033 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 15:24:15,033 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 03:24:11" (1/3) ... [2025-03-03 15:24:15,033 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5900ecc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:24:15, skipping insertion in model container [2025-03-03 15:24:15,034 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:24:11" (2/3) ... [2025-03-03 15:24:15,034 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5900ecc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:24:15, skipping insertion in model container [2025-03-03 15:24:15,034 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:24:15" (3/3) ... [2025-03-03 15:24:15,037 INFO L128 eAbstractionObserver]: Analyzing ICFG cs_stateful-2.i [2025-03-03 15:24:15,046 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 15:24:15,048 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG cs_stateful-2.i that has 9 procedures, 169 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-03 15:24:15,093 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 15:24:15,100 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;@5e223ca7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 15:24:15,100 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 15:24:15,103 INFO L276 IsEmpty]: Start isEmpty. Operand has 169 states, 105 states have (on average 1.4476190476190476) internal successors, (152), 106 states have internal predecessors, (152), 54 states have call successors, (54), 8 states have call predecessors, (54), 8 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-03 15:24:15,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-03 15:24:15,113 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:24:15,113 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:24:15,114 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:24:15,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:24:15,117 INFO L85 PathProgramCache]: Analyzing trace with hash 680485318, now seen corresponding path program 1 times [2025-03-03 15:24:15,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:24:15,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719612570] [2025-03-03 15:24:15,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:24:15,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:24:15,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-03 15:24:15,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-03 15:24:15,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:24:15,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:24:15,511 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-03 15:24:15,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:24:15,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719612570] [2025-03-03 15:24:15,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719612570] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:24:15,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:24:15,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:24:15,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081540439] [2025-03-03 15:24:15,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:24:15,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:24:15,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:24:15,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:24:15,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:24:15,529 INFO L87 Difference]: Start difference. First operand has 169 states, 105 states have (on average 1.4476190476190476) internal successors, (152), 106 states have internal predecessors, (152), 54 states have call successors, (54), 8 states have call predecessors, (54), 8 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-03-03 15:24:16,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:24:16,342 INFO L93 Difference]: Finished difference Result 336 states and 560 transitions. [2025-03-03 15:24:16,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:24:16,344 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 71 [2025-03-03 15:24:16,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:24:16,349 INFO L225 Difference]: With dead ends: 336 [2025-03-03 15:24:16,349 INFO L226 Difference]: Without dead ends: 167 [2025-03-03 15:24:16,355 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:24:16,359 INFO L435 NwaCegarLoop]: 255 mSDtfsCounter, 2 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 15:24:16,361 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 507 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 15:24:16,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2025-03-03 15:24:16,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 166. [2025-03-03 15:24:16,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 103 states have (on average 1.4271844660194175) internal successors, (147), 103 states have internal predecessors, (147), 54 states have call successors, (54), 8 states have call predecessors, (54), 8 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-03 15:24:16,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 255 transitions. [2025-03-03 15:24:16,397 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 255 transitions. Word has length 71 [2025-03-03 15:24:16,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:24:16,397 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 255 transitions. [2025-03-03 15:24:16,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-03-03 15:24:16,398 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 255 transitions. [2025-03-03 15:24:16,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-03 15:24:16,401 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:24:16,401 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:24:16,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 15:24:16,401 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:24:16,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:24:16,402 INFO L85 PathProgramCache]: Analyzing trace with hash 2131192382, now seen corresponding path program 1 times [2025-03-03 15:24:16,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:24:16,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469227778] [2025-03-03 15:24:16,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:24:16,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:24:16,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-03 15:24:16,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-03 15:24:16,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:24:16,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:24:16,570 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-03 15:24:16,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:24:16,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469227778] [2025-03-03 15:24:16,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469227778] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:24:16,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:24:16,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:24:16,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589870194] [2025-03-03 15:24:16,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:24:16,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:24:16,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:24:16,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:24:16,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:24:16,573 INFO L87 Difference]: Start difference. First operand 166 states and 255 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-03-03 15:24:16,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:24:16,611 INFO L93 Difference]: Finished difference Result 330 states and 509 transitions. [2025-03-03 15:24:16,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:24:16,614 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 73 [2025-03-03 15:24:16,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:24:16,615 INFO L225 Difference]: With dead ends: 330 [2025-03-03 15:24:16,615 INFO L226 Difference]: Without dead ends: 167 [2025-03-03 15:24:16,616 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:24:16,617 INFO L435 NwaCegarLoop]: 253 mSDtfsCounter, 0 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 503 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 [2025-03-03 15:24:16,617 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 503 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:24:16,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2025-03-03 15:24:16,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2025-03-03 15:24:16,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 104 states have (on average 1.4230769230769231) internal successors, (148), 104 states have internal predecessors, (148), 54 states have call successors, (54), 8 states have call predecessors, (54), 8 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-03 15:24:16,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 256 transitions. [2025-03-03 15:24:16,637 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 256 transitions. Word has length 73 [2025-03-03 15:24:16,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:24:16,637 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 256 transitions. [2025-03-03 15:24:16,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-03-03 15:24:16,637 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 256 transitions. [2025-03-03 15:24:16,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-03 15:24:16,641 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:24:16,642 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:24:16,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 15:24:16,642 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:24:16,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:24:16,644 INFO L85 PathProgramCache]: Analyzing trace with hash -309403093, now seen corresponding path program 1 times [2025-03-03 15:24:16,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:24:16,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857638735] [2025-03-03 15:24:16,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:24:16,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:24:16,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-03 15:24:16,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-03 15:24:16,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:24:16,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:24:16,853 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-03 15:24:16,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:24:16,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857638735] [2025-03-03 15:24:16,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857638735] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:24:16,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1822140030] [2025-03-03 15:24:16,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:24:16,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:24:16,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:24:16,857 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) [2025-03-03 15:24:16,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 15:24:17,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-03 15:24:17,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-03 15:24:17,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:24:17,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:24:17,150 INFO L256 TraceCheckSpWp]: Trace formula consists of 670 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 15:24:17,156 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:24:17,188 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-03 15:24:17,189 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 15:24:17,268 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-03 15:24:17,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1822140030] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 15:24:17,268 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 15:24:17,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-03-03 15:24:17,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268024571] [2025-03-03 15:24:17,268 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 15:24:17,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:24:17,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:24:17,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:24:17,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:24:17,269 INFO L87 Difference]: Start difference. First operand 167 states and 256 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 1 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 15:24:17,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:24:17,300 INFO L93 Difference]: Finished difference Result 333 states and 513 transitions. [2025-03-03 15:24:17,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:24:17,300 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 1 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 74 [2025-03-03 15:24:17,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:24:17,302 INFO L225 Difference]: With dead ends: 333 [2025-03-03 15:24:17,302 INFO L226 Difference]: Without dead ends: 169 [2025-03-03 15:24:17,303 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 145 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:24:17,303 INFO L435 NwaCegarLoop]: 253 mSDtfsCounter, 0 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:24:17,303 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 503 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:24:17,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2025-03-03 15:24:17,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2025-03-03 15:24:17,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 106 states have (on average 1.4150943396226414) internal successors, (150), 106 states have internal predecessors, (150), 54 states have call successors, (54), 8 states have call predecessors, (54), 8 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-03 15:24:17,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 258 transitions. [2025-03-03 15:24:17,324 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 258 transitions. Word has length 74 [2025-03-03 15:24:17,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:24:17,324 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 258 transitions. [2025-03-03 15:24:17,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 1 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 15:24:17,325 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 258 transitions. [2025-03-03 15:24:17,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-03 15:24:17,328 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:24:17,328 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:24:17,337 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 15:24:17,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:24:17,533 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:24:17,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:24:17,533 INFO L85 PathProgramCache]: Analyzing trace with hash 981440651, now seen corresponding path program 2 times [2025-03-03 15:24:17,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:24:17,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86521293] [2025-03-03 15:24:17,534 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 15:24:17,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:24:17,579 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 76 statements into 2 equivalence classes. [2025-03-03 15:24:17,603 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 76 statements. [2025-03-03 15:24:17,604 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-03 15:24:17,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:24:17,712 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2025-03-03 15:24:17,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:24:17,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86521293] [2025-03-03 15:24:17,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86521293] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:24:17,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:24:17,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:24:17,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293185598] [2025-03-03 15:24:17,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:24:17,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 15:24:17,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:24:17,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 15:24:17,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:24:17,715 INFO L87 Difference]: Start difference. First operand 169 states and 258 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-03-03 15:24:17,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:24:17,773 INFO L93 Difference]: Finished difference Result 328 states and 511 transitions. [2025-03-03 15:24:17,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:24:17,773 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 76 [2025-03-03 15:24:17,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:24:17,780 INFO L225 Difference]: With dead ends: 328 [2025-03-03 15:24:17,780 INFO L226 Difference]: Without dead ends: 302 [2025-03-03 15:24:17,781 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:24:17,781 INFO L435 NwaCegarLoop]: 332 mSDtfsCounter, 217 mSDsluCounter, 574 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 906 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:24:17,781 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 906 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:24:17,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2025-03-03 15:24:17,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 301. [2025-03-03 15:24:17,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 187 states have (on average 1.4438502673796791) internal successors, (270), 187 states have internal predecessors, (270), 97 states have call successors, (97), 16 states have call predecessors, (97), 16 states have return successors, (105), 97 states have call predecessors, (105), 97 states have call successors, (105) [2025-03-03 15:24:17,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 472 transitions. [2025-03-03 15:24:17,801 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 472 transitions. Word has length 76 [2025-03-03 15:24:17,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:24:17,801 INFO L471 AbstractCegarLoop]: Abstraction has 301 states and 472 transitions. [2025-03-03 15:24:17,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-03-03 15:24:17,801 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 472 transitions. [2025-03-03 15:24:17,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-03 15:24:17,804 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:24:17,804 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:24:17,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 15:24:17,804 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:24:17,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:24:17,804 INFO L85 PathProgramCache]: Analyzing trace with hash -607401186, now seen corresponding path program 1 times [2025-03-03 15:24:17,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:24:17,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173409513] [2025-03-03 15:24:17,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:24:17,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:24:17,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-03 15:24:17,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-03 15:24:17,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:24:17,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:24:18,022 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2025-03-03 15:24:18,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:24:18,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173409513] [2025-03-03 15:24:18,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173409513] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:24:18,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1318886662] [2025-03-03 15:24:18,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:24:18,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:24:18,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:24:18,025 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) [2025-03-03 15:24:18,026 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 15:24:18,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-03 15:24:18,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-03 15:24:18,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:24:18,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:24:18,366 INFO L256 TraceCheckSpWp]: Trace formula consists of 1051 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 15:24:18,371 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:24:18,394 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2025-03-03 15:24:18,394 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 15:24:18,515 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2025-03-03 15:24:18,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1318886662] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 15:24:18,516 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 15:24:18,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2025-03-03 15:24:18,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156758216] [2025-03-03 15:24:18,516 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 15:24:18,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:24:18,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:24:18,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:24:18,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:24:18,517 INFO L87 Difference]: Start difference. First operand 301 states and 472 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2025-03-03 15:24:18,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:24:18,652 INFO L93 Difference]: Finished difference Result 599 states and 941 transitions. [2025-03-03 15:24:18,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:24:18,661 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) Word has length 142 [2025-03-03 15:24:18,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:24:18,664 INFO L225 Difference]: With dead ends: 599 [2025-03-03 15:24:18,664 INFO L226 Difference]: Without dead ends: 306 [2025-03-03 15:24:18,666 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 281 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:24:18,668 INFO L435 NwaCegarLoop]: 251 mSDtfsCounter, 2 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 749 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:24:18,670 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 749 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:24:18,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2025-03-03 15:24:18,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 306. [2025-03-03 15:24:18,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 192 states have (on average 1.4375) internal successors, (276), 192 states have internal predecessors, (276), 97 states have call successors, (97), 16 states have call predecessors, (97), 16 states have return successors, (105), 97 states have call predecessors, (105), 97 states have call successors, (105) [2025-03-03 15:24:18,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 478 transitions. [2025-03-03 15:24:18,702 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 478 transitions. Word has length 142 [2025-03-03 15:24:18,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:24:18,703 INFO L471 AbstractCegarLoop]: Abstraction has 306 states and 478 transitions. [2025-03-03 15:24:18,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2025-03-03 15:24:18,703 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 478 transitions. [2025-03-03 15:24:18,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-03 15:24:18,705 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:24:18,705 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 6, 4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:24:18,715 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 15:24:18,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:24:18,906 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:24:18,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:24:18,910 INFO L85 PathProgramCache]: Analyzing trace with hash 112888175, now seen corresponding path program 2 times [2025-03-03 15:24:18,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:24:18,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411628730] [2025-03-03 15:24:18,910 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 15:24:18,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:24:18,958 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 147 statements into 2 equivalence classes. [2025-03-03 15:24:18,969 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 22 of 147 statements. [2025-03-03 15:24:18,969 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-03 15:24:18,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:24:19,101 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 425 trivial. 0 not checked. [2025-03-03 15:24:19,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:24:19,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411628730] [2025-03-03 15:24:19,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411628730] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:24:19,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:24:19,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:24:19,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890111872] [2025-03-03 15:24:19,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:24:19,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 15:24:19,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:24:19,102 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 15:24:19,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:24:19,102 INFO L87 Difference]: Start difference. First operand 306 states and 478 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-03 15:24:19,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:24:19,278 INFO L93 Difference]: Finished difference Result 866 states and 1366 transitions. [2025-03-03 15:24:19,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:24:19,279 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 147 [2025-03-03 15:24:19,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:24:19,282 INFO L225 Difference]: With dead ends: 866 [2025-03-03 15:24:19,283 INFO L226 Difference]: Without dead ends: 589 [2025-03-03 15:24:19,284 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:24:19,284 INFO L435 NwaCegarLoop]: 299 mSDtfsCounter, 238 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 835 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:24:19,284 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 835 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:24:19,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2025-03-03 15:24:19,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 585. [2025-03-03 15:24:19,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 585 states, 361 states have (on average 1.443213296398892) internal successors, (521), 361 states have internal predecessors, (521), 191 states have call successors, (191), 32 states have call predecessors, (191), 32 states have return successors, (214), 191 states have call predecessors, (214), 191 states have call successors, (214) [2025-03-03 15:24:19,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 926 transitions. [2025-03-03 15:24:19,322 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 926 transitions. Word has length 147 [2025-03-03 15:24:19,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:24:19,322 INFO L471 AbstractCegarLoop]: Abstraction has 585 states and 926 transitions. [2025-03-03 15:24:19,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-03 15:24:19,322 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 926 transitions. [2025-03-03 15:24:19,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-03 15:24:19,327 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:24:19,327 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 6, 4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:24:19,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 15:24:19,327 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:24:19,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:24:19,328 INFO L85 PathProgramCache]: Analyzing trace with hash -683488757, now seen corresponding path program 1 times [2025-03-03 15:24:19,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:24:19,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060101927] [2025-03-03 15:24:19,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:24:19,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:24:19,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-03 15:24:19,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-03 15:24:19,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:24:19,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:24:19,751 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 425 trivial. 0 not checked. [2025-03-03 15:24:19,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:24:19,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060101927] [2025-03-03 15:24:19,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060101927] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:24:19,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:24:19,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:24:19,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056417484] [2025-03-03 15:24:19,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:24:19,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 15:24:19,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:24:19,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 15:24:19,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:24:19,753 INFO L87 Difference]: Start difference. First operand 585 states and 926 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-03 15:24:19,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:24:19,959 INFO L93 Difference]: Finished difference Result 1086 states and 1705 transitions. [2025-03-03 15:24:19,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:24:19,959 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 147 [2025-03-03 15:24:19,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:24:19,966 INFO L225 Difference]: With dead ends: 1086 [2025-03-03 15:24:19,966 INFO L226 Difference]: Without dead ends: 516 [2025-03-03 15:24:19,969 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:24:19,971 INFO L435 NwaCegarLoop]: 299 mSDtfsCounter, 234 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 836 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:24:19,971 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 836 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:24:19,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2025-03-03 15:24:20,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 512. [2025-03-03 15:24:20,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 512 states, 318 states have (on average 1.3584905660377358) internal successors, (432), 317 states have internal predecessors, (432), 164 states have call successors, (164), 29 states have call predecessors, (164), 29 states have return successors, (179), 165 states have call predecessors, (179), 164 states have call successors, (179) [2025-03-03 15:24:20,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 775 transitions. [2025-03-03 15:24:20,016 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 775 transitions. Word has length 147 [2025-03-03 15:24:20,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:24:20,016 INFO L471 AbstractCegarLoop]: Abstraction has 512 states and 775 transitions. [2025-03-03 15:24:20,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-03 15:24:20,017 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 775 transitions. [2025-03-03 15:24:20,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-03 15:24:20,019 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:24:20,020 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 6, 4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:24:20,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 15:24:20,020 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:24:20,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:24:20,020 INFO L85 PathProgramCache]: Analyzing trace with hash -17412305, now seen corresponding path program 1 times [2025-03-03 15:24:20,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:24:20,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002363253] [2025-03-03 15:24:20,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:24:20,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:24:20,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-03 15:24:20,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-03 15:24:20,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:24:20,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:24:20,548 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 425 trivial. 0 not checked. [2025-03-03 15:24:20,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:24:20,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002363253] [2025-03-03 15:24:20,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002363253] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:24:20,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:24:20,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:24:20,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173523355] [2025-03-03 15:24:20,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:24:20,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:24:20,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:24:20,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:24:20,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:24:20,550 INFO L87 Difference]: Start difference. First operand 512 states and 775 transitions. Second operand has 5 states, 4 states have (on average 12.5) internal successors, (50), 5 states have internal predecessors, (50), 4 states have call successors, (18), 1 states have call predecessors, (18), 2 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-03 15:24:20,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:24:20,914 INFO L93 Difference]: Finished difference Result 559 states and 833 transitions. [2025-03-03 15:24:20,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 15:24:20,914 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 12.5) internal successors, (50), 5 states have internal predecessors, (50), 4 states have call successors, (18), 1 states have call predecessors, (18), 2 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) Word has length 147 [2025-03-03 15:24:20,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:24:20,919 INFO L225 Difference]: With dead ends: 559 [2025-03-03 15:24:20,920 INFO L226 Difference]: Without dead ends: 489 [2025-03-03 15:24:20,920 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:24:20,921 INFO L435 NwaCegarLoop]: 287 mSDtfsCounter, 234 mSDsluCounter, 784 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 1071 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:24:20,921 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 1071 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:24:20,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2025-03-03 15:24:20,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 485. [2025-03-03 15:24:20,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 485 states, 305 states have (on average 1.3573770491803279) internal successors, (414), 306 states have internal predecessors, (414), 148 states have call successors, (148), 29 states have call predecessors, (148), 31 states have return successors, (167), 149 states have call predecessors, (167), 148 states have call successors, (167) [2025-03-03 15:24:20,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 729 transitions. [2025-03-03 15:24:20,960 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 729 transitions. Word has length 147 [2025-03-03 15:24:20,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:24:20,960 INFO L471 AbstractCegarLoop]: Abstraction has 485 states and 729 transitions. [2025-03-03 15:24:20,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 12.5) internal successors, (50), 5 states have internal predecessors, (50), 4 states have call successors, (18), 1 states have call predecessors, (18), 2 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-03 15:24:20,961 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 729 transitions. [2025-03-03 15:24:20,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-03 15:24:20,964 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:24:20,964 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 6, 4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:24:20,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 15:24:20,964 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:24:20,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:24:20,965 INFO L85 PathProgramCache]: Analyzing trace with hash 887032299, now seen corresponding path program 1 times [2025-03-03 15:24:20,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:24:20,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44332811] [2025-03-03 15:24:20,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:24:20,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:24:21,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-03 15:24:21,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-03 15:24:21,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:24:21,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:24:21,692 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 410 trivial. 0 not checked. [2025-03-03 15:24:21,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:24:21,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44332811] [2025-03-03 15:24:21,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44332811] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:24:21,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1248763592] [2025-03-03 15:24:21,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:24:21,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:24:21,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:24:21,695 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) [2025-03-03 15:24:21,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 15:24:21,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-03 15:24:22,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-03 15:24:22,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:24:22,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:24:22,055 INFO L256 TraceCheckSpWp]: Trace formula consists of 1187 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-03 15:24:22,059 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:24:22,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-03 15:24:22,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-03 15:24:22,102 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 [2025-03-03 15:24:22,105 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 [2025-03-03 15:24:22,212 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2025-03-03 15:24:22,212 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 15:24:22,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1248763592] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:24:22,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 15:24:22,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2025-03-03 15:24:22,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880958517] [2025-03-03 15:24:22,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:24:22,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:24:22,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:24:22,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:24:22,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-03 15:24:22,214 INFO L87 Difference]: Start difference. First operand 485 states and 729 transitions. Second operand has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 4 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-03 15:24:23,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:24:23,227 INFO L93 Difference]: Finished difference Result 532 states and 787 transitions. [2025-03-03 15:24:23,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 15:24:23,227 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 4 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) Word has length 147 [2025-03-03 15:24:23,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:24:23,230 INFO L225 Difference]: With dead ends: 532 [2025-03-03 15:24:23,230 INFO L226 Difference]: Without dead ends: 445 [2025-03-03 15:24:23,232 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-03-03 15:24:23,233 INFO L435 NwaCegarLoop]: 323 mSDtfsCounter, 213 mSDsluCounter, 705 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 1028 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 15:24:23,233 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 1028 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 15:24:23,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2025-03-03 15:24:23,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 435. [2025-03-03 15:24:23,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 435 states, 275 states have (on average 1.3636363636363635) internal successors, (375), 276 states have internal predecessors, (375), 132 states have call successors, (132), 25 states have call predecessors, (132), 27 states have return successors, (150), 133 states have call predecessors, (150), 132 states have call successors, (150) [2025-03-03 15:24:23,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 657 transitions. [2025-03-03 15:24:23,270 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 657 transitions. Word has length 147 [2025-03-03 15:24:23,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:24:23,270 INFO L471 AbstractCegarLoop]: Abstraction has 435 states and 657 transitions. [2025-03-03 15:24:23,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 4 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-03 15:24:23,270 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 657 transitions. [2025-03-03 15:24:23,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-03-03 15:24:23,273 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:24:23,273 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 8, 8, 8, 8, 8, 6, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:24:23,282 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 15:24:23,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:24:23,473 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:24:23,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:24:23,474 INFO L85 PathProgramCache]: Analyzing trace with hash -2141158885, now seen corresponding path program 1 times [2025-03-03 15:24:23,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:24:23,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589587339] [2025-03-03 15:24:23,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:24:23,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:24:23,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-03-03 15:24:23,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-03-03 15:24:23,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:24:23,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:24:23,864 INFO L134 CoverageAnalysis]: Checked inductivity of 790 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 786 trivial. 0 not checked. [2025-03-03 15:24:23,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:24:23,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589587339] [2025-03-03 15:24:23,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589587339] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:24:23,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1149361796] [2025-03-03 15:24:23,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:24:23,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:24:23,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:24:23,867 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) [2025-03-03 15:24:23,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 15:24:24,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-03-03 15:24:24,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-03-03 15:24:24,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:24:24,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:24:24,292 INFO L256 TraceCheckSpWp]: Trace formula consists of 1537 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-03 15:24:24,297 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:24:24,394 INFO L134 CoverageAnalysis]: Checked inductivity of 790 backedges. 320 proven. 4 refuted. 0 times theorem prover too weak. 466 trivial. 0 not checked. [2025-03-03 15:24:24,394 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 15:24:24,763 INFO L134 CoverageAnalysis]: Checked inductivity of 790 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 786 trivial. 0 not checked. [2025-03-03 15:24:24,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1149361796] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 15:24:24,764 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 15:24:24,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 5] total 11 [2025-03-03 15:24:24,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941515559] [2025-03-03 15:24:24,764 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 15:24:24,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 15:24:24,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:24:24,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 15:24:24,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2025-03-03 15:24:24,765 INFO L87 Difference]: Start difference. First operand 435 states and 657 transitions. Second operand has 11 states, 11 states have (on average 8.181818181818182) internal successors, (90), 11 states have internal predecessors, (90), 9 states have call successors, (50), 5 states have call predecessors, (50), 6 states have return successors, (51), 7 states have call predecessors, (51), 9 states have call successors, (51) [2025-03-03 15:24:25,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:24:25,673 INFO L93 Difference]: Finished difference Result 1083 states and 1667 transitions. [2025-03-03 15:24:25,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 15:24:25,674 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.181818181818182) internal successors, (90), 11 states have internal predecessors, (90), 9 states have call successors, (50), 5 states have call predecessors, (50), 6 states have return successors, (51), 7 states have call predecessors, (51), 9 states have call successors, (51) Word has length 206 [2025-03-03 15:24:25,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:24:25,679 INFO L225 Difference]: With dead ends: 1083 [2025-03-03 15:24:25,679 INFO L226 Difference]: Without dead ends: 683 [2025-03-03 15:24:25,681 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 411 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2025-03-03 15:24:25,682 INFO L435 NwaCegarLoop]: 256 mSDtfsCounter, 428 mSDsluCounter, 729 mSDsCounter, 0 mSdLazyCounter, 810 mSolverCounterSat, 255 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 473 SdHoareTripleChecker+Valid, 985 SdHoareTripleChecker+Invalid, 1065 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 255 IncrementalHoareTripleChecker+Valid, 810 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 15:24:25,682 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [473 Valid, 985 Invalid, 1065 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [255 Valid, 810 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 15:24:25,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2025-03-03 15:24:25,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 666. [2025-03-03 15:24:25,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 666 states, 415 states have (on average 1.3855421686746987) internal successors, (575), 418 states have internal predecessors, (575), 205 states have call successors, (205), 43 states have call predecessors, (205), 45 states have return successors, (237), 204 states have call predecessors, (237), 205 states have call successors, (237) [2025-03-03 15:24:25,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 1017 transitions. [2025-03-03 15:24:25,719 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 1017 transitions. Word has length 206 [2025-03-03 15:24:25,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:24:25,719 INFO L471 AbstractCegarLoop]: Abstraction has 666 states and 1017 transitions. [2025-03-03 15:24:25,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.181818181818182) internal successors, (90), 11 states have internal predecessors, (90), 9 states have call successors, (50), 5 states have call predecessors, (50), 6 states have return successors, (51), 7 states have call predecessors, (51), 9 states have call successors, (51) [2025-03-03 15:24:25,720 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 1017 transitions. [2025-03-03 15:24:25,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-03-03 15:24:25,724 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:24:25,724 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 8, 8, 8, 8, 8, 6, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:24:25,733 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-03 15:24:25,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:24:25,925 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:24:25,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:24:25,925 INFO L85 PathProgramCache]: Analyzing trace with hash 221840987, now seen corresponding path program 1 times [2025-03-03 15:24:25,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:24:25,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013544440] [2025-03-03 15:24:25,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:24:25,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:24:25,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-03-03 15:24:26,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-03-03 15:24:26,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:24:26,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:24:27,237 INFO L134 CoverageAnalysis]: Checked inductivity of 790 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 786 trivial. 0 not checked. [2025-03-03 15:24:27,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:24:27,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013544440] [2025-03-03 15:24:27,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013544440] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:24:27,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [698272479] [2025-03-03 15:24:27,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:24:27,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:24:27,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:24:27,240 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) [2025-03-03 15:24:27,241 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 15:24:27,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-03-03 15:24:27,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-03-03 15:24:27,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:24:27,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:24:27,693 INFO L256 TraceCheckSpWp]: Trace formula consists of 1635 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-03-03 15:24:27,698 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:24:27,875 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 [2025-03-03 15:24:29,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 15:24:29,927 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 15:24:29,927 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 25 treesize of output 15 [2025-03-03 15:24:30,575 INFO L349 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2025-03-03 15:24:30,576 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 1 case distinctions, treesize of input 25 treesize of output 24 [2025-03-03 15:24:40,833 INFO L134 CoverageAnalysis]: Checked inductivity of 790 backedges. 473 proven. 4 refuted. 0 times theorem prover too weak. 313 trivial. 0 not checked. [2025-03-03 15:24:40,833 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 15:24:41,020 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 23 [2025-03-03 15:24:41,026 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 31 [2025-03-03 15:24:41,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 20 treesize of output 18 [2025-03-03 15:24:41,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 26 treesize of output 22 [2025-03-03 15:24:41,380 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2025-03-03 15:24:41,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 26 treesize of output 22 [2025-03-03 15:24:41,508 INFO L134 CoverageAnalysis]: Checked inductivity of 790 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 786 trivial. 0 not checked. [2025-03-03 15:24:41,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [698272479] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 15:24:41,508 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 15:24:41,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14, 9] total 37 [2025-03-03 15:24:41,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904235142] [2025-03-03 15:24:41,508 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 15:24:41,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-03-03 15:24:41,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:24:41,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-03-03 15:24:41,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=1192, Unknown=1, NotChecked=0, Total=1332 [2025-03-03 15:24:41,510 INFO L87 Difference]: Start difference. First operand 666 states and 1017 transitions. Second operand has 37 states, 34 states have (on average 4.5588235294117645) internal successors, (155), 35 states have internal predecessors, (155), 18 states have call successors, (66), 12 states have call predecessors, (66), 14 states have return successors, (66), 16 states have call predecessors, (66), 18 states have call successors, (66) [2025-03-03 15:24:43,546 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-03 15:24:49,115 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-03 15:24:50,295 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-03 15:24:52,708 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-03 15:24:57,515 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-03 15:25:01,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:25:01,991 INFO L93 Difference]: Finished difference Result 1310 states and 2048 transitions. [2025-03-03 15:25:01,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-03 15:25:01,992 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 34 states have (on average 4.5588235294117645) internal successors, (155), 35 states have internal predecessors, (155), 18 states have call successors, (66), 12 states have call predecessors, (66), 14 states have return successors, (66), 16 states have call predecessors, (66), 18 states have call successors, (66) Word has length 206 [2025-03-03 15:25:01,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:25:02,002 INFO L225 Difference]: With dead ends: 1310 [2025-03-03 15:25:02,002 INFO L226 Difference]: Without dead ends: 764 [2025-03-03 15:25:02,005 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 460 GetRequests, 389 SyntacticMatches, 8 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 991 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=672, Invalid=3487, Unknown=1, NotChecked=0, Total=4160 [2025-03-03 15:25:02,006 INFO L435 NwaCegarLoop]: 229 mSDtfsCounter, 1816 mSDsluCounter, 2074 mSDsCounter, 0 mSdLazyCounter, 3163 mSolverCounterSat, 1609 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1816 SdHoareTripleChecker+Valid, 2303 SdHoareTripleChecker+Invalid, 4774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1609 IncrementalHoareTripleChecker+Valid, 3163 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:25:02,006 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1816 Valid, 2303 Invalid, 4774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1609 Valid, 3163 Invalid, 2 Unknown, 0 Unchecked, 19.2s Time] [2025-03-03 15:25:02,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2025-03-03 15:25:02,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 715. [2025-03-03 15:25:02,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 715 states, 445 states have (on average 1.3842696629213482) internal successors, (616), 451 states have internal predecessors, (616), 219 states have call successors, (219), 43 states have call predecessors, (219), 50 states have return successors, (276), 220 states have call predecessors, (276), 219 states have call successors, (276) [2025-03-03 15:25:02,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 1111 transitions. [2025-03-03 15:25:02,065 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 1111 transitions. Word has length 206 [2025-03-03 15:25:02,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:25:02,066 INFO L471 AbstractCegarLoop]: Abstraction has 715 states and 1111 transitions. [2025-03-03 15:25:02,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 34 states have (on average 4.5588235294117645) internal successors, (155), 35 states have internal predecessors, (155), 18 states have call successors, (66), 12 states have call predecessors, (66), 14 states have return successors, (66), 16 states have call predecessors, (66), 18 states have call successors, (66) [2025-03-03 15:25:02,066 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 1111 transitions. [2025-03-03 15:25:02,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2025-03-03 15:25:02,070 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:25:02,071 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 9, 9, 9, 9, 9, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:25:02,081 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-03 15:25:02,275 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,SelfDestructingSolverStorable10 [2025-03-03 15:25:02,275 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:25:02,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:25:02,275 INFO L85 PathProgramCache]: Analyzing trace with hash 94454374, now seen corresponding path program 1 times [2025-03-03 15:25:02,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:25:02,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948342667] [2025-03-03 15:25:02,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:25:02,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:25:02,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-03-03 15:25:02,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-03-03 15:25:02,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:25:02,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:25:04,460 INFO L134 CoverageAnalysis]: Checked inductivity of 910 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 898 trivial. 0 not checked. [2025-03-03 15:25:04,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:25:04,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948342667] [2025-03-03 15:25:04,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948342667] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:25:04,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [532182074] [2025-03-03 15:25:04,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:25:04,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:25:04,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:25:04,463 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) [2025-03-03 15:25:04,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 15:25:04,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-03-03 15:25:05,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-03-03 15:25:05,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:25:05,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:25:05,032 INFO L256 TraceCheckSpWp]: Trace formula consists of 1832 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-03-03 15:25:05,041 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:25:05,252 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 23 treesize of output 1 [2025-03-03 15:25:06,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 15:25:06,870 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 15:25:06,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 50 [2025-03-03 15:25:07,044 INFO L349 Elim1Store]: treesize reduction 58, result has 61.3 percent of original size [2025-03-03 15:25:07,044 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 6 case distinctions, treesize of input 57 treesize of output 122 [2025-03-03 15:25:11,794 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 15:25:11,795 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 39 treesize of output 29 [2025-03-03 15:25:11,833 INFO L134 CoverageAnalysis]: Checked inductivity of 910 backedges. 495 proven. 102 refuted. 0 times theorem prover too weak. 313 trivial. 0 not checked. [2025-03-03 15:25:11,833 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 15:25:12,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2025-03-03 15:25:12,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 58 treesize of output 54 [2025-03-03 15:25:12,347 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 19 [2025-03-03 15:25:12,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2025-03-03 15:25:12,418 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 19 [2025-03-03 15:25:12,421 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2025-03-03 15:25:12,640 INFO L134 CoverageAnalysis]: Checked inductivity of 910 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 898 trivial. 0 not checked. [2025-03-03 15:25:12,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [532182074] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 15:25:12,641 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 15:25:12,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 19, 14] total 41 [2025-03-03 15:25:12,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841485288] [2025-03-03 15:25:12,642 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 15:25:12,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-03-03 15:25:12,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:25:12,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-03-03 15:25:12,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=1482, Unknown=3, NotChecked=0, Total=1640 [2025-03-03 15:25:12,645 INFO L87 Difference]: Start difference. First operand 715 states and 1111 transitions. Second operand has 41 states, 37 states have (on average 4.621621621621622) internal successors, (171), 38 states have internal predecessors, (171), 20 states have call successors, (69), 12 states have call predecessors, (69), 15 states have return successors, (69), 18 states have call predecessors, (69), 20 states have call successors, (69) [2025-03-03 15:25:16,706 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-03 15:25:20,470 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.68s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-03 15:25:25,589 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-03 15:25:27,744 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-03 15:25:30,297 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.55s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-03 15:25:36,174 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-03 15:25:39,147 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0]