./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-programs/copysome1-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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/array-programs/copysome1-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 fba7b7c813943ca4d863bf010df4d3f1a074ecd1ac1791c737a4b5fb8e2d7ea1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 00:27:03,138 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 00:27:03,188 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 00:27:03,192 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 00:27:03,192 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 00:27:03,208 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 00:27:03,208 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 00:27:03,208 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 00:27:03,209 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 00:27:03,209 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 00:27:03,209 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 00:27:03,209 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 00:27:03,209 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 00:27:03,209 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 00:27:03,209 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 00:27:03,209 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 00:27:03,209 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 00:27:03,210 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 00:27:03,210 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 00:27:03,210 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 00:27:03,210 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 00:27:03,210 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 00:27:03,210 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 00:27:03,210 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 00:27:03,210 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 00:27:03,210 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 00:27:03,210 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 00:27:03,210 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 00:27:03,211 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 00:27:03,211 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 00:27:03,211 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 00:27:03,211 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 00:27:03,211 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 00:27:03,211 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 00:27:03,211 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 00:27:03,211 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 00:27:03,211 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 00:27:03,211 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 00:27:03,211 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 00:27:03,211 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 00:27:03,211 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 00:27:03,211 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 00:27:03,211 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 00:27:03,211 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 -> fba7b7c813943ca4d863bf010df4d3f1a074ecd1ac1791c737a4b5fb8e2d7ea1 [2025-03-08 00:27:03,443 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 00:27:03,452 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 00:27:03,453 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 00:27:03,454 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 00:27:03,454 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 00:27:03,456 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-programs/copysome1-2.i [2025-03-08 00:27:04,566 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/441fde1f1/0eb1c263bba040c7856f2f124936f3b8/FLAG4c1f9b2f0 [2025-03-08 00:27:04,829 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 00:27:04,830 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-programs/copysome1-2.i [2025-03-08 00:27:04,836 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/441fde1f1/0eb1c263bba040c7856f2f124936f3b8/FLAG4c1f9b2f0 [2025-03-08 00:27:04,851 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/441fde1f1/0eb1c263bba040c7856f2f124936f3b8 [2025-03-08 00:27:04,856 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 00:27:04,857 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 00:27:04,858 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 00:27:04,858 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 00:27:04,862 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 00:27:04,863 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:27:04" (1/1) ... [2025-03-08 00:27:04,865 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49efd45b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:27:04, skipping insertion in model container [2025-03-08 00:27:04,865 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:27:04" (1/1) ... [2025-03-08 00:27:04,877 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 00:27:04,977 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/array-programs/copysome1-2.i[805,818] [2025-03-08 00:27:04,989 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 00:27:04,995 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 00:27:05,001 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/array-programs/copysome1-2.i[805,818] [2025-03-08 00:27:05,007 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 00:27:05,018 INFO L204 MainTranslator]: Completed translation [2025-03-08 00:27:05,019 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:27:05 WrapperNode [2025-03-08 00:27:05,020 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 00:27:05,020 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 00:27:05,021 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 00:27:05,021 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 00:27:05,026 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:27:05" (1/1) ... [2025-03-08 00:27:05,030 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:27:05" (1/1) ... [2025-03-08 00:27:05,040 INFO L138 Inliner]: procedures = 16, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 60 [2025-03-08 00:27:05,040 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 00:27:05,041 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 00:27:05,041 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 00:27:05,041 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 00:27:05,046 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:27:05" (1/1) ... [2025-03-08 00:27:05,046 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:27:05" (1/1) ... [2025-03-08 00:27:05,047 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:27:05" (1/1) ... [2025-03-08 00:27:05,053 INFO L175 MemorySlicer]: Split 8 memory accesses to 3 slices as follows [2, 3, 3]. 38 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 3 writes are split as follows [0, 1, 2]. [2025-03-08 00:27:05,053 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:27:05" (1/1) ... [2025-03-08 00:27:05,053 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:27:05" (1/1) ... [2025-03-08 00:27:05,056 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:27:05" (1/1) ... [2025-03-08 00:27:05,057 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:27:05" (1/1) ... [2025-03-08 00:27:05,057 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:27:05" (1/1) ... [2025-03-08 00:27:05,058 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:27:05" (1/1) ... [2025-03-08 00:27:05,059 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 00:27:05,060 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 00:27:05,060 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 00:27:05,060 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 00:27:05,060 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:27:05" (1/1) ... [2025-03-08 00:27:05,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 00:27:05,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:27:05,081 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-08 00:27:05,082 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-08 00:27:05,098 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 00:27:05,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 00:27:05,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 00:27:05,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 00:27:05,099 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 00:27:05,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 00:27:05,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 00:27:05,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-08 00:27:05,099 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 00:27:05,099 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 00:27:05,099 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 00:27:05,099 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 00:27:05,099 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-08 00:27:05,099 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 00:27:05,154 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 00:27:05,156 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 00:27:05,258 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L16: call ULTIMATE.dealloc(main_~#a1~0#1.base, main_~#a1~0#1.offset);havoc main_~#a1~0#1.base, main_~#a1~0#1.offset;call ULTIMATE.dealloc(main_~#a2~0#1.base, main_~#a2~0#1.offset);havoc main_~#a2~0#1.base, main_~#a2~0#1.offset; [2025-03-08 00:27:05,262 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-08 00:27:05,262 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 00:27:05,268 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 00:27:05,268 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 00:27:05,268 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:27:05 BoogieIcfgContainer [2025-03-08 00:27:05,268 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 00:27:05,270 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 00:27:05,270 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 00:27:05,273 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 00:27:05,273 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 12:27:04" (1/3) ... [2025-03-08 00:27:05,273 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4128efc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:27:05, skipping insertion in model container [2025-03-08 00:27:05,273 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:27:05" (2/3) ... [2025-03-08 00:27:05,273 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4128efc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:27:05, skipping insertion in model container [2025-03-08 00:27:05,274 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:27:05" (3/3) ... [2025-03-08 00:27:05,274 INFO L128 eAbstractionObserver]: Analyzing ICFG copysome1-2.i [2025-03-08 00:27:05,284 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 00:27:05,285 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG copysome1-2.i that has 1 procedures, 16 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-03-08 00:27:05,319 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 00:27:05,327 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;@5f13a622, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 00:27:05,327 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 00:27:05,329 INFO L276 IsEmpty]: Start isEmpty. Operand has 16 states, 14 states have (on average 1.5) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:27:05,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-08 00:27:05,332 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:27:05,332 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:27:05,333 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:27:05,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:27:05,339 INFO L85 PathProgramCache]: Analyzing trace with hash 1529726488, now seen corresponding path program 1 times [2025-03-08 00:27:05,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:27:05,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036362626] [2025-03-08 00:27:05,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:27:05,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:27:05,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-08 00:27:05,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-08 00:27:05,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:27:05,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:27:05,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:27:05,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:27:05,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036362626] [2025-03-08 00:27:05,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036362626] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:27:05,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:27:05,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:27:05,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517272788] [2025-03-08 00:27:05,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:27:05,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:27:05,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:27:05,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:27:05,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:27:05,516 INFO L87 Difference]: Start difference. First operand has 16 states, 14 states have (on average 1.5) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:27:05,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:27:05,557 INFO L93 Difference]: Finished difference Result 33 states and 45 transitions. [2025-03-08 00:27:05,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:27:05,560 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-08 00:27:05,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:27:05,564 INFO L225 Difference]: With dead ends: 33 [2025-03-08 00:27:05,565 INFO L226 Difference]: Without dead ends: 17 [2025-03-08 00:27:05,567 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-08 00:27:05,570 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 3 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:27:05,572 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 26 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:27:05,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2025-03-08 00:27:05,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 15. [2025-03-08 00:27:05,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:27:05,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2025-03-08 00:27:05,594 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 19 transitions. Word has length 8 [2025-03-08 00:27:05,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:27:05,594 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 19 transitions. [2025-03-08 00:27:05,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:27:05,595 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 19 transitions. [2025-03-08 00:27:05,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-08 00:27:05,595 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:27:05,595 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:27:05,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 00:27:05,595 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:27:05,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:27:05,596 INFO L85 PathProgramCache]: Analyzing trace with hash 221189594, now seen corresponding path program 1 times [2025-03-08 00:27:05,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:27:05,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112707790] [2025-03-08 00:27:05,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:27:05,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:27:05,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-08 00:27:05,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-08 00:27:05,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:27:05,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:27:05,687 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 00:27:05,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:27:05,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112707790] [2025-03-08 00:27:05,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112707790] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:27:05,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [309992481] [2025-03-08 00:27:05,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:27:05,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:27:05,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:27:05,691 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-08 00:27:05,692 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-08 00:27:05,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-08 00:27:05,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-08 00:27:05,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:27:05,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:27:05,760 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 00:27:05,763 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:27:05,800 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 00:27:05,803 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:27:05,826 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 00:27:05,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [309992481] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:27:05,828 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:27:05,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-08 00:27:05,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986065896] [2025-03-08 00:27:05,829 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:27:05,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 00:27:05,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:27:05,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 00:27:05,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-08 00:27:05,830 INFO L87 Difference]: Start difference. First operand 15 states and 19 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:27:05,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:27:05,883 INFO L93 Difference]: Finished difference Result 38 states and 54 transitions. [2025-03-08 00:27:05,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 00:27:05,883 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-03-08 00:27:05,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:27:05,884 INFO L225 Difference]: With dead ends: 38 [2025-03-08 00:27:05,884 INFO L226 Difference]: Without dead ends: 27 [2025-03-08 00:27:05,884 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 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-08 00:27:05,885 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 21 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:27:05,885 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 30 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:27:05,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-03-08 00:27:05,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2025-03-08 00:27:05,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 26 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:27:05,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2025-03-08 00:27:05,891 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 12 [2025-03-08 00:27:05,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:27:05,891 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2025-03-08 00:27:05,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:27:05,891 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2025-03-08 00:27:05,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-08 00:27:05,892 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:27:05,892 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:27:05,899 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 00:27:06,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:27:06,095 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:27:06,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:27:06,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1894169240, now seen corresponding path program 2 times [2025-03-08 00:27:06,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:27:06,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649435430] [2025-03-08 00:27:06,097 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:27:06,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:27:06,116 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-03-08 00:27:06,138 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-03-08 00:27:06,138 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:27:06,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:27:06,263 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-08 00:27:06,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:27:06,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649435430] [2025-03-08 00:27:06,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649435430] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:27:06,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:27:06,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 00:27:06,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961495467] [2025-03-08 00:27:06,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:27:06,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 00:27:06,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:27:06,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 00:27:06,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 00:27:06,264 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:27:06,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:27:06,291 INFO L93 Difference]: Finished difference Result 45 states and 57 transitions. [2025-03-08 00:27:06,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 00:27:06,292 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-03-08 00:27:06,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:27:06,292 INFO L225 Difference]: With dead ends: 45 [2025-03-08 00:27:06,292 INFO L226 Difference]: Without dead ends: 27 [2025-03-08 00:27:06,292 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 00:27:06,293 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 14 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:27:06,293 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 18 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:27:06,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-03-08 00:27:06,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2025-03-08 00:27:06,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:27:06,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2025-03-08 00:27:06,296 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 24 [2025-03-08 00:27:06,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:27:06,296 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2025-03-08 00:27:06,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:27:06,296 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2025-03-08 00:27:06,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-08 00:27:06,296 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:27:06,296 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:27:06,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 00:27:06,296 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:27:06,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:27:06,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1890263879, now seen corresponding path program 1 times [2025-03-08 00:27:06,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:27:06,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869607431] [2025-03-08 00:27:06,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:27:06,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:27:06,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-08 00:27:06,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-08 00:27:06,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:27:06,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:27:06,399 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-08 00:27:06,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:27:06,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869607431] [2025-03-08 00:27:06,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869607431] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:27:06,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1647443629] [2025-03-08 00:27:06,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:27:06,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:27:06,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:27:06,401 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-08 00:27:06,403 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-08 00:27:06,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-08 00:27:06,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-08 00:27:06,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:27:06,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:27:06,463 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 00:27:06,464 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:27:06,503 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-08 00:27:06,503 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:27:06,554 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-08 00:27:06,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1647443629] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:27:06,555 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:27:06,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 15 [2025-03-08 00:27:06,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553412419] [2025-03-08 00:27:06,555 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:27:06,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 00:27:06,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:27:06,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 00:27:06,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=117, Unknown=0, NotChecked=0, Total=210 [2025-03-08 00:27:06,556 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:27:06,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:27:06,763 INFO L93 Difference]: Finished difference Result 79 states and 114 transitions. [2025-03-08 00:27:06,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 00:27:06,763 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-03-08 00:27:06,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:27:06,764 INFO L225 Difference]: With dead ends: 79 [2025-03-08 00:27:06,764 INFO L226 Difference]: Without dead ends: 59 [2025-03-08 00:27:06,765 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=273, Invalid=429, Unknown=0, NotChecked=0, Total=702 [2025-03-08 00:27:06,765 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 53 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:27:06,766 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 55 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:27:06,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-03-08 00:27:06,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2025-03-08 00:27:06,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 58 states have (on average 1.2586206896551724) internal successors, (73), 58 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:27:06,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 73 transitions. [2025-03-08 00:27:06,772 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 73 transitions. Word has length 24 [2025-03-08 00:27:06,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:27:06,772 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 73 transitions. [2025-03-08 00:27:06,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:27:06,772 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 73 transitions. [2025-03-08 00:27:06,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-08 00:27:06,773 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:27:06,773 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 7, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:27:06,780 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 00:27:06,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-08 00:27:06,974 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:27:06,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:27:06,974 INFO L85 PathProgramCache]: Analyzing trace with hash -307149415, now seen corresponding path program 2 times [2025-03-08 00:27:06,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:27:06,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534135163] [2025-03-08 00:27:06,974 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:27:06,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:27:06,999 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-03-08 00:27:07,028 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-03-08 00:27:07,028 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:27:07,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:27:07,357 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2025-03-08 00:27:07,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:27:07,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534135163] [2025-03-08 00:27:07,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534135163] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:27:07,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1800747942] [2025-03-08 00:27:07,359 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:27:07,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:27:07,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:27:07,361 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-08 00:27:07,362 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-08 00:27:07,424 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-03-08 00:27:07,478 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-03-08 00:27:07,478 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:27:07,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:27:07,480 INFO L256 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-08 00:27:07,482 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:27:07,509 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2025-03-08 00:27:07,509 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:27:07,764 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2025-03-08 00:27:07,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1800747942] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:27:07,765 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:27:07,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2025-03-08 00:27:07,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991954783] [2025-03-08 00:27:07,765 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:27:07,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-08 00:27:07,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:27:07,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-08 00:27:07,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2025-03-08 00:27:07,766 INFO L87 Difference]: Start difference. First operand 59 states and 73 transitions. Second operand has 29 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 29 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:27:07,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:27:07,978 INFO L93 Difference]: Finished difference Result 454 states and 608 transitions. [2025-03-08 00:27:07,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-08 00:27:07,979 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 29 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2025-03-08 00:27:07,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:27:07,981 INFO L225 Difference]: With dead ends: 454 [2025-03-08 00:27:07,981 INFO L226 Difference]: Without dead ends: 410 [2025-03-08 00:27:07,982 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2025-03-08 00:27:07,984 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 300 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 00:27:07,984 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 30 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 00:27:07,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2025-03-08 00:27:08,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 115. [2025-03-08 00:27:08,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 114 states have (on average 1.2543859649122806) internal successors, (143), 114 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:27:08,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 143 transitions. [2025-03-08 00:27:08,005 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 143 transitions. Word has length 56 [2025-03-08 00:27:08,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:27:08,006 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 143 transitions. [2025-03-08 00:27:08,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 29 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:27:08,006 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 143 transitions. [2025-03-08 00:27:08,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-08 00:27:08,007 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:27:08,007 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 19, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:27:08,015 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-08 00:27:08,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:27:08,209 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:27:08,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:27:08,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1051388953, now seen corresponding path program 3 times [2025-03-08 00:27:08,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:27:08,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85988171] [2025-03-08 00:27:08,210 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:27:08,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:27:08,244 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 112 statements into 27 equivalence classes. [2025-03-08 00:27:08,290 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 33 of 112 statements. [2025-03-08 00:27:08,290 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-08 00:27:08,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:27:08,358 INFO L134 CoverageAnalysis]: Checked inductivity of 1352 backedges. 123 proven. 2 refuted. 0 times theorem prover too weak. 1227 trivial. 0 not checked. [2025-03-08 00:27:08,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:27:08,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85988171] [2025-03-08 00:27:08,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85988171] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:27:08,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2024304565] [2025-03-08 00:27:08,358 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:27:08,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:27:08,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:27:08,360 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-08 00:27:08,362 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-08 00:27:08,441 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 112 statements into 27 equivalence classes. [2025-03-08 00:27:08,720 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 33 of 112 statements. [2025-03-08 00:27:08,720 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-08 00:27:08,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:27:08,722 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 00:27:08,725 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:27:08,793 INFO L134 CoverageAnalysis]: Checked inductivity of 1352 backedges. 123 proven. 2 refuted. 0 times theorem prover too weak. 1227 trivial. 0 not checked. [2025-03-08 00:27:08,793 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:27:08,845 INFO L134 CoverageAnalysis]: Checked inductivity of 1352 backedges. 123 proven. 2 refuted. 0 times theorem prover too weak. 1227 trivial. 0 not checked. [2025-03-08 00:27:08,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2024304565] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:27:08,845 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:27:08,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-08 00:27:08,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520861265] [2025-03-08 00:27:08,846 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:27:08,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 00:27:08,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:27:08,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 00:27:08,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2025-03-08 00:27:08,847 INFO L87 Difference]: Start difference. First operand 115 states and 143 transitions. Second operand has 10 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:27:08,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:27:08,898 INFO L93 Difference]: Finished difference Result 196 states and 250 transitions. [2025-03-08 00:27:08,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 00:27:08,898 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2025-03-08 00:27:08,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:27:08,899 INFO L225 Difference]: With dead ends: 196 [2025-03-08 00:27:08,899 INFO L226 Difference]: Without dead ends: 115 [2025-03-08 00:27:08,899 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2025-03-08 00:27:08,900 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 23 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:27:08,900 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 33 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:27:08,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2025-03-08 00:27:08,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2025-03-08 00:27:08,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 114 states have (on average 1.2280701754385965) internal successors, (140), 114 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:27:08,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 140 transitions. [2025-03-08 00:27:08,908 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 140 transitions. Word has length 112 [2025-03-08 00:27:08,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:27:08,908 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 140 transitions. [2025-03-08 00:27:08,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:27:08,908 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 140 transitions. [2025-03-08 00:27:08,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-08 00:27:08,909 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:27:08,909 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 16, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:27:08,917 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-08 00:27:09,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:27:09,110 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:27:09,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:27:09,110 INFO L85 PathProgramCache]: Analyzing trace with hash 777975160, now seen corresponding path program 4 times [2025-03-08 00:27:09,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:27:09,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493241163] [2025-03-08 00:27:09,110 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:27:09,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:27:09,136 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 112 statements into 2 equivalence classes. [2025-03-08 00:27:09,141 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 55 of 112 statements. [2025-03-08 00:27:09,141 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-08 00:27:09,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:27:09,168 INFO L134 CoverageAnalysis]: Checked inductivity of 1352 backedges. 365 proven. 0 refuted. 0 times theorem prover too weak. 987 trivial. 0 not checked. [2025-03-08 00:27:09,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:27:09,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493241163] [2025-03-08 00:27:09,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493241163] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:27:09,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:27:09,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 00:27:09,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198095093] [2025-03-08 00:27:09,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:27:09,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 00:27:09,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:27:09,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 00:27:09,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 00:27:09,169 INFO L87 Difference]: Start difference. First operand 115 states and 140 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:27:09,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:27:09,204 INFO L93 Difference]: Finished difference Result 264 states and 333 transitions. [2025-03-08 00:27:09,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 00:27:09,205 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2025-03-08 00:27:09,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:27:09,206 INFO L225 Difference]: With dead ends: 264 [2025-03-08 00:27:09,206 INFO L226 Difference]: Without dead ends: 195 [2025-03-08 00:27:09,208 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 00:27:09,209 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 1 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:27:09,209 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 30 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:27:09,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2025-03-08 00:27:09,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 180. [2025-03-08 00:27:09,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 179 states have (on average 1.1508379888268156) internal successors, (206), 179 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:27:09,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 206 transitions. [2025-03-08 00:27:09,223 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 206 transitions. Word has length 112 [2025-03-08 00:27:09,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:27:09,223 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 206 transitions. [2025-03-08 00:27:09,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:27:09,223 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 206 transitions. [2025-03-08 00:27:09,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-08 00:27:09,224 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:27:09,224 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:27:09,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 00:27:09,224 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:27:09,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:27:09,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1704629015, now seen corresponding path program 5 times [2025-03-08 00:27:09,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:27:09,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957468919] [2025-03-08 00:27:09,225 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 00:27:09,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:27:09,256 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 112 statements into 27 equivalence classes. [2025-03-08 00:27:09,510 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 27 check-sat command(s) and asserted 112 of 112 statements. [2025-03-08 00:27:09,510 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 27 check-sat command(s) [2025-03-08 00:27:09,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:27:09,700 INFO L134 CoverageAnalysis]: Checked inductivity of 1352 backedges. 303 proven. 26 refuted. 0 times theorem prover too weak. 1023 trivial. 0 not checked. [2025-03-08 00:27:09,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:27:09,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957468919] [2025-03-08 00:27:09,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957468919] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:27:09,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1360997020] [2025-03-08 00:27:09,701 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 00:27:09,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:27:09,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:27:09,703 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:27:09,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 00:27:09,816 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 112 statements into 27 equivalence classes.