./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/cohendiv-ll_unwindbound10.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/nla-digbench-scaling/cohendiv-ll_unwindbound10.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 a340dc1e9a375ad2082e9c8cecf3a1a681edcfe0f7220085504fa1991ced3d70 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 04:54:49,159 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 04:54:49,216 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 04:54:49,221 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 04:54:49,224 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 04:54:49,245 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 04:54:49,247 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 04:54:49,247 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 04:54:49,247 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 04:54:49,248 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 04:54:49,248 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 04:54:49,248 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 04:54:49,249 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 04:54:49,249 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 04:54:49,249 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 04:54:49,249 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 04:54:49,250 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 04:54:49,250 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 04:54:49,250 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 04:54:49,250 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 04:54:49,250 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 04:54:49,250 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 04:54:49,250 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 04:54:49,250 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 04:54:49,250 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 04:54:49,250 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 04:54:49,250 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 04:54:49,250 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 04:54:49,250 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 04:54:49,251 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 04:54:49,251 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 04:54:49,251 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 04:54:49,251 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 04:54:49,251 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 04:54:49,251 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 04:54:49,251 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 04:54:49,251 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 04:54:49,252 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 04:54:49,252 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 04:54:49,252 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 04:54:49,252 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 04:54:49,252 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 04:54:49,252 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 04:54:49,252 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 -> a340dc1e9a375ad2082e9c8cecf3a1a681edcfe0f7220085504fa1991ced3d70 [2025-03-08 04:54:49,456 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 04:54:49,463 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 04:54:49,465 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 04:54:49,465 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 04:54:49,465 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 04:54:49,467 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/cohendiv-ll_unwindbound10.c [2025-03-08 04:54:50,561 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c6060922/e328897ca1134ee587ceb17682b921bb/FLAG7e43a0893 [2025-03-08 04:54:50,747 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 04:54:50,748 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/cohendiv-ll_unwindbound10.c [2025-03-08 04:54:50,753 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c6060922/e328897ca1134ee587ceb17682b921bb/FLAG7e43a0893 [2025-03-08 04:54:50,762 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c6060922/e328897ca1134ee587ceb17682b921bb [2025-03-08 04:54:50,764 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 04:54:50,765 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 04:54:50,765 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 04:54:50,766 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 04:54:50,768 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 04:54:50,769 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:54:50" (1/1) ... [2025-03-08 04:54:50,769 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49f4877d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:54:50, skipping insertion in model container [2025-03-08 04:54:50,769 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:54:50" (1/1) ... [2025-03-08 04:54:50,780 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 04:54:50,881 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/nla-digbench-scaling/cohendiv-ll_unwindbound10.c[576,589] [2025-03-08 04:54:50,897 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 04:54:50,903 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 04:54:50,912 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/nla-digbench-scaling/cohendiv-ll_unwindbound10.c[576,589] [2025-03-08 04:54:50,918 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 04:54:50,928 INFO L204 MainTranslator]: Completed translation [2025-03-08 04:54:50,930 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:54:50 WrapperNode [2025-03-08 04:54:50,930 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 04:54:50,931 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 04:54:50,931 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 04:54:50,931 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 04:54:50,936 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:54:50" (1/1) ... [2025-03-08 04:54:50,941 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:54:50" (1/1) ... [2025-03-08 04:54:50,954 INFO L138 Inliner]: procedures = 14, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 65 [2025-03-08 04:54:50,955 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 04:54:50,955 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 04:54:50,956 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 04:54:50,956 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 04:54:50,960 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:54:50" (1/1) ... [2025-03-08 04:54:50,961 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:54:50" (1/1) ... [2025-03-08 04:54:50,966 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:54:50" (1/1) ... [2025-03-08 04:54:50,976 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 04:54:50,976 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:54:50" (1/1) ... [2025-03-08 04:54:50,976 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:54:50" (1/1) ... [2025-03-08 04:54:50,980 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:54:50" (1/1) ... [2025-03-08 04:54:50,981 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:54:50" (1/1) ... [2025-03-08 04:54:50,982 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:54:50" (1/1) ... [2025-03-08 04:54:50,985 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:54:50" (1/1) ... [2025-03-08 04:54:50,986 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 04:54:50,987 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 04:54:50,989 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 04:54:50,989 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 04:54:50,990 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:54:50" (1/1) ... [2025-03-08 04:54:50,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 04:54:51,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:54:51,014 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:54:51,019 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:54:51,034 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 04:54:51,034 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 04:54:51,035 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 04:54:51,035 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 04:54:51,035 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-08 04:54:51,035 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-08 04:54:51,069 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 04:54:51,071 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 04:54:51,193 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2025-03-08 04:54:51,193 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 04:54:51,203 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 04:54:51,203 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 04:54:51,204 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:54:51 BoogieIcfgContainer [2025-03-08 04:54:51,204 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 04:54:51,205 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 04:54:51,205 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 04:54:51,208 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 04:54:51,208 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 04:54:50" (1/3) ... [2025-03-08 04:54:51,209 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fb9bae4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:54:51, skipping insertion in model container [2025-03-08 04:54:51,209 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:54:50" (2/3) ... [2025-03-08 04:54:51,209 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fb9bae4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:54:51, skipping insertion in model container [2025-03-08 04:54:51,209 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:54:51" (3/3) ... [2025-03-08 04:54:51,210 INFO L128 eAbstractionObserver]: Analyzing ICFG cohendiv-ll_unwindbound10.c [2025-03-08 04:54:51,220 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 04:54:51,222 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG cohendiv-ll_unwindbound10.c that has 2 procedures, 29 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-08 04:54:51,265 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 04:54:51,275 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;@541218ec, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 04:54:51,275 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 04:54:51,279 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 20 states have internal predecessors, (28), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-08 04:54:51,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-08 04:54:51,283 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:54:51,283 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:54:51,284 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:54:51,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:54:51,288 INFO L85 PathProgramCache]: Analyzing trace with hash -622271081, now seen corresponding path program 1 times [2025-03-08 04:54:51,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:54:51,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398107319] [2025-03-08 04:54:51,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:54:51,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:54:51,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-08 04:54:51,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-08 04:54:51,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:54:51,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:54:51,394 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:54:51,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:54:51,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398107319] [2025-03-08 04:54:51,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398107319] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:54:51,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 04:54:51,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 04:54:51,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560385981] [2025-03-08 04:54:51,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:54:51,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 04:54:51,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:54:51,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 04:54:51,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 04:54:51,415 INFO L87 Difference]: Start difference. First operand has 29 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 20 states have internal predecessors, (28), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:54:51,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:54:51,429 INFO L93 Difference]: Finished difference Result 55 states and 87 transitions. [2025-03-08 04:54:51,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 04:54:51,431 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-03-08 04:54:51,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:54:51,434 INFO L225 Difference]: With dead ends: 55 [2025-03-08 04:54:51,434 INFO L226 Difference]: Without dead ends: 25 [2025-03-08 04:54:51,436 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 04:54:51,438 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 04:54:51,438 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 04:54:51,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-03-08 04:54:51,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2025-03-08 04:54:51,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 16 states have (on average 1.3125) internal successors, (21), 17 states have internal predecessors, (21), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-08 04:54:51,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 34 transitions. [2025-03-08 04:54:51,463 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 34 transitions. Word has length 9 [2025-03-08 04:54:51,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:54:51,464 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 34 transitions. [2025-03-08 04:54:51,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:54:51,464 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 34 transitions. [2025-03-08 04:54:51,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-08 04:54:51,465 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:54:51,465 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:54:51,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 04:54:51,465 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:54:51,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:54:51,467 INFO L85 PathProgramCache]: Analyzing trace with hash -410710419, now seen corresponding path program 1 times [2025-03-08 04:54:51,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:54:51,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198459210] [2025-03-08 04:54:51,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:54:51,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:54:51,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-08 04:54:51,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-08 04:54:51,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:54:51,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 04:54:51,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [541216494] [2025-03-08 04:54:51,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:54:51,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:54:51,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:54:51,498 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:54:51,499 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:54:51,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-08 04:54:51,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-08 04:54:51,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:54:51,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:54:51,557 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 04:54:51,562 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:54:51,639 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:54:51,640 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 04:54:51,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:54:51,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198459210] [2025-03-08 04:54:51,641 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 04:54:51,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [541216494] [2025-03-08 04:54:51,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [541216494] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:54:51,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 04:54:51,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 04:54:51,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17621775] [2025-03-08 04:54:51,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:54:51,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 04:54:51,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:54:51,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 04:54:51,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 04:54:51,644 INFO L87 Difference]: Start difference. First operand 25 states and 34 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:54:51,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:54:51,696 INFO L93 Difference]: Finished difference Result 37 states and 49 transitions. [2025-03-08 04:54:51,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 04:54:51,696 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-03-08 04:54:51,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:54:51,697 INFO L225 Difference]: With dead ends: 37 [2025-03-08 04:54:51,697 INFO L226 Difference]: Without dead ends: 35 [2025-03-08 04:54:51,697 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 04:54:51,697 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 5 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 04:54:51,698 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 111 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 04:54:51,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-03-08 04:54:51,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2025-03-08 04:54:51,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 23 states have internal predecessors, (27), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-08 04:54:51,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2025-03-08 04:54:51,707 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 10 [2025-03-08 04:54:51,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:54:51,707 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2025-03-08 04:54:51,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:54:51,707 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2025-03-08 04:54:51,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-08 04:54:51,708 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:54:51,708 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:54:51,714 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:54:51,913 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:54:51,913 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:54:51,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:54:51,913 INFO L85 PathProgramCache]: Analyzing trace with hash -410144390, now seen corresponding path program 1 times [2025-03-08 04:54:51,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:54:51,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74772775] [2025-03-08 04:54:51,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:54:51,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:54:51,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-08 04:54:51,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-08 04:54:51,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:54:51,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:54:51,969 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:54:51,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:54:51,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74772775] [2025-03-08 04:54:51,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74772775] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:54:51,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 04:54:51,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 04:54:51,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130825196] [2025-03-08 04:54:51,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:54:51,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 04:54:51,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:54:51,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 04:54:51,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 04:54:51,970 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:54:51,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:54:51,990 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2025-03-08 04:54:51,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 04:54:51,990 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-03-08 04:54:51,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:54:51,991 INFO L225 Difference]: With dead ends: 39 [2025-03-08 04:54:51,992 INFO L226 Difference]: Without dead ends: 32 [2025-03-08 04:54:51,992 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 04:54:51,993 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 04:54:51,994 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 89 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 04:54:51,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-03-08 04:54:51,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2025-03-08 04:54:52,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 23 states have internal predecessors, (26), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-08 04:54:52,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2025-03-08 04:54:52,002 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 10 [2025-03-08 04:54:52,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:54:52,002 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 41 transitions. [2025-03-08 04:54:52,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:54:52,002 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2025-03-08 04:54:52,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-08 04:54:52,003 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:54:52,003 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:54:52,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 04:54:52,003 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:54:52,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:54:52,004 INFO L85 PathProgramCache]: Analyzing trace with hash -535652522, now seen corresponding path program 1 times [2025-03-08 04:54:52,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:54:52,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673164683] [2025-03-08 04:54:52,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:54:52,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:54:52,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-08 04:54:52,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-08 04:54:52,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:54:52,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 04:54:52,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2049326263] [2025-03-08 04:54:52,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:54:52,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:54:52,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:54:52,029 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:54:52,030 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:54:52,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-08 04:54:52,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-08 04:54:52,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:54:52,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:54:52,060 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 04:54:52,062 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:54:52,113 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:54:52,114 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 04:54:52,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:54:52,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673164683] [2025-03-08 04:54:52,114 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 04:54:52,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2049326263] [2025-03-08 04:54:52,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2049326263] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:54:52,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 04:54:52,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 04:54:52,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3650832] [2025-03-08 04:54:52,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:54:52,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 04:54:52,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:54:52,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 04:54:52,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 04:54:52,115 INFO L87 Difference]: Start difference. First operand 32 states and 41 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 04:54:52,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:54:52,186 INFO L93 Difference]: Finished difference Result 50 states and 66 transitions. [2025-03-08 04:54:52,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 04:54:52,187 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2025-03-08 04:54:52,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:54:52,198 INFO L225 Difference]: With dead ends: 50 [2025-03-08 04:54:52,198 INFO L226 Difference]: Without dead ends: 47 [2025-03-08 04:54:52,198 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 04:54:52,199 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 11 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 04:54:52,199 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 100 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 04:54:52,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-03-08 04:54:52,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2025-03-08 04:54:52,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 30 states have internal predecessors, (36), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-08 04:54:52,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 61 transitions. [2025-03-08 04:54:52,205 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 61 transitions. Word has length 15 [2025-03-08 04:54:52,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:54:52,205 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 61 transitions. [2025-03-08 04:54:52,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 04:54:52,205 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 61 transitions. [2025-03-08 04:54:52,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-08 04:54:52,206 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:54:52,206 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:54:52,211 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 04:54:52,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-08 04:54:52,406 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:54:52,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:54:52,407 INFO L85 PathProgramCache]: Analyzing trace with hash 129397294, now seen corresponding path program 1 times [2025-03-08 04:54:52,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:54:52,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419390929] [2025-03-08 04:54:52,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:54:52,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:54:52,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-08 04:54:52,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-08 04:54:52,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:54:52,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 04:54:52,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1245040451] [2025-03-08 04:54:52,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:54:52,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:54:52,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:54:52,428 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:54:52,429 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:54:52,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-08 04:54:52,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-08 04:54:52,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:54:52,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:54:52,463 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 04:54:52,464 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:54:52,506 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 04:54:52,506 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 04:54:52,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:54:52,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419390929] [2025-03-08 04:54:52,507 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 04:54:52,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1245040451] [2025-03-08 04:54:52,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1245040451] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:54:52,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 04:54:52,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 04:54:52,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35309880] [2025-03-08 04:54:52,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:54:52,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 04:54:52,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:54:52,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 04:54:52,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 04:54:52,509 INFO L87 Difference]: Start difference. First operand 46 states and 61 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 04:54:52,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:54:52,563 INFO L93 Difference]: Finished difference Result 75 states and 105 transitions. [2025-03-08 04:54:52,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 04:54:52,563 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2025-03-08 04:54:52,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:54:52,565 INFO L225 Difference]: With dead ends: 75 [2025-03-08 04:54:52,566 INFO L226 Difference]: Without dead ends: 73 [2025-03-08 04:54:52,567 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 04:54:52,568 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 11 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 04:54:52,568 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 117 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 04:54:52,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-03-08 04:54:52,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 66. [2025-03-08 04:54:52,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 43 states have internal predecessors, (53), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-08 04:54:52,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 92 transitions. [2025-03-08 04:54:52,580 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 92 transitions. Word has length 23 [2025-03-08 04:54:52,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:54:52,580 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 92 transitions. [2025-03-08 04:54:52,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 04:54:52,580 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 92 transitions. [2025-03-08 04:54:52,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-08 04:54:52,581 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:54:52,581 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:54:52,588 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 04:54:52,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:54:52,786 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:54:52,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:54:52,786 INFO L85 PathProgramCache]: Analyzing trace with hash 762991238, now seen corresponding path program 1 times [2025-03-08 04:54:52,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:54:52,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686994175] [2025-03-08 04:54:52,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:54:52,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:54:52,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-08 04:54:52,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-08 04:54:52,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:54:52,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:54:52,874 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 04:54:52,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:54:52,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686994175] [2025-03-08 04:54:52,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686994175] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:54:52,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 04:54:52,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 04:54:52,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235735299] [2025-03-08 04:54:52,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:54:52,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 04:54:52,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:54:52,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 04:54:52,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 04:54:52,875 INFO L87 Difference]: Start difference. First operand 66 states and 92 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 04:54:52,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:54:52,899 INFO L93 Difference]: Finished difference Result 105 states and 145 transitions. [2025-03-08 04:54:52,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 04:54:52,902 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2025-03-08 04:54:52,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:54:52,902 INFO L225 Difference]: With dead ends: 105 [2025-03-08 04:54:52,902 INFO L226 Difference]: Without dead ends: 70 [2025-03-08 04:54:52,903 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 04:54:52,903 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 5 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 04:54:52,903 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 110 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 04:54:52,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-03-08 04:54:52,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2025-03-08 04:54:52,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 44 states have (on average 1.25) internal successors, (55), 46 states have internal predecessors, (55), 20 states have call successors, (20), 5 states have call predecessors, (20), 5 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-08 04:54:52,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 94 transitions. [2025-03-08 04:54:52,915 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 94 transitions. Word has length 26 [2025-03-08 04:54:52,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:54:52,915 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 94 transitions. [2025-03-08 04:54:52,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 04:54:52,915 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 94 transitions. [2025-03-08 04:54:52,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-08 04:54:52,916 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:54:52,916 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:54:52,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 04:54:52,916 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:54:52,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:54:52,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1103046962, now seen corresponding path program 1 times [2025-03-08 04:54:52,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:54:52,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233036770] [2025-03-08 04:54:52,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:54:52,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:54:52,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-08 04:54:52,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-08 04:54:52,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:54:52,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:54:53,080 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-08 04:54:53,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:54:53,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233036770] [2025-03-08 04:54:53,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233036770] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:54:53,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 04:54:53,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 04:54:53,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311403975] [2025-03-08 04:54:53,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:54:53,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 04:54:53,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:54:53,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 04:54:53,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-08 04:54:53,081 INFO L87 Difference]: Start difference. First operand 70 states and 94 transitions. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 04:54:53,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:54:53,133 INFO L93 Difference]: Finished difference Result 76 states and 99 transitions. [2025-03-08 04:54:53,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 04:54:53,134 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 33 [2025-03-08 04:54:53,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:54:53,135 INFO L225 Difference]: With dead ends: 76 [2025-03-08 04:54:53,135 INFO L226 Difference]: Without dead ends: 74 [2025-03-08 04:54:53,136 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-08 04:54:53,136 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 13 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 04:54:53,136 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 122 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 04:54:53,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-03-08 04:54:53,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2025-03-08 04:54:53,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 49 states have internal predecessors, (58), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-08 04:54:53,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 97 transitions. [2025-03-08 04:54:53,147 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 97 transitions. Word has length 33 [2025-03-08 04:54:53,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:54:53,147 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 97 transitions. [2025-03-08 04:54:53,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 04:54:53,147 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 97 transitions. [2025-03-08 04:54:53,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-08 04:54:53,148 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:54:53,148 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:54:53,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 04:54:53,148 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:54:53,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:54:53,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1704331479, now seen corresponding path program 1 times [2025-03-08 04:54:53,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:54:53,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52375282] [2025-03-08 04:54:53,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:54:53,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:54:53,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-08 04:54:53,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-08 04:54:53,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:54:53,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:54:53,294 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-08 04:54:53,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:54:53,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52375282] [2025-03-08 04:54:53,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52375282] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:54:53,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1521238966] [2025-03-08 04:54:53,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:54:53,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:54:53,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:54:53,297 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 04:54:53,298 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 04:54:53,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-08 04:54:53,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-08 04:54:53,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:54:53,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:54:53,333 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 04:54:53,334 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:54:53,396 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-08 04:54:53,396 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 04:54:53,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1521238966] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:54:53,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 04:54:53,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2025-03-08 04:54:53,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847148405] [2025-03-08 04:54:53,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:54:53,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 04:54:53,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:54:53,397 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 04:54:53,397 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-08 04:54:53,397 INFO L87 Difference]: Start difference. First operand 74 states and 97 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 04:54:53,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:54:53,473 INFO L93 Difference]: Finished difference Result 87 states and 113 transitions. [2025-03-08 04:54:53,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 04:54:53,474 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 39 [2025-03-08 04:54:53,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:54:53,475 INFO L225 Difference]: With dead ends: 87 [2025-03-08 04:54:53,475 INFO L226 Difference]: Without dead ends: 85 [2025-03-08 04:54:53,475 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2025-03-08 04:54:53,475 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 11 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 04:54:53,475 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 152 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 04:54:53,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-03-08 04:54:53,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 80. [2025-03-08 04:54:53,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 50 states have (on average 1.22) internal successors, (61), 54 states have internal predecessors, (61), 22 states have call successors, (22), 7 states have call predecessors, (22), 7 states have return successors, (21), 18 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-08 04:54:53,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 104 transitions. [2025-03-08 04:54:53,484 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 104 transitions. Word has length 39 [2025-03-08 04:54:53,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:54:53,484 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 104 transitions. [2025-03-08 04:54:53,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 04:54:53,485 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 104 transitions. [2025-03-08 04:54:53,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-08 04:54:53,485 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:54:53,485 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:54:53,491 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-08 04:54:53,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:54:53,686 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:54:53,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:54:53,686 INFO L85 PathProgramCache]: Analyzing trace with hash 1677554035, now seen corresponding path program 1 times [2025-03-08 04:54:53,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:54:53,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667973392] [2025-03-08 04:54:53,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:54:53,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:54:53,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-08 04:54:53,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-08 04:54:53,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:54:53,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:54:53,740 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-08 04:54:53,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:54:53,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667973392] [2025-03-08 04:54:53,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667973392] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:54:53,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [258485301] [2025-03-08 04:54:53,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:54:53,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:54:53,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:54:53,744 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 04:54:53,745 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 04:54:53,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-08 04:54:53,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-08 04:54:53,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:54:53,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:54:53,800 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 04:54:53,801 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:54:53,852 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 10 proven. 26 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-08 04:54:53,852 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:54:53,922 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-08 04:54:53,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [258485301] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 04:54:53,922 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 04:54:53,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 10 [2025-03-08 04:54:53,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713340664] [2025-03-08 04:54:53,923 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 04:54:53,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 04:54:53,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:54:53,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 04:54:53,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-08 04:54:53,924 INFO L87 Difference]: Start difference. First operand 80 states and 104 transitions. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 5 states have call successors, (16), 4 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2025-03-08 04:54:54,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:54:54,068 INFO L93 Difference]: Finished difference Result 247 states and 304 transitions. [2025-03-08 04:54:54,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 04:54:54,068 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 5 states have call successors, (16), 4 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) Word has length 42 [2025-03-08 04:54:54,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:54:54,070 INFO L225 Difference]: With dead ends: 247 [2025-03-08 04:54:54,070 INFO L226 Difference]: Without dead ends: 240 [2025-03-08 04:54:54,070 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2025-03-08 04:54:54,070 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 87 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 04:54:54,071 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 160 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 04:54:54,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2025-03-08 04:54:54,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 224. [2025-03-08 04:54:54,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 144 states have (on average 1.2013888888888888) internal successors, (173), 153 states have internal predecessors, (173), 55 states have call successors, (55), 24 states have call predecessors, (55), 24 states have return successors, (51), 46 states have call predecessors, (51), 51 states have call successors, (51) [2025-03-08 04:54:54,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 279 transitions. [2025-03-08 04:54:54,094 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 279 transitions. Word has length 42 [2025-03-08 04:54:54,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:54:54,095 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 279 transitions. [2025-03-08 04:54:54,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 5 states have call successors, (16), 4 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2025-03-08 04:54:54,096 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 279 transitions. [2025-03-08 04:54:54,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-08 04:54:54,097 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:54:54,097 INFO L218 NwaCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:54:54,105 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-08 04:54:54,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:54:54,298 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:54:54,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:54:54,298 INFO L85 PathProgramCache]: Analyzing trace with hash 1737026301, now seen corresponding path program 1 times [2025-03-08 04:54:54,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:54:54,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073476376] [2025-03-08 04:54:54,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:54:54,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:54:54,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-08 04:54:54,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-08 04:54:54,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:54:54,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 04:54:54,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1455566022] [2025-03-08 04:54:54,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:54:54,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:54:54,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:54:54,312 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 04:54:54,313 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 04:54:54,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-08 04:54:54,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-08 04:54:54,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:54:54,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:54:54,353 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-08 04:54:54,354 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:54:54,583 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-08 04:54:54,584 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:54:54,748 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-08 04:54:54,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:54:54,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073476376] [2025-03-08 04:54:54,749 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 04:54:54,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1455566022] [2025-03-08 04:54:54,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1455566022] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 04:54:54,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 04:54:54,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 16 [2025-03-08 04:54:54,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217010557] [2025-03-08 04:54:54,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:54:54,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 04:54:54,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:54:54,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 04:54:54,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2025-03-08 04:54:54,750 INFO L87 Difference]: Start difference. First operand 224 states and 279 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-08 04:54:54,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:54:54,863 INFO L93 Difference]: Finished difference Result 242 states and 296 transitions. [2025-03-08 04:54:54,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 04:54:54,863 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 47 [2025-03-08 04:54:54,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:54:54,865 INFO L225 Difference]: With dead ends: 242 [2025-03-08 04:54:54,865 INFO L226 Difference]: Without dead ends: 236 [2025-03-08 04:54:54,865 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2025-03-08 04:54:54,866 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 35 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 04:54:54,867 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 83 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 04:54:54,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2025-03-08 04:54:54,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 171. [2025-03-08 04:54:54,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 112 states have (on average 1.1339285714285714) internal successors, (127), 117 states have internal predecessors, (127), 36 states have call successors, (36), 22 states have call predecessors, (36), 22 states have return successors, (36), 31 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-08 04:54:54,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 199 transitions. [2025-03-08 04:54:54,897 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 199 transitions. Word has length 47 [2025-03-08 04:54:54,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:54:54,897 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 199 transitions. [2025-03-08 04:54:54,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-08 04:54:54,897 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 199 transitions. [2025-03-08 04:54:54,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-08 04:54:54,899 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:54:54,899 INFO L218 NwaCegarLoop]: trace histogram [10, 9, 9, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:54:54,904 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-08 04:54:55,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:54:55,099 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:54:55,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:54:55,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1902179702, now seen corresponding path program 1 times [2025-03-08 04:54:55,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:54:55,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067166489] [2025-03-08 04:54:55,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:54:55,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:54:55,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-08 04:54:55,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-08 04:54:55,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:54:55,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:54:55,227 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 39 proven. 7 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2025-03-08 04:54:55,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:54:55,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067166489] [2025-03-08 04:54:55,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067166489] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:54:55,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1227103028] [2025-03-08 04:54:55,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:54:55,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:54:55,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:54:55,229 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 04:54:55,231 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 04:54:55,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-08 04:54:55,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-08 04:54:55,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:54:55,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:54:55,271 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-08 04:54:55,273 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:54:55,314 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 39 proven. 7 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2025-03-08 04:54:55,315 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:54:55,393 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 39 proven. 7 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2025-03-08 04:54:55,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1227103028] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 04:54:55,393 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 04:54:55,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 11 [2025-03-08 04:54:55,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647941248] [2025-03-08 04:54:55,393 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 04:54:55,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 04:54:55,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:54:55,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 04:54:55,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-08 04:54:55,394 INFO L87 Difference]: Start difference. First operand 171 states and 199 transitions. Second operand has 11 states, 10 states have (on average 2.6) internal successors, (26), 8 states have internal predecessors, (26), 4 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-08 04:54:55,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:54:55,488 INFO L93 Difference]: Finished difference Result 183 states and 208 transitions. [2025-03-08 04:54:55,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 04:54:55,489 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 8 states have internal predecessors, (26), 4 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 63 [2025-03-08 04:54:55,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:54:55,490 INFO L225 Difference]: With dead ends: 183 [2025-03-08 04:54:55,491 INFO L226 Difference]: Without dead ends: 0 [2025-03-08 04:54:55,492 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 120 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2025-03-08 04:54:55,493 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 12 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 04:54:55,493 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 84 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 04:54:55,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-08 04:54:55,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-08 04:54:55,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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:54:55,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-08 04:54:55,494 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 63 [2025-03-08 04:54:55,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:54:55,494 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-08 04:54:55,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 8 states have internal predecessors, (26), 4 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-08 04:54:55,494 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-08 04:54:55,494 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-08 04:54:55,497 INFO L782 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 04:54:55,503 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 04:54:55,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:54:55,700 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:54:55,702 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-08 04:54:56,393 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 04:54:56,406 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 04:54:56 BoogieIcfgContainer [2025-03-08 04:54:56,406 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 04:54:56,406 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 04:54:56,406 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 04:54:56,406 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 04:54:56,407 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:54:51" (3/4) ... [2025-03-08 04:54:56,410 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-08 04:54:56,414 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2025-03-08 04:54:56,416 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2025-03-08 04:54:56,417 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-08 04:54:56,417 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-08 04:54:56,417 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-08 04:54:56,472 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 04:54:56,473 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 04:54:56,473 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 04:54:56,474 INFO L158 Benchmark]: Toolchain (without parser) took 5709.07ms. Allocated memory was 142.6MB in the beginning and 402.7MB in the end (delta: 260.0MB). Free memory was 113.4MB in the beginning and 320.2MB in the end (delta: -206.8MB). Peak memory consumption was 51.5MB. Max. memory is 16.1GB. [2025-03-08 04:54:56,474 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 124.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 04:54:56,475 INFO L158 Benchmark]: CACSL2BoogieTranslator took 164.53ms. Allocated memory is still 142.6MB. Free memory was 112.9MB in the beginning and 101.8MB in the end (delta: 11.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 04:54:56,475 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.13ms. Allocated memory is still 142.6MB. Free memory was 101.8MB in the beginning and 100.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 04:54:56,476 INFO L158 Benchmark]: Boogie Preprocessor took 30.86ms. Allocated memory is still 142.6MB. Free memory was 100.8MB in the beginning and 99.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 04:54:56,476 INFO L158 Benchmark]: IcfgBuilder took 216.92ms. Allocated memory is still 142.6MB. Free memory was 99.7MB in the beginning and 88.0MB in the end (delta: 11.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 04:54:56,476 INFO L158 Benchmark]: TraceAbstraction took 5200.81ms. Allocated memory was 142.6MB in the beginning and 402.7MB in the end (delta: 260.0MB). Free memory was 87.5MB in the beginning and 324.5MB in the end (delta: -237.0MB). Peak memory consumption was 202.6MB. Max. memory is 16.1GB. [2025-03-08 04:54:56,476 INFO L158 Benchmark]: Witness Printer took 66.75ms. Allocated memory is still 402.7MB. Free memory was 324.5MB in the beginning and 320.2MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 04:54:56,478 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 124.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 164.53ms. Allocated memory is still 142.6MB. Free memory was 112.9MB in the beginning and 101.8MB in the end (delta: 11.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.13ms. Allocated memory is still 142.6MB. Free memory was 101.8MB in the beginning and 100.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 30.86ms. Allocated memory is still 142.6MB. Free memory was 100.8MB in the beginning and 99.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 216.92ms. Allocated memory is still 142.6MB. Free memory was 99.7MB in the beginning and 88.0MB in the end (delta: 11.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 5200.81ms. Allocated memory was 142.6MB in the beginning and 402.7MB in the end (delta: 260.0MB). Free memory was 87.5MB in the beginning and 324.5MB in the end (delta: -237.0MB). Peak memory consumption was 202.6MB. Max. memory is 16.1GB. * Witness Printer took 66.75ms. Allocated memory is still 402.7MB. Free memory was 324.5MB in the beginning and 320.2MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 17]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 29 locations, 49 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.5s, OverallIterations: 11, TraceHistogramMax: 10, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 210 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 190 mSDsluCounter, 1166 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 839 mSDsCounter, 62 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 466 IncrementalHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 62 mSolverCounterUnsat, 327 mSDtfsCounter, 466 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 438 GetRequests, 360 SyntacticMatches, 4 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=224occurred in iteration=9, InterpolantAutomatonStates: 65, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 97 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 556 NumberOfCodeBlocks, 556 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 596 ConstructedInterpolants, 0 QuantifiedInterpolants, 1580 SizeOfPredicates, 13 NumberOfNonLiveVariables, 712 ConjunctsInSsa, 69 ConjunctsInUnsatCore, 17 InterpolantComputations, 9 PerfectInterpolantSequences, 905/967 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 46]: Location Invariant Derived location invariant: ((((((__int128) a * y) == b) && (1 <= y)) && (1 <= r)) && (((__int128) b + x) == ((((__int128) a * y) + r) + ((__int128) q * y)))) - InvariantResult [Line: 37]: Location Invariant Derived location invariant: (((x == (r + ((__int128) q * y))) && (1 <= y)) && (((__int128) b + x) == ((((__int128) a * y) + r) + ((__int128) q * y)))) RESULT: Ultimate proved your program to be correct! [2025-03-08 04:54:56,492 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE