./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-crafted/xor3.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-crafted/xor3.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 c89c2ec3a6d8d6162c4c4ac97fed99fb9c343c7a2c2e60d87226da2b47103d07 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 00:31:39,109 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 00:31:39,167 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 00:31:39,171 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 00:31:39,172 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 00:31:39,193 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 00:31:39,194 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 00:31:39,194 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 00:31:39,194 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 00:31:39,195 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 00:31:39,195 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 00:31:39,195 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 00:31:39,196 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 00:31:39,196 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 00:31:39,196 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 00:31:39,196 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 00:31:39,196 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 00:31:39,196 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 00:31:39,197 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 00:31:39,197 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 00:31:39,197 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 00:31:39,197 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 00:31:39,197 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 00:31:39,197 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 00:31:39,197 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 00:31:39,197 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 00:31:39,197 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 00:31:39,197 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 00:31:39,197 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 00:31:39,197 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 00:31:39,197 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 00:31:39,198 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 00:31:39,198 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 00:31:39,198 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 00:31:39,198 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 00:31:39,198 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 00:31:39,198 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 00:31:39,199 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 00:31:39,199 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 00:31:39,199 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 00:31:39,199 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 00:31:39,199 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 00:31:39,199 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 00:31:39,199 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 -> c89c2ec3a6d8d6162c4c4ac97fed99fb9c343c7a2c2e60d87226da2b47103d07 [2025-03-08 00:31:39,447 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 00:31:39,453 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 00:31:39,455 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 00:31:39,456 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 00:31:39,456 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 00:31:39,458 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-crafted/xor3.i [2025-03-08 00:31:40,552 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01687aee8/e8793b9de8f04dd99fd0a09b70509fb0/FLAGcc41a4320 [2025-03-08 00:31:40,746 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 00:31:40,746 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-crafted/xor3.i [2025-03-08 00:31:40,753 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01687aee8/e8793b9de8f04dd99fd0a09b70509fb0/FLAGcc41a4320 [2025-03-08 00:31:41,133 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01687aee8/e8793b9de8f04dd99fd0a09b70509fb0 [2025-03-08 00:31:41,135 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 00:31:41,135 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 00:31:41,136 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 00:31:41,136 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 00:31:41,139 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 00:31:41,140 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:31:41" (1/1) ... [2025-03-08 00:31:41,140 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33f6d911 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:31:41, skipping insertion in model container [2025-03-08 00:31:41,140 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:31:41" (1/1) ... [2025-03-08 00:31:41,150 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 00:31:41,253 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-crafted/xor3.i[1297,1310] [2025-03-08 00:31:41,256 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 00:31:41,263 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 00:31:41,281 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-crafted/xor3.i[1297,1310] [2025-03-08 00:31:41,284 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 00:31:41,293 INFO L204 MainTranslator]: Completed translation [2025-03-08 00:31:41,294 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:31:41 WrapperNode [2025-03-08 00:31:41,295 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 00:31:41,296 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 00:31:41,296 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 00:31:41,297 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 00:31:41,301 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:31:41" (1/1) ... [2025-03-08 00:31:41,306 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:31:41" (1/1) ... [2025-03-08 00:31:41,322 INFO L138 Inliner]: procedures = 16, calls = 30, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 70 [2025-03-08 00:31:41,324 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 00:31:41,324 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 00:31:41,325 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 00:31:41,325 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 00:31:41,330 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:31:41" (1/1) ... [2025-03-08 00:31:41,331 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:31:41" (1/1) ... [2025-03-08 00:31:41,332 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:31:41" (1/1) ... [2025-03-08 00:31:41,348 INFO L175 MemorySlicer]: Split 20 memory accesses to 3 slices as follows [2, 7, 11]. 55 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7, 0]. The 5 writes are split as follows [0, 0, 5]. [2025-03-08 00:31:41,348 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:31:41" (1/1) ... [2025-03-08 00:31:41,348 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:31:41" (1/1) ... [2025-03-08 00:31:41,354 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:31:41" (1/1) ... [2025-03-08 00:31:41,357 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:31:41" (1/1) ... [2025-03-08 00:31:41,362 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:31:41" (1/1) ... [2025-03-08 00:31:41,362 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:31:41" (1/1) ... [2025-03-08 00:31:41,364 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 00:31:41,364 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 00:31:41,364 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 00:31:41,364 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 00:31:41,365 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:31:41" (1/1) ... [2025-03-08 00:31:41,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 00:31:41,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:31:41,402 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:31:41,416 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:31:41,445 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 00:31:41,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 00:31:41,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 00:31:41,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 00:31:41,445 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 00:31:41,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 00:31:41,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 00:31:41,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-08 00:31:41,446 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 00:31:41,446 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 00:31:41,446 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 00:31:41,446 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 00:31:41,446 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-08 00:31:41,446 INFO L130 BoogieDeclarations]: Found specification of procedure xor [2025-03-08 00:31:41,446 INFO L138 BoogieDeclarations]: Found implementation of procedure xor [2025-03-08 00:31:41,447 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 00:31:41,516 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 00:31:41,518 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 00:31:41,624 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L31: call ULTIMATE.dealloc(main_~#x~0#1.base, main_~#x~0#1.offset);havoc main_~#x~0#1.base, main_~#x~0#1.offset; [2025-03-08 00:31:41,658 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-03-08 00:31:41,659 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 00:31:41,673 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 00:31:41,674 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 00:31:41,674 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:31:41 BoogieIcfgContainer [2025-03-08 00:31:41,674 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 00:31:41,675 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 00:31:41,675 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 00:31:41,678 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 00:31:41,678 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 12:31:41" (1/3) ... [2025-03-08 00:31:41,679 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e8775b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:31:41, skipping insertion in model container [2025-03-08 00:31:41,679 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:31:41" (2/3) ... [2025-03-08 00:31:41,679 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e8775b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:31:41, skipping insertion in model container [2025-03-08 00:31:41,679 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:31:41" (3/3) ... [2025-03-08 00:31:41,680 INFO L128 eAbstractionObserver]: Analyzing ICFG xor3.i [2025-03-08 00:31:41,691 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 00:31:41,693 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG xor3.i that has 2 procedures, 26 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-03-08 00:31:41,729 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 00:31:41,736 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;@11ad29a8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 00:31:41,737 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 00:31:41,739 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 20 states have (on average 1.4) internal successors, (28), 21 states have internal predecessors, (28), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 00:31:41,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-08 00:31:41,744 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:31:41,744 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:31:41,745 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:31:41,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:31:41,749 INFO L85 PathProgramCache]: Analyzing trace with hash 1065639596, now seen corresponding path program 1 times [2025-03-08 00:31:41,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:31:41,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220581850] [2025-03-08 00:31:41,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:31:41,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:31:41,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-08 00:31:41,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-08 00:31:41,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:31:41,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:31:42,005 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 00:31:42,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:31:42,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220581850] [2025-03-08 00:31:42,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220581850] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:31:42,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:31:42,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:31:42,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620425784] [2025-03-08 00:31:42,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:31:42,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:31:42,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:31:42,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:31:42,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:31:42,029 INFO L87 Difference]: Start difference. First operand has 26 states, 20 states have (on average 1.4) internal successors, (28), 21 states have internal predecessors, (28), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 00:31:42,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:31:42,059 INFO L93 Difference]: Finished difference Result 50 states and 66 transitions. [2025-03-08 00:31:42,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:31:42,061 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 24 [2025-03-08 00:31:42,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:31:42,065 INFO L225 Difference]: With dead ends: 50 [2025-03-08 00:31:42,065 INFO L226 Difference]: Without dead ends: 23 [2025-03-08 00:31:42,067 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:31:42,069 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:31:42,070 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 59 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:31:42,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2025-03-08 00:31:42,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2025-03-08 00:31:42,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 00:31:42,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2025-03-08 00:31:42,097 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 30 transitions. Word has length 24 [2025-03-08 00:31:42,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:31:42,097 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 30 transitions. [2025-03-08 00:31:42,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 00:31:42,098 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 30 transitions. [2025-03-08 00:31:42,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-08 00:31:42,099 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:31:42,099 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:31:42,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 00:31:42,099 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:31:42,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:31:42,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1183839165, now seen corresponding path program 1 times [2025-03-08 00:31:42,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:31:42,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135218362] [2025-03-08 00:31:42,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:31:42,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:31:42,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-08 00:31:42,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 00:31:42,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:31:42,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:31:42,217 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 00:31:42,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:31:42,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135218362] [2025-03-08 00:31:42,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135218362] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:31:42,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [591793976] [2025-03-08 00:31:42,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:31:42,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:31:42,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:31:42,221 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:31:42,222 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:31:42,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-08 00:31:42,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 00:31:42,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:31:42,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:31:42,293 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 00:31:42,296 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:31:42,313 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-08 00:31:42,314 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 00:31:42,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [591793976] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:31:42,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 00:31:42,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-08 00:31:42,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32506451] [2025-03-08 00:31:42,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:31:42,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:31:42,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:31:42,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:31:42,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 00:31:42,317 INFO L87 Difference]: Start difference. First operand 23 states and 30 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 00:31:42,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:31:42,331 INFO L93 Difference]: Finished difference Result 47 states and 66 transitions. [2025-03-08 00:31:42,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:31:42,334 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2025-03-08 00:31:42,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:31:42,334 INFO L225 Difference]: With dead ends: 47 [2025-03-08 00:31:42,334 INFO L226 Difference]: Without dead ends: 29 [2025-03-08 00:31:42,334 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 00:31:42,335 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 8 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:31:42,335 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 50 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:31:42,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-03-08 00:31:42,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 24. [2025-03-08 00:31:42,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 19 states have internal predecessors, (25), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 00:31:42,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2025-03-08 00:31:42,338 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 25 [2025-03-08 00:31:42,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:31:42,339 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2025-03-08 00:31:42,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 00:31:42,339 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2025-03-08 00:31:42,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-08 00:31:42,339 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:31:42,340 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:31:42,345 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-08 00:31:42,540 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:31:42,540 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:31:42,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:31:42,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1777023229, now seen corresponding path program 1 times [2025-03-08 00:31:42,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:31:42,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860787980] [2025-03-08 00:31:42,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:31:42,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:31:42,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-08 00:31:42,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-08 00:31:42,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:31:42,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:31:42,659 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 00:31:42,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:31:42,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860787980] [2025-03-08 00:31:42,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860787980] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:31:42,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1820232144] [2025-03-08 00:31:42,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:31:42,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:31:42,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:31:42,662 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:31:42,663 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:31:42,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-08 00:31:42,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-08 00:31:42,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:31:42,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:31:42,749 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 00:31:42,750 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:31:42,762 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-08 00:31:42,763 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 00:31:42,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1820232144] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:31:42,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 00:31:42,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-08 00:31:42,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953909116] [2025-03-08 00:31:42,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:31:42,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:31:42,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:31:42,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:31:42,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 00:31:42,765 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 00:31:42,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:31:42,782 INFO L93 Difference]: Finished difference Result 40 states and 51 transitions. [2025-03-08 00:31:42,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:31:42,783 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 34 [2025-03-08 00:31:42,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:31:42,783 INFO L225 Difference]: With dead ends: 40 [2025-03-08 00:31:42,783 INFO L226 Difference]: Without dead ends: 25 [2025-03-08 00:31:42,784 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 00:31:42,784 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:31:42,784 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 51 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:31:42,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-03-08 00:31:42,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2025-03-08 00:31:42,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 00:31:42,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2025-03-08 00:31:42,790 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 34 [2025-03-08 00:31:42,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:31:42,792 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2025-03-08 00:31:42,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 00:31:42,792 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2025-03-08 00:31:42,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-08 00:31:42,794 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:31:42,794 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:31:42,800 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:31:42,999 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,SelfDestructingSolverStorable2 [2025-03-08 00:31:42,999 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:31:43,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:31:43,000 INFO L85 PathProgramCache]: Analyzing trace with hash -1428992780, now seen corresponding path program 1 times [2025-03-08 00:31:43,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:31:43,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510979177] [2025-03-08 00:31:43,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:31:43,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:31:43,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-08 00:31:43,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-08 00:31:43,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:31:43,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:31:43,073 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-03-08 00:31:43,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:31:43,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510979177] [2025-03-08 00:31:43,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510979177] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:31:43,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [923396581] [2025-03-08 00:31:43,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:31:43,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:31:43,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:31:43,079 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:31:43,081 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:31:43,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-08 00:31:43,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-08 00:31:43,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:31:43,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:31:43,155 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 00:31:43,156 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:31:43,177 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-03-08 00:31:43,179 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:31:43,217 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-03-08 00:31:43,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [923396581] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:31:43,218 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:31:43,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-08 00:31:43,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987056467] [2025-03-08 00:31:43,218 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:31:43,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 00:31:43,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:31:43,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 00:31:43,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-08 00:31:43,219 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-08 00:31:43,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:31:43,235 INFO L93 Difference]: Finished difference Result 49 states and 65 transitions. [2025-03-08 00:31:43,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 00:31:43,235 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 35 [2025-03-08 00:31:43,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:31:43,235 INFO L225 Difference]: With dead ends: 49 [2025-03-08 00:31:43,236 INFO L226 Difference]: Without dead ends: 28 [2025-03-08 00:31:43,236 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 67 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:31:43,236 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:31:43,237 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 102 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:31:43,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-03-08 00:31:43,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2025-03-08 00:31:43,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 00:31:43,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2025-03-08 00:31:43,244 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 35 [2025-03-08 00:31:43,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:31:43,244 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2025-03-08 00:31:43,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-08 00:31:43,244 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2025-03-08 00:31:43,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-08 00:31:43,246 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:31:43,246 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:31:43,253 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 00:31:43,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:31:43,447 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:31:43,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:31:43,447 INFO L85 PathProgramCache]: Analyzing trace with hash 1206191459, now seen corresponding path program 2 times [2025-03-08 00:31:43,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:31:43,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394789083] [2025-03-08 00:31:43,447 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:31:43,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:31:43,458 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-03-08 00:31:43,472 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-03-08 00:31:43,475 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:31:43,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:31:43,543 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-08 00:31:43,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:31:43,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394789083] [2025-03-08 00:31:43,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394789083] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:31:43,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1675859084] [2025-03-08 00:31:43,543 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:31:43,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:31:43,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:31:43,546 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:31:43,547 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:31:43,591 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-03-08 00:31:43,627 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-03-08 00:31:43,628 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:31:43,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:31:43,629 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 00:31:43,630 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:31:43,671 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-03-08 00:31:43,675 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:31:43,737 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-03-08 00:31:43,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1675859084] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:31:43,737 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:31:43,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 14 [2025-03-08 00:31:43,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877547538] [2025-03-08 00:31:43,738 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:31:43,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 00:31:43,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:31:43,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 00:31:43,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2025-03-08 00:31:43,740 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 00:31:43,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:31:43,787 INFO L93 Difference]: Finished difference Result 66 states and 95 transitions. [2025-03-08 00:31:43,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 00:31:43,788 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) Word has length 38 [2025-03-08 00:31:43,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:31:43,788 INFO L225 Difference]: With dead ends: 66 [2025-03-08 00:31:43,788 INFO L226 Difference]: Without dead ends: 45 [2025-03-08 00:31:43,789 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2025-03-08 00:31:43,789 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 20 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:31:43,789 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 169 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:31:43,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-03-08 00:31:43,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 40. [2025-03-08 00:31:43,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 35 states have internal predecessors, (44), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 00:31:43,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 50 transitions. [2025-03-08 00:31:43,793 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 50 transitions. Word has length 38 [2025-03-08 00:31:43,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:31:43,793 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 50 transitions. [2025-03-08 00:31:43,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 00:31:43,793 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 50 transitions. [2025-03-08 00:31:43,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-08 00:31:43,794 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:31:43,794 INFO L218 NwaCegarLoop]: trace histogram [10, 6, 6, 6, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:31:43,800 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-08 00:31:43,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:31:43,994 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:31:43,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:31:43,995 INFO L85 PathProgramCache]: Analyzing trace with hash -2105824583, now seen corresponding path program 3 times [2025-03-08 00:31:43,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:31:43,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821177770] [2025-03-08 00:31:43,995 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:31:43,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:31:44,006 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 53 statements into 6 equivalence classes. [2025-03-08 00:31:44,014 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 32 of 53 statements. [2025-03-08 00:31:44,015 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-08 00:31:44,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:31:44,048 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2025-03-08 00:31:44,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:31:44,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821177770] [2025-03-08 00:31:44,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821177770] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:31:44,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1828521715] [2025-03-08 00:31:44,048 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:31:44,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:31:44,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:31:44,054 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:31:44,055 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:31:44,105 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 53 statements into 6 equivalence classes. [2025-03-08 00:31:44,125 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 32 of 53 statements. [2025-03-08 00:31:44,126 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-08 00:31:44,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:31:44,126 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 00:31:44,128 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:31:44,141 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 40 proven. 1 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2025-03-08 00:31:44,141 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:31:44,161 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2025-03-08 00:31:44,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1828521715] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:31:44,162 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:31:44,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-08 00:31:44,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266161567] [2025-03-08 00:31:44,162 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:31:44,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 00:31:44,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:31:44,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 00:31:44,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-08 00:31:44,163 INFO L87 Difference]: Start difference. First operand 40 states and 50 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 00:31:44,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:31:44,178 INFO L93 Difference]: Finished difference Result 64 states and 83 transitions. [2025-03-08 00:31:44,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 00:31:44,179 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 53 [2025-03-08 00:31:44,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:31:44,179 INFO L225 Difference]: With dead ends: 64 [2025-03-08 00:31:44,179 INFO L226 Difference]: Without dead ends: 43 [2025-03-08 00:31:44,180 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 103 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:31:44,180 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:31:44,180 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 75 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:31:44,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-03-08 00:31:44,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2025-03-08 00:31:44,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 38 states have (on average 1.236842105263158) internal successors, (47), 38 states have internal predecessors, (47), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 00:31:44,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 53 transitions. [2025-03-08 00:31:44,184 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 53 transitions. Word has length 53 [2025-03-08 00:31:44,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:31:44,185 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 53 transitions. [2025-03-08 00:31:44,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 00:31:44,185 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 53 transitions. [2025-03-08 00:31:44,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-08 00:31:44,185 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:31:44,185 INFO L218 NwaCegarLoop]: trace histogram [10, 6, 6, 6, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:31:44,193 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-08 00:31:44,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:31:44,386 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:31:44,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:31:44,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1143402124, now seen corresponding path program 4 times [2025-03-08 00:31:44,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:31:44,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803547876] [2025-03-08 00:31:44,387 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:31:44,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:31:44,400 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-03-08 00:31:44,408 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-03-08 00:31:44,409 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 00:31:44,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:31:44,476 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2025-03-08 00:31:44,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:31:44,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803547876] [2025-03-08 00:31:44,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803547876] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:31:44,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1187588946] [2025-03-08 00:31:44,477 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:31:44,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:31:44,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:31:44,479 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:31:44,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 00:31:44,525 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-03-08 00:31:44,556 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-03-08 00:31:44,557 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 00:31:44,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:31:44,558 INFO L256 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 00:31:44,559 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:31:44,571 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 36 proven. 5 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2025-03-08 00:31:44,572 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:31:44,609 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2025-03-08 00:31:44,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1187588946] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:31:44,610 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:31:44,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-03-08 00:31:44,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322005083] [2025-03-08 00:31:44,610 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:31:44,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 00:31:44,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:31:44,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 00:31:44,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2025-03-08 00:31:44,610 INFO L87 Difference]: Start difference. First operand 43 states and 53 transitions. Second operand has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 00:31:44,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:31:44,643 INFO L93 Difference]: Finished difference Result 96 states and 133 transitions. [2025-03-08 00:31:44,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 00:31:44,644 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 56 [2025-03-08 00:31:44,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:31:44,644 INFO L225 Difference]: With dead ends: 96 [2025-03-08 00:31:44,644 INFO L226 Difference]: Without dead ends: 67 [2025-03-08 00:31:44,645 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2025-03-08 00:31:44,645 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 70 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:31:44,645 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 74 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:31:44,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-03-08 00:31:44,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2025-03-08 00:31:44,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 62 states have (on average 1.3387096774193548) internal successors, (83), 62 states have internal predecessors, (83), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 00:31:44,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 89 transitions. [2025-03-08 00:31:44,649 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 89 transitions. Word has length 56 [2025-03-08 00:31:44,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:31:44,649 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 89 transitions. [2025-03-08 00:31:44,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 00:31:44,649 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 89 transitions. [2025-03-08 00:31:44,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-08 00:31:44,651 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:31:44,651 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 10, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:31:44,657 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-08 00:31:44,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:31:44,855 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:31:44,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:31:44,856 INFO L85 PathProgramCache]: Analyzing trace with hash -534687092, now seen corresponding path program 5 times [2025-03-08 00:31:44,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:31:44,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026915931] [2025-03-08 00:31:44,856 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 00:31:44,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:31:44,873 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 92 statements into 14 equivalence classes. [2025-03-08 00:31:44,912 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) and asserted 81 of 92 statements. [2025-03-08 00:31:44,913 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2025-03-08 00:31:44,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:31:45,045 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 123 proven. 174 refuted. 0 times theorem prover too weak. 293 trivial. 0 not checked. [2025-03-08 00:31:45,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:31:45,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026915931] [2025-03-08 00:31:45,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026915931] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:31:45,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [984185586] [2025-03-08 00:31:45,045 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 00:31:45,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:31:45,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:31:45,047 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:31:45,049 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-08 00:31:45,103 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 92 statements into 14 equivalence classes. [2025-03-08 00:31:45,325 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) and asserted 81 of 92 statements. [2025-03-08 00:31:45,326 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2025-03-08 00:31:45,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:31:45,328 INFO L256 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 00:31:45,330 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:31:45,365 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 244 proven. 51 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2025-03-08 00:31:45,365 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:31:45,475 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 0 proven. 297 refuted. 0 times theorem prover too weak. 293 trivial. 0 not checked. [2025-03-08 00:31:45,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [984185586] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:31:45,478 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:31:45,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2025-03-08 00:31:45,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261271397] [2025-03-08 00:31:45,478 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:31:45,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-08 00:31:45,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:31:45,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-08 00:31:45,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2025-03-08 00:31:45,480 INFO L87 Difference]: Start difference. First operand 67 states and 89 transitions. Second operand has 16 states, 16 states have (on average 4.0) internal successors, (64), 16 states have internal predecessors, (64), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 00:31:45,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:31:45,539 INFO L93 Difference]: Finished difference Result 168 states and 245 transitions. [2025-03-08 00:31:45,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 00:31:45,540 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.0) internal successors, (64), 16 states have internal predecessors, (64), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 92 [2025-03-08 00:31:45,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:31:45,541 INFO L225 Difference]: With dead ends: 168 [2025-03-08 00:31:45,541 INFO L226 Difference]: Without dead ends: 115 [2025-03-08 00:31:45,542 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2025-03-08 00:31:45,542 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 172 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:31:45,543 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 212 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:31:45,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2025-03-08 00:31:45,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2025-03-08 00:31:45,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 110 states have (on average 1.4090909090909092) internal successors, (155), 110 states have internal predecessors, (155), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 00:31:45,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 161 transitions. [2025-03-08 00:31:45,554 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 161 transitions. Word has length 92 [2025-03-08 00:31:45,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:31:45,554 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 161 transitions. [2025-03-08 00:31:45,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.0) internal successors, (64), 16 states have internal predecessors, (64), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 00:31:45,554 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 161 transitions. [2025-03-08 00:31:45,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-08 00:31:45,561 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:31:45,561 INFO L218 NwaCegarLoop]: trace histogram [42, 42, 42, 10, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:31:45,570 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-08 00:31:45,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:31:45,762 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:31:45,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:31:45,763 INFO L85 PathProgramCache]: Analyzing trace with hash -1386997108, now seen corresponding path program 6 times [2025-03-08 00:31:45,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:31:45,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395957118] [2025-03-08 00:31:45,763 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 00:31:45,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:31:45,782 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 164 statements into 30 equivalence classes. [2025-03-08 00:31:45,812 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) and asserted 52 of 164 statements. [2025-03-08 00:31:45,813 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2025-03-08 00:31:45,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:31:45,946 INFO L134 CoverageAnalysis]: Checked inductivity of 2786 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2776 trivial. 0 not checked. [2025-03-08 00:31:45,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:31:45,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395957118] [2025-03-08 00:31:45,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395957118] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:31:45,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [585800500] [2025-03-08 00:31:45,946 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 00:31:45,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:31:45,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:31:45,949 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:31:45,950 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-08 00:31:46,020 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 164 statements into 30 equivalence classes. [2025-03-08 00:31:46,060 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) and asserted 52 of 164 statements. [2025-03-08 00:31:46,060 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2025-03-08 00:31:46,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:31:46,062 INFO L256 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 00:31:46,065 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:31:46,096 INFO L134 CoverageAnalysis]: Checked inductivity of 2786 backedges. 1240 proven. 10 refuted. 0 times theorem prover too weak. 1536 trivial. 0 not checked. [2025-03-08 00:31:46,096 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:31:46,165 INFO L134 CoverageAnalysis]: Checked inductivity of 2786 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2776 trivial. 0 not checked. [2025-03-08 00:31:46,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [585800500] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:31:46,165 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:31:46,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2025-03-08 00:31:46,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145844406] [2025-03-08 00:31:46,165 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:31:46,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 00:31:46,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:31:46,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 00:31:46,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=92, Unknown=0, NotChecked=0, Total=182 [2025-03-08 00:31:46,166 INFO L87 Difference]: Start difference. First operand 115 states and 161 transitions. Second operand has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 00:31:46,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:31:46,189 INFO L93 Difference]: Finished difference Result 214 states and 308 transitions. [2025-03-08 00:31:46,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 00:31:46,189 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 164 [2025-03-08 00:31:46,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:31:46,192 INFO L225 Difference]: With dead ends: 214 [2025-03-08 00:31:46,192 INFO L226 Difference]: Without dead ends: 121 [2025-03-08 00:31:46,194 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 320 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=92, Unknown=0, NotChecked=0, Total=182 [2025-03-08 00:31:46,194 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:31:46,194 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 99 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:31:46,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2025-03-08 00:31:46,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2025-03-08 00:31:46,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 116 states have (on average 1.3879310344827587) internal successors, (161), 116 states have internal predecessors, (161), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 00:31:46,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 167 transitions. [2025-03-08 00:31:46,205 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 167 transitions. Word has length 164 [2025-03-08 00:31:46,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:31:46,205 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 167 transitions. [2025-03-08 00:31:46,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 00:31:46,205 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 167 transitions. [2025-03-08 00:31:46,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-08 00:31:46,210 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:31:46,211 INFO L218 NwaCegarLoop]: trace histogram [42, 42, 42, 10, 10, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:31:46,218 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-08 00:31:46,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-03-08 00:31:46,411 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:31:46,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:31:46,412 INFO L85 PathProgramCache]: Analyzing trace with hash 2071325548, now seen corresponding path program 7 times [2025-03-08 00:31:46,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:31:46,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532598750] [2025-03-08 00:31:46,412 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 00:31:46,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:31:46,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-08 00:31:46,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-08 00:31:46,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:31:46,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:31:46,768 INFO L134 CoverageAnalysis]: Checked inductivity of 2831 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 2776 trivial. 0 not checked. [2025-03-08 00:31:46,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:31:46,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532598750] [2025-03-08 00:31:46,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532598750] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:31:46,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [381028077] [2025-03-08 00:31:46,769 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 00:31:46,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:31:46,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:31:46,771 INFO L229 MonitoredProcess]: Starting monitored process 10 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:31:46,773 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-08 00:31:46,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-08 00:31:46,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-08 00:31:46,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:31:46,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:31:46,932 INFO L256 TraceCheckSpWp]: Trace formula consists of 759 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-08 00:31:46,935 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:31:46,971 INFO L134 CoverageAnalysis]: Checked inductivity of 2831 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 2776 trivial. 0 not checked. [2025-03-08 00:31:46,972 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:31:47,162 INFO L134 CoverageAnalysis]: Checked inductivity of 2831 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 2776 trivial. 0 not checked. [2025-03-08 00:31:47,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [381028077] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:31:47,163 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:31:47,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2025-03-08 00:31:47,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333013691] [2025-03-08 00:31:47,164 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:31:47,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-08 00:31:47,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:31:47,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-08 00:31:47,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2025-03-08 00:31:47,166 INFO L87 Difference]: Start difference. First operand 121 states and 167 transitions. Second operand has 25 states, 25 states have (on average 1.84) internal successors, (46), 25 states have internal predecessors, (46), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-08 00:31:47,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:31:47,190 INFO L93 Difference]: Finished difference Result 241 states and 344 transitions. [2025-03-08 00:31:47,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-08 00:31:47,191 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.84) internal successors, (46), 25 states have internal predecessors, (46), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 170 [2025-03-08 00:31:47,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:31:47,193 INFO L225 Difference]: With dead ends: 241 [2025-03-08 00:31:47,193 INFO L226 Difference]: Without dead ends: 133 [2025-03-08 00:31:47,194 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 328 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2025-03-08 00:31:47,194 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:31:47,195 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 77 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:31:47,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2025-03-08 00:31:47,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2025-03-08 00:31:47,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 128 states have (on average 1.3515625) internal successors, (173), 128 states have internal predecessors, (173), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 00:31:47,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 179 transitions. [2025-03-08 00:31:47,206 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 179 transitions. Word has length 170 [2025-03-08 00:31:47,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:31:47,206 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 179 transitions. [2025-03-08 00:31:47,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.84) internal successors, (46), 25 states have internal predecessors, (46), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-08 00:31:47,206 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 179 transitions. [2025-03-08 00:31:47,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-03-08 00:31:47,210 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:31:47,211 INFO L218 NwaCegarLoop]: trace histogram [42, 42, 42, 22, 10, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:31:47,217 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-08 00:31:47,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-08 00:31:47,412 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:31:47,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:31:47,413 INFO L85 PathProgramCache]: Analyzing trace with hash -478310356, now seen corresponding path program 8 times [2025-03-08 00:31:47,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:31:47,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367236940] [2025-03-08 00:31:47,413 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:31:47,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:31:47,441 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 182 statements into 2 equivalence classes. [2025-03-08 00:31:47,479 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 182 of 182 statements. [2025-03-08 00:31:47,479 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:31:47,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:31:48,184 INFO L134 CoverageAnalysis]: Checked inductivity of 3029 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 2776 trivial. 0 not checked. [2025-03-08 00:31:48,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:31:48,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367236940] [2025-03-08 00:31:48,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367236940] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:31:48,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [132279042] [2025-03-08 00:31:48,185 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:31:48,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:31:48,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:31:48,187 INFO L229 MonitoredProcess]: Starting monitored process 11 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:31:48,188 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-08 00:31:48,269 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 182 statements into 2 equivalence classes. [2025-03-08 00:31:48,345 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 182 of 182 statements. [2025-03-08 00:31:48,345 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:31:48,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:31:48,349 INFO L256 TraceCheckSpWp]: Trace formula consists of 867 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-08 00:31:48,351 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:31:48,388 INFO L134 CoverageAnalysis]: Checked inductivity of 3029 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 2776 trivial. 0 not checked. [2025-03-08 00:31:48,388 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:31:49,030 INFO L134 CoverageAnalysis]: Checked inductivity of 3029 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 2776 trivial. 0 not checked. [2025-03-08 00:31:49,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [132279042] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:31:49,031 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:31:49,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2025-03-08 00:31:49,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46370774] [2025-03-08 00:31:49,031 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:31:49,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2025-03-08 00:31:49,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:31:49,033 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2025-03-08 00:31:49,034 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2025-03-08 00:31:49,034 INFO L87 Difference]: Start difference. First operand 133 states and 179 transitions. Second operand has 49 states, 49 states have (on average 1.4285714285714286) internal successors, (70), 49 states have internal predecessors, (70), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-08 00:31:49,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:31:49,083 INFO L93 Difference]: Finished difference Result 265 states and 380 transitions. [2025-03-08 00:31:49,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-03-08 00:31:49,084 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 1.4285714285714286) internal successors, (70), 49 states have internal predecessors, (70), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 182 [2025-03-08 00:31:49,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:31:49,085 INFO L225 Difference]: With dead ends: 265 [2025-03-08 00:31:49,085 INFO L226 Difference]: Without dead ends: 157 [2025-03-08 00:31:49,086 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 340 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2025-03-08 00:31:49,087 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:31:49,087 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 102 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:31:49,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2025-03-08 00:31:49,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2025-03-08 00:31:49,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 152 states have (on average 1.2960526315789473) internal successors, (197), 152 states have internal predecessors, (197), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 00:31:49,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 203 transitions. [2025-03-08 00:31:49,101 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 203 transitions. Word has length 182 [2025-03-08 00:31:49,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:31:49,101 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 203 transitions. [2025-03-08 00:31:49,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 1.4285714285714286) internal successors, (70), 49 states have internal predecessors, (70), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-08 00:31:49,102 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 203 transitions. [2025-03-08 00:31:49,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-03-08 00:31:49,103 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:31:49,103 INFO L218 NwaCegarLoop]: trace histogram [46, 42, 42, 42, 10, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:31:49,110 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-08 00:31:49,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-08 00:31:49,304 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:31:49,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:31:49,304 INFO L85 PathProgramCache]: Analyzing trace with hash -469141076, now seen corresponding path program 9 times [2025-03-08 00:31:49,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:31:49,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978990968] [2025-03-08 00:31:49,304 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:31:49,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:31:49,329 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 206 statements into 30 equivalence classes. [2025-03-08 00:31:49,379 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 73 of 206 statements. [2025-03-08 00:31:49,379 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-03-08 00:31:49,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:31:49,583 INFO L134 CoverageAnalysis]: Checked inductivity of 3857 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 3802 trivial. 0 not checked. [2025-03-08 00:31:49,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:31:49,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978990968] [2025-03-08 00:31:49,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978990968] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:31:49,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1772919447] [2025-03-08 00:31:49,584 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:31:49,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:31:49,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:31:49,587 INFO L229 MonitoredProcess]: Starting monitored process 12 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:31:49,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-08 00:31:49,692 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 206 statements into 30 equivalence classes. [2025-03-08 00:31:50,235 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 73 of 206 statements. [2025-03-08 00:31:50,235 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-03-08 00:31:50,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:31:50,239 INFO L256 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-08 00:31:50,241 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:31:50,281 INFO L134 CoverageAnalysis]: Checked inductivity of 3857 backedges. 1240 proven. 55 refuted. 0 times theorem prover too weak. 2562 trivial. 0 not checked. [2025-03-08 00:31:50,281 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:31:50,479 INFO L134 CoverageAnalysis]: Checked inductivity of 3857 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 3802 trivial. 0 not checked. [2025-03-08 00:31:50,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1772919447] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:31:50,482 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:31:50,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 26 [2025-03-08 00:31:50,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552936534] [2025-03-08 00:31:50,483 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:31:50,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-08 00:31:50,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:31:50,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-08 00:31:50,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=324, Invalid=326, Unknown=0, NotChecked=0, Total=650 [2025-03-08 00:31:50,485 INFO L87 Difference]: Start difference. First operand 157 states and 203 transitions. Second operand has 26 states, 26 states have (on average 1.8461538461538463) internal successors, (48), 26 states have internal predecessors, (48), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 00:31:50,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:31:50,513 INFO L93 Difference]: Finished difference Result 262 states and 362 transitions. [2025-03-08 00:31:50,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-08 00:31:50,514 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.8461538461538463) internal successors, (48), 26 states have internal predecessors, (48), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 206 [2025-03-08 00:31:50,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:31:50,515 INFO L225 Difference]: With dead ends: 262 [2025-03-08 00:31:50,516 INFO L226 Difference]: Without dead ends: 169 [2025-03-08 00:31:50,517 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 398 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=324, Invalid=326, Unknown=0, NotChecked=0, Total=650 [2025-03-08 00:31:50,517 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:31:50,518 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 123 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:31:50,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2025-03-08 00:31:50,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2025-03-08 00:31:50,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 164 states have (on average 1.274390243902439) internal successors, (209), 164 states have internal predecessors, (209), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 00:31:50,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 215 transitions. [2025-03-08 00:31:50,527 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 215 transitions. Word has length 206 [2025-03-08 00:31:50,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:31:50,527 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 215 transitions. [2025-03-08 00:31:50,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.8461538461538463) internal successors, (48), 26 states have internal predecessors, (48), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 00:31:50,527 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 215 transitions. [2025-03-08 00:31:50,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2025-03-08 00:31:50,529 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:31:50,529 INFO L218 NwaCegarLoop]: trace histogram [46, 42, 42, 42, 22, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:31:50,537 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-08 00:31:50,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-08 00:31:50,733 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:31:50,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:31:50,733 INFO L85 PathProgramCache]: Analyzing trace with hash 91177836, now seen corresponding path program 10 times [2025-03-08 00:31:50,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:31:50,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565986421] [2025-03-08 00:31:50,734 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:31:50,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:31:50,764 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 218 statements into 2 equivalence classes. [2025-03-08 00:31:50,788 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 218 of 218 statements. [2025-03-08 00:31:50,788 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 00:31:50,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:31:51,202 INFO L134 CoverageAnalysis]: Checked inductivity of 4055 backedges. 0 proven. 1525 refuted. 0 times theorem prover too weak. 2530 trivial. 0 not checked. [2025-03-08 00:31:51,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:31:51,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565986421] [2025-03-08 00:31:51,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565986421] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:31:51,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [108992588] [2025-03-08 00:31:51,202 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:31:51,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:31:51,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:31:51,204 INFO L229 MonitoredProcess]: Starting monitored process 13 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:31:51,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-08 00:31:51,321 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 218 statements into 2 equivalence classes. [2025-03-08 00:31:51,439 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 218 of 218 statements. [2025-03-08 00:31:51,439 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 00:31:51,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:31:51,443 INFO L256 TraceCheckSpWp]: Trace formula consists of 1167 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-08 00:31:51,447 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:31:51,493 INFO L134 CoverageAnalysis]: Checked inductivity of 4055 backedges. 1236 proven. 287 refuted. 0 times theorem prover too weak. 2532 trivial. 0 not checked. [2025-03-08 00:31:51,493 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:31:51,787 INFO L134 CoverageAnalysis]: Checked inductivity of 4055 backedges. 0 proven. 1525 refuted. 0 times theorem prover too weak. 2530 trivial. 0 not checked. [2025-03-08 00:31:51,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [108992588] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:31:51,788 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:31:51,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 32 [2025-03-08 00:31:51,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482711432] [2025-03-08 00:31:51,789 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:31:51,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-08 00:31:51,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:31:51,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-08 00:31:51,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2025-03-08 00:31:51,790 INFO L87 Difference]: Start difference. First operand 169 states and 215 transitions. Second operand has 32 states, 32 states have (on average 3.46875) internal successors, (111), 32 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 00:31:51,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:31:51,927 INFO L93 Difference]: Finished difference Result 384 states and 541 transitions. [2025-03-08 00:31:51,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-08 00:31:51,928 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.46875) internal successors, (111), 32 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 218 [2025-03-08 00:31:51,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:31:51,930 INFO L225 Difference]: With dead ends: 384 [2025-03-08 00:31:51,930 INFO L226 Difference]: Without dead ends: 265 [2025-03-08 00:31:51,931 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 451 GetRequests, 421 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2025-03-08 00:31:51,931 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 532 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 532 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:31:51,931 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [532 Valid, 272 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:31:51,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2025-03-08 00:31:51,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 265. [2025-03-08 00:31:51,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 260 states have (on average 1.3576923076923078) internal successors, (353), 260 states have internal predecessors, (353), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 00:31:51,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 359 transitions. [2025-03-08 00:31:51,943 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 359 transitions. Word has length 218 [2025-03-08 00:31:51,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:31:51,943 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 359 transitions. [2025-03-08 00:31:51,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.46875) internal successors, (111), 32 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 00:31:51,943 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 359 transitions. [2025-03-08 00:31:51,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2025-03-08 00:31:51,947 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:31:51,948 INFO L218 NwaCegarLoop]: trace histogram [90, 90, 90, 46, 22, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:31:51,955 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-08 00:31:52,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-08 00:31:52,148 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:31:52,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:31:52,149 INFO L85 PathProgramCache]: Analyzing trace with hash 455414636, now seen corresponding path program 11 times [2025-03-08 00:31:52,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:31:52,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182004967] [2025-03-08 00:31:52,149 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 00:31:52,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:31:52,183 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 362 statements into 62 equivalence classes. [2025-03-08 00:31:52,566 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 61 check-sat command(s) and asserted 351 of 362 statements. [2025-03-08 00:31:52,567 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 61 check-sat command(s) [2025-03-08 00:31:52,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:31:53,672 INFO L134 CoverageAnalysis]: Checked inductivity of 13631 backedges. 2763 proven. 4098 refuted. 0 times theorem prover too weak. 6770 trivial. 0 not checked. [2025-03-08 00:31:53,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:31:53,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182004967] [2025-03-08 00:31:53,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182004967] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:31:53,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1188730654] [2025-03-08 00:31:53,672 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 00:31:53,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:31:53,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:31:53,674 INFO L229 MonitoredProcess]: Starting monitored process 14 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:31:53,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-08 00:31:53,826 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 362 statements into 62 equivalence classes.