./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loops-crafted-1/vnew2.c --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/loops-crafted-1/vnew2.c -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 6cb26fc448cefa547e2463448c16c0efba841bf620bbd2ba420ae15e288e3a3f --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 04:49:38,463 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 04:49:38,509 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 04:49:38,515 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 04:49:38,515 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 04:49:38,538 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 04:49:38,539 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 04:49:38,539 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 04:49:38,539 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 04:49:38,539 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 04:49:38,539 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 04:49:38,539 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 04:49:38,540 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 04:49:38,540 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 04:49:38,541 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 04:49:38,541 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 04:49:38,541 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 04:49:38,541 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 04:49:38,542 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 04:49:38,542 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 04:49:38,542 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 04:49:38,542 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 04:49:38,542 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 04:49:38,542 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 04:49:38,542 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 04:49:38,542 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 04:49:38,542 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 04:49:38,542 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 04:49:38,542 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 04:49:38,542 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 04:49:38,542 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 04:49:38,542 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 04:49:38,542 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 04:49:38,542 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 04:49:38,542 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 04:49:38,542 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 04:49:38,542 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 04:49:38,542 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 04:49:38,542 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 04:49:38,543 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 04:49:38,543 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 04:49:38,543 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 04:49:38,543 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 04:49:38,543 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 -> 6cb26fc448cefa547e2463448c16c0efba841bf620bbd2ba420ae15e288e3a3f [2025-03-08 04:49:38,767 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 04:49:38,774 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 04:49:38,776 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 04:49:38,776 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 04:49:38,777 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 04:49:38,777 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops-crafted-1/vnew2.c [2025-03-08 04:49:39,908 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea726a5e3/7541573a2a774b96992cc8c02cdb53d4/FLAGd1afd4daa [2025-03-08 04:49:40,106 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 04:49:40,107 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops-crafted-1/vnew2.c [2025-03-08 04:49:40,124 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea726a5e3/7541573a2a774b96992cc8c02cdb53d4/FLAGd1afd4daa [2025-03-08 04:49:40,133 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea726a5e3/7541573a2a774b96992cc8c02cdb53d4 [2025-03-08 04:49:40,136 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 04:49:40,138 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 04:49:40,139 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 04:49:40,139 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 04:49:40,142 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 04:49:40,143 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:49:40" (1/1) ... [2025-03-08 04:49:40,144 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@154be36a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:49:40, skipping insertion in model container [2025-03-08 04:49:40,144 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:49:40" (1/1) ... [2025-03-08 04:49:40,155 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 04:49:40,251 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/loops-crafted-1/vnew2.c[403,416] [2025-03-08 04:49:40,261 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 04:49:40,266 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 04:49:40,273 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/loops-crafted-1/vnew2.c[403,416] [2025-03-08 04:49:40,275 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 04:49:40,283 INFO L204 MainTranslator]: Completed translation [2025-03-08 04:49:40,284 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:49:40 WrapperNode [2025-03-08 04:49:40,284 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 04:49:40,284 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 04:49:40,284 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 04:49:40,284 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 04:49:40,288 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:49:40" (1/1) ... [2025-03-08 04:49:40,292 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:49:40" (1/1) ... [2025-03-08 04:49:40,300 INFO L138 Inliner]: procedures = 14, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 45 [2025-03-08 04:49:40,300 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 04:49:40,300 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 04:49:40,300 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 04:49:40,300 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 04:49:40,305 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:49:40" (1/1) ... [2025-03-08 04:49:40,305 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:49:40" (1/1) ... [2025-03-08 04:49:40,310 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:49:40" (1/1) ... [2025-03-08 04:49:40,316 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2025-03-08 04:49:40,316 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:49:40" (1/1) ... [2025-03-08 04:49:40,317 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:49:40" (1/1) ... [2025-03-08 04:49:40,318 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:49:40" (1/1) ... [2025-03-08 04:49:40,318 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:49:40" (1/1) ... [2025-03-08 04:49:40,319 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:49:40" (1/1) ... [2025-03-08 04:49:40,319 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:49:40" (1/1) ... [2025-03-08 04:49:40,320 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 04:49:40,320 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 04:49:40,320 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 04:49:40,320 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 04:49:40,321 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:49:40" (1/1) ... [2025-03-08 04:49:40,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 04:49:40,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:49:40,341 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 04:49:40,345 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 04:49:40,360 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 04:49:40,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 04:49:40,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 04:49:40,360 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 04:49:40,360 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 04:49:40,403 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 04:49:40,405 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 04:49:40,514 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2025-03-08 04:49:40,516 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 04:49:40,522 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 04:49:40,522 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 04:49:40,522 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:49:40 BoogieIcfgContainer [2025-03-08 04:49:40,523 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 04:49:40,524 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 04:49:40,524 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 04:49:40,527 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 04:49:40,527 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 04:49:40" (1/3) ... [2025-03-08 04:49:40,528 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d549510 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:49:40, skipping insertion in model container [2025-03-08 04:49:40,528 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:49:40" (2/3) ... [2025-03-08 04:49:40,528 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d549510 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:49:40, skipping insertion in model container [2025-03-08 04:49:40,528 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:49:40" (3/3) ... [2025-03-08 04:49:40,530 INFO L128 eAbstractionObserver]: Analyzing ICFG vnew2.c [2025-03-08 04:49:40,541 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 04:49:40,543 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG vnew2.c that has 1 procedures, 13 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 04:49:40,584 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 04:49:40,593 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;@6a231892, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 04:49:40,594 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 04:49:40,597 INFO L276 IsEmpty]: Start isEmpty. Operand has 13 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:49:40,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-08 04:49:40,601 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:49:40,601 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:49:40,602 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:49:40,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:49:40,605 INFO L85 PathProgramCache]: Analyzing trace with hash 1956902029, now seen corresponding path program 1 times [2025-03-08 04:49:40,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:49:40,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674789270] [2025-03-08 04:49:40,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:49:40,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:49:40,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-08 04:49:40,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-08 04:49:40,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:49:40,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:49:40,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:49:40,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:49:40,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674789270] [2025-03-08 04:49:40,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674789270] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:49:40,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 04:49:40,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 04:49:40,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613799729] [2025-03-08 04:49:40,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:49:40,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 04:49:40,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:49:40,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 04:49:40,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 04:49:40,868 INFO L87 Difference]: Start difference. First operand has 13 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:49:40,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:49:40,905 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2025-03-08 04:49:40,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 04:49:40,907 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-08 04:49:40,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:49:40,911 INFO L225 Difference]: With dead ends: 25 [2025-03-08 04:49:40,911 INFO L226 Difference]: Without dead ends: 9 [2025-03-08 04:49:40,912 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 04:49:40,915 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 2 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 04:49:40,916 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 23 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 04:49:40,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2025-03-08 04:49:40,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2025-03-08 04:49:40,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:49:40,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2025-03-08 04:49:40,939 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2025-03-08 04:49:40,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:49:40,940 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2025-03-08 04:49:40,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:49:40,940 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2025-03-08 04:49:40,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-08 04:49:40,941 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:49:40,941 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:49:40,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 04:49:40,941 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:49:40,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:49:40,942 INFO L85 PathProgramCache]: Analyzing trace with hash 533588566, now seen corresponding path program 1 times [2025-03-08 04:49:40,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:49:40,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314330991] [2025-03-08 04:49:40,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:49:40,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:49:40,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-08 04:49:40,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-08 04:49:40,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:49:40,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 04:49:40,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1345689036] [2025-03-08 04:49:40,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:49:40,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:49:40,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:49:40,997 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 04:49:41,000 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 04:49:41,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-08 04:49:41,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-08 04:49:41,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:49:41,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:49:41,055 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-08 04:49:41,061 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:49:41,226 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:49:41,227 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:49:41,454 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:49:41,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:49:41,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314330991] [2025-03-08 04:49:41,455 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 04:49:41,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1345689036] [2025-03-08 04:49:41,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1345689036] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 04:49:41,455 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 04:49:41,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2025-03-08 04:49:41,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64634628] [2025-03-08 04:49:41,456 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 04:49:41,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 04:49:41,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:49:41,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 04:49:41,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-08 04:49:41,457 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:49:43,689 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-08 04:49:43,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:49:43,835 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2025-03-08 04:49:43,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 04:49:43,835 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-08 04:49:43,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:49:43,836 INFO L225 Difference]: With dead ends: 18 [2025-03-08 04:49:43,836 INFO L226 Difference]: Without dead ends: 12 [2025-03-08 04:49:43,836 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2025-03-08 04:49:43,836 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 16 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-08 04:49:43,837 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 15 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-08 04:49:43,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2025-03-08 04:49:43,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2025-03-08 04:49:43,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:49:43,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2025-03-08 04:49:43,839 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 8 [2025-03-08 04:49:43,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:49:43,839 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2025-03-08 04:49:43,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:49:43,839 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2025-03-08 04:49:43,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-08 04:49:43,839 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:49:43,839 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:49:43,849 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 04:49:44,040 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 04:49:44,040 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:49:44,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:49:44,041 INFO L85 PathProgramCache]: Analyzing trace with hash -363356467, now seen corresponding path program 2 times [2025-03-08 04:49:44,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:49:44,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18578326] [2025-03-08 04:49:44,041 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 04:49:44,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:49:44,045 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-03-08 04:49:44,061 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-03-08 04:49:44,065 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 04:49:44,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 04:49:44,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [386217862] [2025-03-08 04:49:44,069 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 04:49:44,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:49:44,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:49:44,071 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 04:49:44,072 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 04:49:44,094 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-03-08 04:49:44,116 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-03-08 04:49:44,116 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 04:49:44,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:49:44,117 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-08 04:49:44,118 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:49:44,255 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:49:44,256 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:49:44,933 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:49:44,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:49:44,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18578326] [2025-03-08 04:49:44,934 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 04:49:44,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [386217862] [2025-03-08 04:49:44,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [386217862] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 04:49:44,934 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 04:49:44,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2025-03-08 04:49:44,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089961591] [2025-03-08 04:49:44,934 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 04:49:44,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-08 04:49:44,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:49:44,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-08 04:49:44,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2025-03-08 04:49:44,936 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand has 17 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 16 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:50:07,102 WARN L286 SmtUtils]: Spent 12.22s on a formula simplification. DAG size of input: 90 DAG size of output: 55 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-08 04:50:19,965 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.49s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-08 04:50:47,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:50:47,368 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2025-03-08 04:50:47,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-08 04:50:47,369 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 16 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-03-08 04:50:47,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:50:47,369 INFO L225 Difference]: With dead ends: 27 [2025-03-08 04:50:47,369 INFO L226 Difference]: Without dead ends: 18 [2025-03-08 04:50:47,369 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 57.3s TimeCoverageRelationStatistics Valid=226, Invalid=472, Unknown=4, NotChecked=0, Total=702 [2025-03-08 04:50:47,370 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 33 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2025-03-08 04:50:47,370 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 25 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 5.7s Time] [2025-03-08 04:50:47,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2025-03-08 04:50:47,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2025-03-08 04:50:47,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:50:47,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2025-03-08 04:50:47,376 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 11 [2025-03-08 04:50:47,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:50:47,377 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2025-03-08 04:50:47,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 16 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:50:47,377 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2025-03-08 04:50:47,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-08 04:50:47,377 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:50:47,377 INFO L218 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:50:47,384 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 04:50:47,578 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 04:50:47,578 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:50:47,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:50:47,579 INFO L85 PathProgramCache]: Analyzing trace with hash -240139731, now seen corresponding path program 3 times [2025-03-08 04:50:47,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:50:47,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618869954] [2025-03-08 04:50:47,580 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 04:50:47,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:50:47,586 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 17 statements into 6 equivalence classes. [2025-03-08 04:50:47,705 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 17 of 17 statements. [2025-03-08 04:50:47,705 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-08 04:50:47,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 04:50:47,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [714512416] [2025-03-08 04:50:47,709 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 04:50:47,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:50:47,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:50:47,712 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 04:50:47,713 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 04:50:47,734 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 17 statements into 6 equivalence classes. [2025-03-08 04:50:47,808 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 17 of 17 statements. [2025-03-08 04:50:47,808 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-08 04:50:47,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:50:47,809 WARN L254 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 77 conjuncts are in the unsatisfiable core [2025-03-08 04:50:47,810 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:50:48,100 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:50:48,100 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:50:49,297 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:50:49,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:50:49,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618869954] [2025-03-08 04:50:49,297 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 04:50:49,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [714512416] [2025-03-08 04:50:49,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [714512416] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 04:50:49,297 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 04:50:49,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 29 [2025-03-08 04:50:49,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16542592] [2025-03-08 04:50:49,297 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 04:50:49,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-08 04:50:49,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:50:49,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-08 04:50:49,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=643, Unknown=0, NotChecked=0, Total=870 [2025-03-08 04:50:49,299 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand has 30 states, 30 states have (on average 1.1) internal successors, (33), 29 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:50:53,428 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse24 (mod (+ 9 |c_ULTIMATE.start_main_~i~0#1|) 4294967296)) (.cse8 (mod (+ 6 |c_ULTIMATE.start_main_~i~0#1|) 4294967296)) (.cse13 (mod (+ 3 |c_ULTIMATE.start_main_~i~0#1|) 4294967296)) (.cse0 (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296))) (let ((.cse3 (+ .cse0 1)) (.cse1 (mod |c_ULTIMATE.start_main_~j~0#1| 4294967296)) (.cse7 (+ .cse13 1)) (.cse10 (mod (+ 15 |c_ULTIMATE.start_main_~i~0#1|) 4294967296)) (.cse16 (mod (+ 12 |c_ULTIMATE.start_main_~i~0#1|) 4294967296)) (.cse6 (mod |c_ULTIMATE.start_main_~n~0#1| 4294967296)) (.cse19 (+ .cse8 1)) (.cse15 (+ .cse24 1)) (.cse5 (mod (+ 2 c_~SIZE~0) 4294967296))) (and (= .cse0 .cse1) (let ((.cse2 (mod (+ 21 |c_ULTIMATE.start_main_~i~0#1|) 4294967296))) (or (< .cse2 .cse3) (let ((.cse4 (mod (+ |c_ULTIMATE.start_main_~j~0#1| 21) 4294967296))) (and (= (mod (+ 21 |c_ULTIMATE.start_main_~k~0#1|) 4294967296) .cse4) (not (= (mod (mod .cse2 .cse5) 4294967296) 0)) (= .cse4 .cse2))))) (or (< .cse6 .cse7) (< .cse8 .cse6) (let ((.cse9 (mod (+ |c_ULTIMATE.start_main_~j~0#1| 6) 4294967296))) (and (= .cse9 (mod (+ 6 |c_ULTIMATE.start_main_~k~0#1|) 4294967296)) (= .cse9 .cse8) (not (= (mod (mod .cse8 .cse5) 4294967296) 0))))) (let ((.cse11 (mod (+ |c_ULTIMATE.start_main_~i~0#1| 18) 4294967296))) (or (< .cse6 (+ .cse10 1)) (< .cse11 .cse6) (let ((.cse12 (mod (+ |c_ULTIMATE.start_main_~j~0#1| 18) 4294967296))) (and (not (= (mod (mod .cse11 .cse5) 4294967296) 0)) (= .cse12 .cse11) (= .cse12 (mod (+ 18 |c_ULTIMATE.start_main_~k~0#1|) 4294967296)))))) (or (< .cse13 .cse6) (let ((.cse14 (mod (+ |c_ULTIMATE.start_main_~j~0#1| 3) 4294967296))) (and (= .cse14 (mod (+ 3 |c_ULTIMATE.start_main_~k~0#1|) 4294967296)) (not (= (mod (mod .cse13 .cse5) 4294967296) 0)) (= .cse13 .cse14))) (< .cse6 .cse3)) (= .cse1 (mod |c_ULTIMATE.start_main_~k~0#1| 4294967296)) (or (< .cse6 .cse15) (< .cse16 .cse6) (let ((.cse17 (mod (+ |c_ULTIMATE.start_main_~j~0#1| 12) 4294967296))) (and (= .cse16 .cse17) (not (= (mod (mod .cse16 .cse5) 4294967296) 0)) (= (mod (+ 12 |c_ULTIMATE.start_main_~k~0#1|) 4294967296) .cse17)))) (not (= (mod (mod .cse0 .cse5) 4294967296) 0)) (let ((.cse18 (mod (+ |c_ULTIMATE.start_main_~i~0#1| 27) 4294967296))) (or (< .cse18 .cse19) (let ((.cse20 (mod (+ |c_ULTIMATE.start_main_~j~0#1| 27) 4294967296))) (and (= (mod (+ 27 |c_ULTIMATE.start_main_~k~0#1|) 4294967296) .cse20) (= .cse18 .cse20) (not (= (mod (mod .cse18 .cse5) 4294967296) 0)))))) (let ((.cse21 (mod (+ |c_ULTIMATE.start_main_~i~0#1| 24) 4294967296))) (or (< .cse21 .cse7) (let ((.cse22 (mod (+ |c_ULTIMATE.start_main_~j~0#1| 24) 4294967296))) (and (not (= (mod (mod .cse21 .cse5) 4294967296) 0)) (= .cse22 (mod (+ |c_ULTIMATE.start_main_~k~0#1| 24) 4294967296)) (= .cse22 .cse21))))) (or (let ((.cse23 (mod (+ |c_ULTIMATE.start_main_~j~0#1| 15) 4294967296))) (and (= .cse10 .cse23) (= .cse23 (mod (+ 15 |c_ULTIMATE.start_main_~k~0#1|) 4294967296)) (not (= (mod (mod .cse10 .cse5) 4294967296) 0)))) (< .cse10 .cse6) (< .cse6 (+ .cse16 1))) (= 20000001 c_~SIZE~0) (or (< .cse24 .cse6) (let ((.cse25 (mod (+ |c_ULTIMATE.start_main_~j~0#1| 9) 4294967296))) (and (= .cse24 .cse25) (not (= (mod (mod .cse24 .cse5) 4294967296) 0)) (= (mod (+ 9 |c_ULTIMATE.start_main_~k~0#1|) 4294967296) .cse25))) (< .cse6 .cse19)) (let ((.cse26 (mod (+ 30 |c_ULTIMATE.start_main_~i~0#1|) 4294967296))) (or (< .cse26 .cse15) (let ((.cse27 (mod (+ |c_ULTIMATE.start_main_~j~0#1| 30) 4294967296))) (and (= (mod (+ 30 |c_ULTIMATE.start_main_~k~0#1|) 4294967296) .cse27) (= .cse26 .cse27) (not (= (mod (mod .cse26 .cse5) 4294967296) 0))))))))) is different from false