./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-pthread/cs_fib_longer-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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_fib_longer-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 583ab92a7056287b3071cc8588dd414024160b1da2815b90013f83f6f32564a1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 19:42:25,358 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 19:42:25,418 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 19:42:25,421 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 19:42:25,422 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 19:42:25,438 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 19:42:25,439 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 19:42:25,439 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 19:42:25,439 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 19:42:25,439 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 19:42:25,440 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 19:42:25,440 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 19:42:25,440 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 19:42:25,443 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 19:42:25,444 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 19:42:25,444 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 19:42:25,444 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 19:42:25,444 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 19:42:25,444 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 19:42:25,444 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 19:42:25,444 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 19:42:25,444 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 19:42:25,444 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 19:42:25,444 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 19:42:25,444 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 19:42:25,444 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 19:42:25,444 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 19:42:25,444 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 19:42:25,444 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 19:42:25,444 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 19:42:25,444 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 19:42:25,444 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 19:42:25,445 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:42:25,445 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 19:42:25,445 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 19:42:25,445 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 19:42:25,445 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 19:42:25,445 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 19:42:25,445 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 19:42:25,445 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 19:42:25,445 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 19:42:25,445 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 19:42:25,445 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 19:42:25,445 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 -> 583ab92a7056287b3071cc8588dd414024160b1da2815b90013f83f6f32564a1 [2025-03-16 19:42:25,653 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 19:42:25,662 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 19:42:25,663 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 19:42:25,665 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 19:42:25,665 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 19:42:25,666 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-pthread/cs_fib_longer-2.i [2025-03-16 19:42:26,839 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d63ac0bc/2d20e5bd93224439ba9aab8c5375a7aa/FLAG84bcae498 [2025-03-16 19:42:27,152 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 19:42:27,155 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_fib_longer-2.i [2025-03-16 19:42:27,173 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d63ac0bc/2d20e5bd93224439ba9aab8c5375a7aa/FLAG84bcae498 [2025-03-16 19:42:27,188 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d63ac0bc/2d20e5bd93224439ba9aab8c5375a7aa [2025-03-16 19:42:27,193 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 19:42:27,194 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 19:42:27,195 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 19:42:27,197 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 19:42:27,200 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 19:42:27,201 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:42:27" (1/1) ... [2025-03-16 19:42:27,202 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70fed181 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:42:27, skipping insertion in model container [2025-03-16 19:42:27,202 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:42:27" (1/1) ... [2025-03-16 19:42:27,234 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 19:42:27,450 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_fib_longer-2.i[23464,23477] [2025-03-16 19:42:27,530 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:42:27,541 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 19:42:27,566 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_fib_longer-2.i[23464,23477] [2025-03-16 19:42:27,628 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:42:27,656 INFO L204 MainTranslator]: Completed translation [2025-03-16 19:42:27,656 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:42:27 WrapperNode [2025-03-16 19:42:27,657 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 19:42:27,657 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 19:42:27,657 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 19:42:27,657 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 19:42:27,661 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:42:27" (1/1) ... [2025-03-16 19:42:27,679 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:42:27" (1/1) ... [2025-03-16 19:42:27,715 INFO L138 Inliner]: procedures = 145, calls = 444, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 768 [2025-03-16 19:42:27,715 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 19:42:27,716 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 19:42:27,716 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 19:42:27,716 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 19:42:27,722 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:42:27" (1/1) ... [2025-03-16 19:42:27,722 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:42:27" (1/1) ... [2025-03-16 19:42:27,727 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:42:27" (1/1) ... [2025-03-16 19:42:27,762 INFO L175 MemorySlicer]: Split 308 memory accesses to 15 slices as follows [2, 8, 8, 8, 13, 2, 62, 57, 25, 37, 0, 25, 11, 13, 37]. 20 percent of accesses are in the largest equivalence class. The 74 initializations are split as follows [2, 3, 3, 3, 0, 0, 21, 21, 7, 0, 0, 7, 7, 0, 0]. The 71 writes are split as follows [0, 2, 2, 2, 1, 2, 23, 18, 8, 1, 0, 8, 2, 1, 1]. [2025-03-16 19:42:27,763 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:42:27" (1/1) ... [2025-03-16 19:42:27,763 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:42:27" (1/1) ... [2025-03-16 19:42:27,802 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:42:27" (1/1) ... [2025-03-16 19:42:27,806 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:42:27" (1/1) ... [2025-03-16 19:42:27,811 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:42:27" (1/1) ... [2025-03-16 19:42:27,814 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:42:27" (1/1) ... [2025-03-16 19:42:27,827 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 19:42:27,831 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 19:42:27,831 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 19:42:27,831 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 19:42:27,832 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:42:27" (1/1) ... [2025-03-16 19:42:27,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:42:27,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:42:27,857 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-16 19:42:27,863 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-16 19:42:27,885 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-16 19:42:27,885 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-16 19:42:27,885 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-16 19:42:27,885 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-16 19:42:27,885 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-16 19:42:27,885 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-16 19:42:27,885 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-16 19:42:27,885 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-16 19:42:27,885 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-16 19:42:27,885 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-16 19:42:27,885 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-16 19:42:27,885 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-03-16 19:42:27,885 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-03-16 19:42:27,885 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-03-16 19:42:27,885 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-03-16 19:42:27,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-16 19:42:27,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-16 19:42:27,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-16 19:42:27,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-16 19:42:27,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-16 19:42:27,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-16 19:42:27,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-16 19:42:27,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-16 19:42:27,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-16 19:42:27,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-16 19:42:27,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-16 19:42:27,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-03-16 19:42:27,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-03-16 19:42:27,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-03-16 19:42:27,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-03-16 19:42:27,886 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-16 19:42:27,886 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-16 19:42:27,886 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 19:42:27,886 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-16 19:42:27,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-16 19:42:27,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-16 19:42:27,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-16 19:42:27,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-16 19:42:27,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-16 19:42:27,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-16 19:42:27,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-16 19:42:27,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-03-16 19:42:27,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-03-16 19:42:27,887 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-03-16 19:42:27,887 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-03-16 19:42:27,887 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-03-16 19:42:27,887 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-03-16 19:42:27,887 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-03-16 19:42:27,887 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-03-16 19:42:27,887 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_create [2025-03-16 19:42:27,887 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_create [2025-03-16 19:42:27,887 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-16 19:42:27,887 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-16 19:42:27,887 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-16 19:42:27,887 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-16 19:42:27,887 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-16 19:42:27,887 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-16 19:42:27,887 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-16 19:42:27,887 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-03-16 19:42:27,887 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-03-16 19:42:27,887 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-03-16 19:42:27,887 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-03-16 19:42:27,887 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-03-16 19:42:27,887 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-03-16 19:42:27,887 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-03-16 19:42:27,887 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-03-16 19:42:27,887 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~$Pointer$ [2025-03-16 19:42:27,887 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~$Pointer$ [2025-03-16 19:42:27,887 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-16 19:42:27,887 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-16 19:42:27,887 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-16 19:42:27,887 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-16 19:42:27,887 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-03-16 19:42:27,887 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-03-16 19:42:27,887 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-03-16 19:42:27,887 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-03-16 19:42:27,887 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-03-16 19:42:27,887 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-03-16 19:42:27,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-03-16 19:42:27,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-03-16 19:42:27,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-03-16 19:42:27,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-03-16 19:42:27,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-03-16 19:42:27,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2025-03-16 19:42:27,888 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_cs [2025-03-16 19:42:27,888 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_cs [2025-03-16 19:42:27,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 19:42:27,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-16 19:42:27,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-16 19:42:27,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-16 19:42:27,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-16 19:42:27,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-16 19:42:27,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-16 19:42:27,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-16 19:42:27,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-16 19:42:27,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-16 19:42:27,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-16 19:42:27,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-16 19:42:27,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-16 19:42:27,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-16 19:42:27,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-16 19:42:27,892 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 19:42:27,892 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 19:42:28,079 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 19:42:28,081 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 19:42:28,364 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L733-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_~#id1~0#1.base, main_thread_~#id1~0#1.offset);havoc main_thread_~#id1~0#1.base, main_thread_~#id1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#id2~0#1.base, main_thread_~#id2~0#1.offset);havoc main_thread_~#id2~0#1.base, main_thread_~#id2~0#1.offset; [2025-03-16 19:42:28,364 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L733-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-16 19:42:28,364 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L733-2: SUMMARY for call __CS_cs(); srcloc: null [2025-03-16 19:42:28,364 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L729-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_~#id1~0#1.base, main_thread_~#id1~0#1.offset);havoc main_thread_~#id1~0#1.base, main_thread_~#id1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#id2~0#1.base, main_thread_~#id2~0#1.offset);havoc main_thread_~#id2~0#1.base, main_thread_~#id2~0#1.offset; [2025-03-16 19:42:28,364 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L729-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-16 19:42:28,364 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L729-2: SUMMARY for call __CS_cs(); srcloc: null [2025-03-16 19:42:28,364 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L731-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_~#id1~0#1.base, main_thread_~#id1~0#1.offset);havoc main_thread_~#id1~0#1.base, main_thread_~#id1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#id2~0#1.base, main_thread_~#id2~0#1.offset);havoc main_thread_~#id2~0#1.base, main_thread_~#id2~0#1.offset; [2025-03-16 19:42:28,364 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L731-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-16 19:42:28,364 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L731-2: SUMMARY for call __CS_cs(); srcloc: null [2025-03-16 19:42:32,796 INFO L? ?]: Removed 72 outVars from TransFormulas that were not future-live. [2025-03-16 19:42:32,797 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 19:42:32,806 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 19:42:32,806 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 19:42:32,807 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:42:32 BoogieIcfgContainer [2025-03-16 19:42:32,807 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 19:42:32,808 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 19:42:32,808 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 19:42:32,813 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 19:42:32,813 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 07:42:27" (1/3) ... [2025-03-16 19:42:32,814 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f5ddf02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:42:32, skipping insertion in model container [2025-03-16 19:42:32,814 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:42:27" (2/3) ... [2025-03-16 19:42:32,814 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f5ddf02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:42:32, skipping insertion in model container [2025-03-16 19:42:32,814 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:42:32" (3/3) ... [2025-03-16 19:42:32,816 INFO L128 eAbstractionObserver]: Analyzing ICFG cs_fib_longer-2.i [2025-03-16 19:42:32,825 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 19:42:32,828 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG cs_fib_longer-2.i that has 5 procedures, 181 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2025-03-16 19:42:32,881 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 19:42:32,892 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;@da0f0d6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 19:42:32,893 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 19:42:32,896 INFO L276 IsEmpty]: Start isEmpty. Operand has 181 states, 108 states have (on average 1.3055555555555556) internal successors, (141), 109 states have internal predecessors, (141), 67 states have call successors, (67), 4 states have call predecessors, (67), 4 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67) [2025-03-16 19:42:32,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2025-03-16 19:42:32,908 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:42:32,909 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:42:32,909 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:42:32,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:42:32,913 INFO L85 PathProgramCache]: Analyzing trace with hash 675062362, now seen corresponding path program 1 times [2025-03-16 19:42:32,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:42:32,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260558745] [2025-03-16 19:42:32,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:42:32,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:42:33,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 298 statements into 1 equivalence classes. [2025-03-16 19:42:33,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 298 of 298 statements. [2025-03-16 19:42:33,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:42:33,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:42:33,897 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2025-03-16 19:42:33,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:42:33,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260558745] [2025-03-16 19:42:33,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260558745] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:42:33,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:42:33,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:42:33,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495897924] [2025-03-16 19:42:33,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:42:33,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:42:33,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:42:33,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:42:33,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:42:33,926 INFO L87 Difference]: Start difference. First operand has 181 states, 108 states have (on average 1.3055555555555556) internal successors, (141), 109 states have internal predecessors, (141), 67 states have call successors, (67), 4 states have call predecessors, (67), 4 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67) Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-03-16 19:42:37,966 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-16 19:42:38,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:42:38,023 INFO L93 Difference]: Finished difference Result 361 states and 614 transitions. [2025-03-16 19:42:38,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:42:38,025 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) Word has length 298 [2025-03-16 19:42:38,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:42:38,031 INFO L225 Difference]: With dead ends: 361 [2025-03-16 19:42:38,031 INFO L226 Difference]: Without dead ends: 180 [2025-03-16 19:42:38,036 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-16 19:42:38,037 INFO L435 NwaCegarLoop]: 270 mSDtfsCounter, 2 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:42:38,038 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 537 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 1 Unknown, 0 Unchecked, 4.0s Time] [2025-03-16 19:42:38,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2025-03-16 19:42:38,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 179. [2025-03-16 19:42:38,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 107 states have (on average 1.280373831775701) internal successors, (137), 107 states have internal predecessors, (137), 67 states have call successors, (67), 4 states have call predecessors, (67), 4 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67) [2025-03-16 19:42:38,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 271 transitions. [2025-03-16 19:42:38,090 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 271 transitions. Word has length 298 [2025-03-16 19:42:38,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:42:38,091 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 271 transitions. [2025-03-16 19:42:38,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-03-16 19:42:38,091 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 271 transitions. [2025-03-16 19:42:38,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2025-03-16 19:42:38,096 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:42:38,096 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:42:38,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 19:42:38,097 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:42:38,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:42:38,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1202718036, now seen corresponding path program 1 times [2025-03-16 19:42:38,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:42:38,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522221447] [2025-03-16 19:42:38,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:42:38,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:42:38,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 300 statements into 1 equivalence classes. [2025-03-16 19:42:38,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 300 of 300 statements. [2025-03-16 19:42:38,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:42:38,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:42:38,639 INFO L134 CoverageAnalysis]: Checked inductivity of 4513 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2025-03-16 19:42:38,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:42:38,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522221447] [2025-03-16 19:42:38,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522221447] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:42:38,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:42:38,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:42:38,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525378897] [2025-03-16 19:42:38,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:42:38,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:42:38,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:42:38,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:42:38,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:42:38,645 INFO L87 Difference]: Start difference. First operand 179 states and 271 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-03-16 19:42:38,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:42:38,696 INFO L93 Difference]: Finished difference Result 357 states and 542 transitions. [2025-03-16 19:42:38,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:42:38,697 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) Word has length 300 [2025-03-16 19:42:38,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:42:38,699 INFO L225 Difference]: With dead ends: 357 [2025-03-16 19:42:38,699 INFO L226 Difference]: Without dead ends: 180 [2025-03-16 19:42:38,702 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-16 19:42:38,702 INFO L435 NwaCegarLoop]: 269 mSDtfsCounter, 0 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 535 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-16 19:42:38,702 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 535 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:42:38,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2025-03-16 19:42:38,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2025-03-16 19:42:38,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 108 states have (on average 1.2777777777777777) internal successors, (138), 108 states have internal predecessors, (138), 67 states have call successors, (67), 4 states have call predecessors, (67), 4 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67) [2025-03-16 19:42:38,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 272 transitions. [2025-03-16 19:42:38,722 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 272 transitions. Word has length 300 [2025-03-16 19:42:38,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:42:38,723 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 272 transitions. [2025-03-16 19:42:38,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-03-16 19:42:38,724 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 272 transitions. [2025-03-16 19:42:38,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2025-03-16 19:42:38,728 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:42:38,729 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:42:38,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 19:42:38,729 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:42:38,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:42:38,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1409021985, now seen corresponding path program 1 times [2025-03-16 19:42:38,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:42:38,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905221946] [2025-03-16 19:42:38,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:42:38,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:42:38,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 301 statements into 1 equivalence classes. [2025-03-16 19:42:38,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 301 of 301 statements. [2025-03-16 19:42:38,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:42:38,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:42:39,180 INFO L134 CoverageAnalysis]: Checked inductivity of 4514 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2025-03-16 19:42:39,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:42:39,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905221946] [2025-03-16 19:42:39,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905221946] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:42:39,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [167311849] [2025-03-16 19:42:39,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:42:39,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:42:39,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:42:39,183 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-16 19:42:39,184 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-16 19:42:39,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 301 statements into 1 equivalence classes. [2025-03-16 19:42:39,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 301 of 301 statements. [2025-03-16 19:42:39,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:42:39,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:42:39,778 INFO L256 TraceCheckSpWp]: Trace formula consists of 1623 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 19:42:39,790 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:42:39,838 INFO L134 CoverageAnalysis]: Checked inductivity of 4514 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2025-03-16 19:42:39,838 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:42:40,293 INFO L134 CoverageAnalysis]: Checked inductivity of 4514 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2025-03-16 19:42:40,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [167311849] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:42:40,294 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:42:40,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-03-16 19:42:40,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150437643] [2025-03-16 19:42:40,294 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:42:40,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:42:40,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:42:40,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:42:40,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:42:40,296 INFO L87 Difference]: Start difference. First operand 180 states and 272 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 1 states have call successors, (96), 2 states have call predecessors, (96), 2 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) [2025-03-16 19:42:40,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:42:40,348 INFO L93 Difference]: Finished difference Result 360 states and 546 transitions. [2025-03-16 19:42:40,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:42:40,349 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 1 states have call successors, (96), 2 states have call predecessors, (96), 2 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) Word has length 301 [2025-03-16 19:42:40,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:42:40,351 INFO L225 Difference]: With dead ends: 360 [2025-03-16 19:42:40,351 INFO L226 Difference]: Without dead ends: 182 [2025-03-16 19:42:40,351 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 604 GetRequests, 599 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-16 19:42:40,352 INFO L435 NwaCegarLoop]: 269 mSDtfsCounter, 0 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 801 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-16 19:42:40,352 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 801 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:42:40,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2025-03-16 19:42:40,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2025-03-16 19:42:40,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 110 states have (on average 1.2727272727272727) internal successors, (140), 110 states have internal predecessors, (140), 67 states have call successors, (67), 4 states have call predecessors, (67), 4 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67) [2025-03-16 19:42:40,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 274 transitions. [2025-03-16 19:42:40,371 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 274 transitions. Word has length 301 [2025-03-16 19:42:40,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:42:40,371 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 274 transitions. [2025-03-16 19:42:40,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 1 states have call successors, (96), 2 states have call predecessors, (96), 2 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) [2025-03-16 19:42:40,371 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 274 transitions. [2025-03-16 19:42:40,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2025-03-16 19:42:40,374 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:42:40,374 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:42:40,385 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-16 19:42:40,579 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-16 19:42:40,579 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:42:40,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:42:40,580 INFO L85 PathProgramCache]: Analyzing trace with hash -1905123967, now seen corresponding path program 2 times [2025-03-16 19:42:40,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:42:40,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526451356] [2025-03-16 19:42:40,580 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 19:42:40,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:42:40,771 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 303 statements into 2 equivalence classes. [2025-03-16 19:42:40,813 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 16 of 303 statements. [2025-03-16 19:42:40,814 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-16 19:42:40,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:42:41,058 INFO L134 CoverageAnalysis]: Checked inductivity of 4519 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4519 trivial. 0 not checked. [2025-03-16 19:42:41,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:42:41,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526451356] [2025-03-16 19:42:41,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526451356] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:42:41,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:42:41,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:42:41,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845464777] [2025-03-16 19:42:41,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:42:41,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:42:41,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:42:41,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:42:41,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:42:41,062 INFO L87 Difference]: Start difference. First operand 182 states and 274 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-03-16 19:42:41,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:42:41,123 INFO L93 Difference]: Finished difference Result 355 states and 538 transitions. [2025-03-16 19:42:41,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:42:41,124 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) Word has length 303 [2025-03-16 19:42:41,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:42:41,127 INFO L225 Difference]: With dead ends: 355 [2025-03-16 19:42:41,127 INFO L226 Difference]: Without dead ends: 253 [2025-03-16 19:42:41,130 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-16 19:42:41,132 INFO L435 NwaCegarLoop]: 269 mSDtfsCounter, 161 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 797 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:42:41,133 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 797 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:42:41,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2025-03-16 19:42:41,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 252. [2025-03-16 19:42:41,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 158 states have (on average 1.3481012658227849) internal successors, (213), 158 states have internal predecessors, (213), 85 states have call successors, (85), 8 states have call predecessors, (85), 8 states have return successors, (87), 85 states have call predecessors, (87), 85 states have call successors, (87) [2025-03-16 19:42:41,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 385 transitions. [2025-03-16 19:42:41,153 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 385 transitions. Word has length 303 [2025-03-16 19:42:41,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:42:41,153 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 385 transitions. [2025-03-16 19:42:41,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-03-16 19:42:41,153 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 385 transitions. [2025-03-16 19:42:41,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2025-03-16 19:42:41,156 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:42:41,156 INFO L218 NwaCegarLoop]: trace histogram [52, 52, 52, 4, 4, 4, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:42:41,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 19:42:41,157 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:42:41,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:42:41,157 INFO L85 PathProgramCache]: Analyzing trace with hash 927093464, now seen corresponding path program 1 times [2025-03-16 19:42:41,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:42:41,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398860732] [2025-03-16 19:42:41,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:42:41,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:42:41,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 371 statements into 1 equivalence classes. [2025-03-16 19:42:41,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 371 of 371 statements. [2025-03-16 19:42:41,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:42:41,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:42:41,614 INFO L134 CoverageAnalysis]: Checked inductivity of 5345 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5344 trivial. 0 not checked. [2025-03-16 19:42:41,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:42:41,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398860732] [2025-03-16 19:42:41,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398860732] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:42:41,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1845404221] [2025-03-16 19:42:41,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:42:41,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:42:41,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:42:41,618 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-16 19:42:41,619 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-16 19:42:42,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 371 statements into 1 equivalence classes. [2025-03-16 19:42:42,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 371 of 371 statements. [2025-03-16 19:42:42,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:42:42,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:42:42,263 INFO L256 TraceCheckSpWp]: Trace formula consists of 2128 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 19:42:42,272 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:42:42,328 INFO L134 CoverageAnalysis]: Checked inductivity of 5345 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5344 trivial. 0 not checked. [2025-03-16 19:42:42,328 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:42:42,727 INFO L134 CoverageAnalysis]: Checked inductivity of 5345 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5344 trivial. 0 not checked. [2025-03-16 19:42:42,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1845404221] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:42:42,727 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:42:42,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 7 [2025-03-16 19:42:42,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111585718] [2025-03-16 19:42:42,727 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:42:42,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 19:42:42,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:42:42,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 19:42:42,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:42:42,729 INFO L87 Difference]: Start difference. First operand 252 states and 385 transitions. Second operand has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 7 states have internal predecessors, (118), 2 states have call successors, (112), 2 states have call predecessors, (112), 2 states have return successors, (112), 2 states have call predecessors, (112), 2 states have call successors, (112) [2025-03-16 19:42:46,771 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-16 19:42:50,788 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-16 19:42:54,834 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-16 19:42:58,849 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-16 19:43:02,882 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-16 19:43:02,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:43:02,936 INFO L93 Difference]: Finished difference Result 512 states and 782 transitions. [2025-03-16 19:43:02,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:43:02,937 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 7 states have internal predecessors, (118), 2 states have call successors, (112), 2 states have call predecessors, (112), 2 states have return successors, (112), 2 states have call predecessors, (112), 2 states have call successors, (112) Word has length 371 [2025-03-16 19:43:02,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:43:02,939 INFO L225 Difference]: With dead ends: 512 [2025-03-16 19:43:02,939 INFO L226 Difference]: Without dead ends: 267 [2025-03-16 19:43:02,941 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 744 GetRequests, 739 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:43:02,942 INFO L435 NwaCegarLoop]: 267 mSDtfsCounter, 4 mSDsluCounter, 795 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1062 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:43:02,942 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1062 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 5 Unknown, 0 Unchecked, 20.2s Time] [2025-03-16 19:43:02,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2025-03-16 19:43:02,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 267. [2025-03-16 19:43:02,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 173 states have (on average 1.3352601156069364) internal successors, (231), 173 states have internal predecessors, (231), 85 states have call successors, (85), 8 states have call predecessors, (85), 8 states have return successors, (87), 85 states have call predecessors, (87), 85 states have call successors, (87) [2025-03-16 19:43:02,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 403 transitions. [2025-03-16 19:43:02,959 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 403 transitions. Word has length 371 [2025-03-16 19:43:02,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:43:02,959 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 403 transitions. [2025-03-16 19:43:02,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 7 states have internal predecessors, (118), 2 states have call successors, (112), 2 states have call predecessors, (112), 2 states have return successors, (112), 2 states have call predecessors, (112), 2 states have call successors, (112) [2025-03-16 19:43:02,960 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 403 transitions. [2025-03-16 19:43:02,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 387 [2025-03-16 19:43:02,966 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:43:02,967 INFO L218 NwaCegarLoop]: trace histogram [52, 52, 52, 12, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:43:02,977 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-16 19:43:03,167 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-16 19:43:03,168 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:43:03,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:43:03,168 INFO L85 PathProgramCache]: Analyzing trace with hash -1906867263, now seen corresponding path program 2 times [2025-03-16 19:43:03,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:43:03,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565251676] [2025-03-16 19:43:03,168 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 19:43:03,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:43:03,365 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 386 statements into 2 equivalence classes. [2025-03-16 19:43:03,386 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 386 statements. [2025-03-16 19:43:03,386 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-16 19:43:03,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:43:03,664 INFO L134 CoverageAnalysis]: Checked inductivity of 5468 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5468 trivial. 0 not checked. [2025-03-16 19:43:03,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:43:03,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565251676] [2025-03-16 19:43:03,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565251676] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:43:03,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:43:03,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:43:03,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131155391] [2025-03-16 19:43:03,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:43:03,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:43:03,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:43:03,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:43:03,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:43:03,667 INFO L87 Difference]: Start difference. First operand 267 states and 403 transitions. Second operand has 5 states, 4 states have (on average 21.5) internal successors, (86), 5 states have internal predecessors, (86), 4 states have call successors, (56), 1 states have call predecessors, (56), 2 states have return successors, (56), 3 states have call predecessors, (56), 4 states have call successors, (56) [2025-03-16 19:43:07,690 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-16 19:43:11,730 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-16 19:43:15,755 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-16 19:43:15,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:43:15,986 INFO L93 Difference]: Finished difference Result 628 states and 953 transitions. [2025-03-16 19:43:15,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:43:15,987 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.5) internal successors, (86), 5 states have internal predecessors, (86), 4 states have call successors, (56), 1 states have call predecessors, (56), 2 states have return successors, (56), 3 states have call predecessors, (56), 4 states have call successors, (56) Word has length 386 [2025-03-16 19:43:15,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:43:15,990 INFO L225 Difference]: With dead ends: 628 [2025-03-16 19:43:15,990 INFO L226 Difference]: Without dead ends: 517 [2025-03-16 19:43:15,991 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-16 19:43:15,991 INFO L435 NwaCegarLoop]: 437 mSDtfsCounter, 261 mSDsluCounter, 1082 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 10 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 1519 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:43:15,991 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 1519 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 55 Invalid, 3 Unknown, 0 Unchecked, 12.3s Time] [2025-03-16 19:43:15,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2025-03-16 19:43:16,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 510. [2025-03-16 19:43:16,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 510 states, 322 states have (on average 1.3354037267080745) internal successors, (430), 325 states have internal predecessors, (430), 168 states have call successors, (168), 16 states have call predecessors, (168), 19 states have return successors, (183), 168 states have call predecessors, (183), 168 states have call successors, (183) [2025-03-16 19:43:16,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 781 transitions. [2025-03-16 19:43:16,028 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 781 transitions. Word has length 386 [2025-03-16 19:43:16,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:43:16,029 INFO L471 AbstractCegarLoop]: Abstraction has 510 states and 781 transitions. [2025-03-16 19:43:16,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.5) internal successors, (86), 5 states have internal predecessors, (86), 4 states have call successors, (56), 1 states have call predecessors, (56), 2 states have return successors, (56), 3 states have call predecessors, (56), 4 states have call successors, (56) [2025-03-16 19:43:16,029 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 781 transitions. [2025-03-16 19:43:16,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 387 [2025-03-16 19:43:16,034 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:43:16,034 INFO L218 NwaCegarLoop]: trace histogram [52, 52, 52, 12, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:43:16,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 19:43:16,034 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:43:16,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:43:16,035 INFO L85 PathProgramCache]: Analyzing trace with hash -88313662, now seen corresponding path program 1 times [2025-03-16 19:43:16,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:43:16,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99104965] [2025-03-16 19:43:16,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:43:16,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:43:16,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 386 statements into 1 equivalence classes. [2025-03-16 19:43:16,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 386 of 386 statements. [2025-03-16 19:43:16,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:43:16,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:43:17,024 INFO L134 CoverageAnalysis]: Checked inductivity of 5468 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5468 trivial. 0 not checked. [2025-03-16 19:43:17,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:43:17,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99104965] [2025-03-16 19:43:17,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99104965] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:43:17,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:43:17,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:43:17,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420459304] [2025-03-16 19:43:17,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:43:17,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:43:17,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:43:17,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:43:17,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:43:17,025 INFO L87 Difference]: Start difference. First operand 510 states and 781 transitions. Second operand has 5 states, 4 states have (on average 21.5) internal successors, (86), 5 states have internal predecessors, (86), 4 states have call successors, (56), 1 states have call predecessors, (56), 2 states have return successors, (56), 3 states have call predecessors, (56), 4 states have call successors, (56) [2025-03-16 19:43:21,047 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-16 19:43:25,068 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-16 19:43:29,083 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-16 19:43:29,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:43:29,361 INFO L93 Difference]: Finished difference Result 932 states and 1411 transitions. [2025-03-16 19:43:29,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:43:29,361 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.5) internal successors, (86), 5 states have internal predecessors, (86), 4 states have call successors, (56), 1 states have call predecessors, (56), 2 states have return successors, (56), 3 states have call predecessors, (56), 4 states have call successors, (56) Word has length 386 [2025-03-16 19:43:29,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:43:29,365 INFO L225 Difference]: With dead ends: 932 [2025-03-16 19:43:29,365 INFO L226 Difference]: Without dead ends: 467 [2025-03-16 19:43:29,367 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-16 19:43:29,367 INFO L435 NwaCegarLoop]: 433 mSDtfsCounter, 289 mSDsluCounter, 1060 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 21 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 1493 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:43:29,367 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 1493 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 65 Invalid, 3 Unknown, 0 Unchecked, 12.3s Time] [2025-03-16 19:43:29,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2025-03-16 19:43:29,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 457. [2025-03-16 19:43:29,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 287 states have (on average 1.2682926829268293) internal successors, (364), 290 states have internal predecessors, (364), 151 states have call successors, (151), 15 states have call predecessors, (151), 18 states have return successors, (160), 151 states have call predecessors, (160), 151 states have call successors, (160) [2025-03-16 19:43:29,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 675 transitions. [2025-03-16 19:43:29,401 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 675 transitions. Word has length 386 [2025-03-16 19:43:29,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:43:29,401 INFO L471 AbstractCegarLoop]: Abstraction has 457 states and 675 transitions. [2025-03-16 19:43:29,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.5) internal successors, (86), 5 states have internal predecessors, (86), 4 states have call successors, (56), 1 states have call predecessors, (56), 2 states have return successors, (56), 3 states have call predecessors, (56), 4 states have call successors, (56) [2025-03-16 19:43:29,402 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 675 transitions. [2025-03-16 19:43:29,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 387 [2025-03-16 19:43:29,405 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:43:29,405 INFO L218 NwaCegarLoop]: trace histogram [52, 52, 52, 12, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:43:29,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 19:43:29,405 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:43:29,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:43:29,406 INFO L85 PathProgramCache]: Analyzing trace with hash 2004694562, now seen corresponding path program 1 times [2025-03-16 19:43:29,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:43:29,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924195400] [2025-03-16 19:43:29,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:43:29,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:43:29,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 386 statements into 1 equivalence classes. [2025-03-16 19:43:29,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 386 of 386 statements. [2025-03-16 19:43:29,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:43:29,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:43:30,167 INFO L134 CoverageAnalysis]: Checked inductivity of 5468 backedges. 0 proven. 106 refuted. 0 times theorem prover too weak. 5362 trivial. 0 not checked. [2025-03-16 19:43:30,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:43:30,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924195400] [2025-03-16 19:43:30,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924195400] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:43:30,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1424531003] [2025-03-16 19:43:30,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:43:30,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:43:30,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:43:30,170 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-16 19:43:30,171 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-16 19:43:30,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 386 statements into 1 equivalence classes. [2025-03-16 19:43:30,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 386 of 386 statements. [2025-03-16 19:43:30,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:43:30,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:43:30,867 INFO L256 TraceCheckSpWp]: Trace formula consists of 2484 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-16 19:43:30,875 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:43:30,939 INFO L134 CoverageAnalysis]: Checked inductivity of 5468 backedges. 0 proven. 106 refuted. 0 times theorem prover too weak. 5362 trivial. 0 not checked. [2025-03-16 19:43:30,940 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:43:31,336 INFO L134 CoverageAnalysis]: Checked inductivity of 5468 backedges. 0 proven. 106 refuted. 0 times theorem prover too weak. 5362 trivial. 0 not checked. [2025-03-16 19:43:31,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1424531003] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:43:31,337 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:43:31,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 10 [2025-03-16 19:43:31,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143964431] [2025-03-16 19:43:31,337 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:43:31,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 19:43:31,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:43:31,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 19:43:31,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2025-03-16 19:43:31,339 INFO L87 Difference]: Start difference. First operand 457 states and 675 transitions. Second operand has 10 states, 10 states have (on average 13.0) internal successors, (130), 10 states have internal predecessors, (130), 2 states have call successors, (112), 2 states have call predecessors, (112), 2 states have return successors, (112), 2 states have call predecessors, (112), 2 states have call successors, (112) [2025-03-16 19:43:35,424 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-16 19:43:39,444 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-16 19:43:43,455 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-16 19:43:47,478 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-16 19:43:51,502 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-16 19:43:55,525 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-16 19:43:59,564 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-16 19:44:03,607 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-16 19:44:03,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:44:03,645 INFO L93 Difference]: Finished difference Result 907 states and 1344 transitions. [2025-03-16 19:44:03,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 19:44:03,646 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 13.0) internal successors, (130), 10 states have internal predecessors, (130), 2 states have call successors, (112), 2 states have call predecessors, (112), 2 states have return successors, (112), 2 states have call predecessors, (112), 2 states have call successors, (112) Word has length 386 [2025-03-16 19:44:03,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:44:03,649 INFO L225 Difference]: With dead ends: 907 [2025-03-16 19:44:03,649 INFO L226 Difference]: Without dead ends: 472 [2025-03-16 19:44:03,652 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 777 GetRequests, 766 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2025-03-16 19:44:03,652 INFO L435 NwaCegarLoop]: 266 mSDtfsCounter, 2 mSDsluCounter, 792 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 32.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1058 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 32.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:44:03,653 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1058 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 8 Unknown, 0 Unchecked, 32.3s Time] [2025-03-16 19:44:03,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2025-03-16 19:44:03,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 472. [2025-03-16 19:44:03,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 302 states have (on average 1.2649006622516556) internal successors, (382), 305 states have internal predecessors, (382), 151 states have call successors, (151), 15 states have call predecessors, (151), 18 states have return successors, (160), 151 states have call predecessors, (160), 151 states have call successors, (160) [2025-03-16 19:44:03,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 693 transitions. [2025-03-16 19:44:03,684 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 693 transitions. Word has length 386 [2025-03-16 19:44:03,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:44:03,684 INFO L471 AbstractCegarLoop]: Abstraction has 472 states and 693 transitions. [2025-03-16 19:44:03,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.0) internal successors, (130), 10 states have internal predecessors, (130), 2 states have call successors, (112), 2 states have call predecessors, (112), 2 states have return successors, (112), 2 states have call predecessors, (112), 2 states have call successors, (112) [2025-03-16 19:44:03,684 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 693 transitions. [2025-03-16 19:44:03,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 402 [2025-03-16 19:44:03,687 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:44:03,688 INFO L218 NwaCegarLoop]: trace histogram [52, 52, 52, 21, 7, 7, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:44:03,699 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-16 19:44:03,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:44:03,891 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:44:03,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:44:03,892 INFO L85 PathProgramCache]: Analyzing trace with hash 455407129, now seen corresponding path program 2 times [2025-03-16 19:44:03,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:44:03,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380820959] [2025-03-16 19:44:03,892 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 19:44:03,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:44:04,084 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 401 statements into 2 equivalence classes. [2025-03-16 19:44:04,262 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 401 of 401 statements. [2025-03-16 19:44:04,262 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 19:44:04,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:44:04,789 INFO L134 CoverageAnalysis]: Checked inductivity of 5744 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5740 trivial. 0 not checked. [2025-03-16 19:44:04,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:44:04,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380820959] [2025-03-16 19:44:04,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380820959] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:44:04,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1946502598] [2025-03-16 19:44:04,793 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 19:44:04,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:44:04,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:44:04,795 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-16 19:44:04,796 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-16 19:44:05,356 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 401 statements into 2 equivalence classes.