./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/prod4br-ll_unwindbound5.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/prod4br-ll_unwindbound5.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 7f12bfc45347636ba11cd9198984e4ca6a9fb471afaf773fd02be6e88eb44e8c --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 05:17:17,046 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 05:17:17,102 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 05:17:17,109 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 05:17:17,109 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 05:17:17,124 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 05:17:17,125 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 05:17:17,125 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 05:17:17,125 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 05:17:17,126 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 05:17:17,126 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 05:17:17,126 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 05:17:17,127 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 05:17:17,127 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 05:17:17,127 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 05:17:17,127 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 05:17:17,127 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 05:17:17,127 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 05:17:17,127 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 05:17:17,127 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 05:17:17,127 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 05:17:17,127 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 05:17:17,127 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 05:17:17,127 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 05:17:17,127 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 05:17:17,127 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 05:17:17,127 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 05:17:17,127 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 05:17:17,127 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 05:17:17,128 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 05:17:17,128 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 05:17:17,128 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 05:17:17,128 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:17:17,128 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 05:17:17,128 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 05:17:17,128 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 05:17:17,128 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 05:17:17,128 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 05:17:17,128 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 05:17:17,128 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 05:17:17,128 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 05:17:17,128 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 05:17:17,128 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 05:17:17,128 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 -> 7f12bfc45347636ba11cd9198984e4ca6a9fb471afaf773fd02be6e88eb44e8c [2025-03-08 05:17:17,342 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 05:17:17,347 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 05:17:17,351 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 05:17:17,352 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 05:17:17,352 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 05:17:17,353 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/prod4br-ll_unwindbound5.c [2025-03-08 05:17:18,506 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/725793d20/20cd5d73faef42f0afdd39ee4418a1c6/FLAGd92f95c14 [2025-03-08 05:17:18,714 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 05:17:18,715 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/prod4br-ll_unwindbound5.c [2025-03-08 05:17:18,735 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/725793d20/20cd5d73faef42f0afdd39ee4418a1c6/FLAGd92f95c14 [2025-03-08 05:17:19,081 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/725793d20/20cd5d73faef42f0afdd39ee4418a1c6 [2025-03-08 05:17:19,083 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 05:17:19,085 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 05:17:19,086 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 05:17:19,086 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 05:17:19,090 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 05:17:19,090 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:17:19" (1/1) ... [2025-03-08 05:17:19,091 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50c89043 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:17:19, skipping insertion in model container [2025-03-08 05:17:19,091 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:17:19" (1/1) ... [2025-03-08 05:17:19,101 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 05:17:19,205 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/prod4br-ll_unwindbound5.c[524,537] [2025-03-08 05:17:19,226 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:17:19,237 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 05:17:19,247 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/prod4br-ll_unwindbound5.c[524,537] [2025-03-08 05:17:19,254 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:17:19,264 INFO L204 MainTranslator]: Completed translation [2025-03-08 05:17:19,265 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:17:19 WrapperNode [2025-03-08 05:17:19,265 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 05:17:19,266 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 05:17:19,267 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 05:17:19,267 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 05:17:19,272 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:17:19" (1/1) ... [2025-03-08 05:17:19,276 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:17:19" (1/1) ... [2025-03-08 05:17:19,293 INFO L138 Inliner]: procedures = 14, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 59 [2025-03-08 05:17:19,294 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 05:17:19,295 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 05:17:19,295 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 05:17:19,295 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 05:17:19,302 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:17:19" (1/1) ... [2025-03-08 05:17:19,302 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:17:19" (1/1) ... [2025-03-08 05:17:19,303 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:17:19" (1/1) ... [2025-03-08 05:17:19,320 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 05:17:19,321 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:17:19" (1/1) ... [2025-03-08 05:17:19,321 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:17:19" (1/1) ... [2025-03-08 05:17:19,323 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:17:19" (1/1) ... [2025-03-08 05:17:19,324 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:17:19" (1/1) ... [2025-03-08 05:17:19,325 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:17:19" (1/1) ... [2025-03-08 05:17:19,325 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:17:19" (1/1) ... [2025-03-08 05:17:19,326 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 05:17:19,327 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 05:17:19,328 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 05:17:19,328 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 05:17:19,329 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:17:19" (1/1) ... [2025-03-08 05:17:19,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:17:19,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:17:19,356 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 05:17:19,361 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 05:17:19,375 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 05:17:19,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 05:17:19,375 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 05:17:19,375 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 05:17:19,375 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-08 05:17:19,375 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-08 05:17:19,417 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 05:17:19,419 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 05:17:19,536 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2025-03-08 05:17:19,536 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 05:17:19,543 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 05:17:19,543 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 05:17:19,544 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:17:19 BoogieIcfgContainer [2025-03-08 05:17:19,544 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 05:17:19,546 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 05:17:19,546 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 05:17:19,550 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 05:17:19,551 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:17:19" (1/3) ... [2025-03-08 05:17:19,552 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@93ed913 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:17:19, skipping insertion in model container [2025-03-08 05:17:19,552 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:17:19" (2/3) ... [2025-03-08 05:17:19,552 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@93ed913 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:17:19, skipping insertion in model container [2025-03-08 05:17:19,553 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:17:19" (3/3) ... [2025-03-08 05:17:19,554 INFO L128 eAbstractionObserver]: Analyzing ICFG prod4br-ll_unwindbound5.c [2025-03-08 05:17:19,569 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 05:17:19,571 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG prod4br-ll_unwindbound5.c that has 2 procedures, 23 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 05:17:19,626 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 05:17:19,637 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;@d1df9f0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 05:17:19,637 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 05:17:19,640 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 05:17:19,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-08 05:17:19,646 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:17:19,646 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:17:19,647 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:17:19,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:17:19,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1148179021, now seen corresponding path program 1 times [2025-03-08 05:17:19,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:17:19,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916445474] [2025-03-08 05:17:19,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:17:19,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:17:19,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-08 05:17:19,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-08 05:17:19,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:17:19,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:17:19,774 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 05:17:19,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:17:19,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916445474] [2025-03-08 05:17:19,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916445474] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:17:19,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:17:19,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 05:17:19,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600781012] [2025-03-08 05:17:19,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:17:19,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 05:17:19,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:17:19,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 05:17:19,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 05:17:19,793 INFO L87 Difference]: Start difference. First operand has 23 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) 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 05:17:19,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:17:19,806 INFO L93 Difference]: Finished difference Result 43 states and 63 transitions. [2025-03-08 05:17:19,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 05:17:19,807 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 05:17:19,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:17:19,813 INFO L225 Difference]: With dead ends: 43 [2025-03-08 05:17:19,813 INFO L226 Difference]: Without dead ends: 19 [2025-03-08 05:17:19,816 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 05:17:19,818 INFO L435 NwaCegarLoop]: 29 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, 29 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 05:17:19,823 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:17:19,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2025-03-08 05:17:19,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2025-03-08 05:17:19,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 05:17:19,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2025-03-08 05:17:19,848 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 25 transitions. Word has length 9 [2025-03-08 05:17:19,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:17:19,849 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 25 transitions. [2025-03-08 05:17:19,850 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 05:17:19,851 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 25 transitions. [2025-03-08 05:17:19,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-08 05:17:19,851 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:17:19,851 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:17:19,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 05:17:19,852 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:17:19,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:17:19,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1363417483, now seen corresponding path program 1 times [2025-03-08 05:17:19,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:17:19,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028053267] [2025-03-08 05:17:19,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:17:19,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:17:19,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-08 05:17:19,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-08 05:17:19,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:17:19,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 05:17:19,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2121266813] [2025-03-08 05:17:19,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:17:19,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:17:19,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:17:19,880 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 05:17:19,883 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 05:17:19,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-08 05:17:19,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-08 05:17:19,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:17:19,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:17:19,930 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-08 05:17:19,933 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:17:20,122 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 05:17:20,122 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:17:20,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:17:20,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028053267] [2025-03-08 05:17:20,123 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 05:17:20,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2121266813] [2025-03-08 05:17:20,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2121266813] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:17:20,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:17:20,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 05:17:20,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037227046] [2025-03-08 05:17:20,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:17:20,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 05:17:20,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:17:20,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 05:17:20,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:17:20,126 INFO L87 Difference]: Start difference. First operand 19 states and 25 transitions. Second operand has 7 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 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 05:17:20,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:17:20,225 INFO L93 Difference]: Finished difference Result 34 states and 46 transitions. [2025-03-08 05:17:20,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 05:17:20,226 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 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 05:17:20,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:17:20,227 INFO L225 Difference]: With dead ends: 34 [2025-03-08 05:17:20,227 INFO L226 Difference]: Without dead ends: 32 [2025-03-08 05:17:20,227 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:17:20,228 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 28 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:17:20,228 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 53 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:17:20,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-03-08 05:17:20,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 26. [2025-03-08 05:17:20,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 19 states have (on average 1.368421052631579) internal successors, (26), 21 states have internal predecessors, (26), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 05:17:20,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2025-03-08 05:17:20,235 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 10 [2025-03-08 05:17:20,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:17:20,235 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2025-03-08 05:17:20,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 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 05:17:20,235 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2025-03-08 05:17:20,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-08 05:17:20,238 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:17:20,238 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:17:20,244 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 05:17:20,442 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 05:17:20,442 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:17:20,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:17:20,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1362553544, now seen corresponding path program 1 times [2025-03-08 05:17:20,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:17:20,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410377658] [2025-03-08 05:17:20,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:17:20,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:17:20,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-08 05:17:20,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-08 05:17:20,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:17:20,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:17:20,519 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 05:17:20,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:17:20,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410377658] [2025-03-08 05:17:20,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410377658] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:17:20,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:17:20,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:17:20,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041798091] [2025-03-08 05:17:20,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:17:20,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:17:20,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:17:20,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:17:20,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:17:20,521 INFO L87 Difference]: Start difference. First operand 26 states and 33 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 05:17:20,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:17:20,536 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2025-03-08 05:17:20,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:17:20,536 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 05:17:20,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:17:20,537 INFO L225 Difference]: With dead ends: 34 [2025-03-08 05:17:20,538 INFO L226 Difference]: Without dead ends: 26 [2025-03-08 05:17:20,538 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 05:17:20,538 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:17:20,538 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 63 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:17:20,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-03-08 05:17:20,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2025-03-08 05:17:20,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 21 states have internal predecessors, (25), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 05:17:20,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2025-03-08 05:17:20,546 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 10 [2025-03-08 05:17:20,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:17:20,547 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2025-03-08 05:17:20,547 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 05:17:20,547 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2025-03-08 05:17:20,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-08 05:17:20,547 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:17:20,547 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:17:20,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 05:17:20,548 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:17:20,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:17:20,548 INFO L85 PathProgramCache]: Analyzing trace with hash -187814629, now seen corresponding path program 1 times [2025-03-08 05:17:20,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:17:20,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553316759] [2025-03-08 05:17:20,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:17:20,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:17:20,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-08 05:17:20,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-08 05:17:20,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:17:20,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 05:17:20,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1210519068] [2025-03-08 05:17:20,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:17:20,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:17:20,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:17:20,568 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 05:17:20,570 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 05:17:20,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-08 05:17:20,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-08 05:17:20,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:17:20,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:17:20,602 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-08 05:17:20,603 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:17:20,806 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:17:20,806 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:17:20,990 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:17:20,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:17:20,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553316759] [2025-03-08 05:17:20,990 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 05:17:20,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1210519068] [2025-03-08 05:17:20,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1210519068] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:17:20,990 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 05:17:20,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 14 [2025-03-08 05:17:20,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806882666] [2025-03-08 05:17:20,991 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 05:17:20,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 05:17:20,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:17:20,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 05:17:20,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2025-03-08 05:17:20,992 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand has 14 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 05:17:21,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:17:21,235 INFO L93 Difference]: Finished difference Result 47 states and 64 transitions. [2025-03-08 05:17:21,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 05:17:21,235 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 16 [2025-03-08 05:17:21,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:17:21,236 INFO L225 Difference]: With dead ends: 47 [2025-03-08 05:17:21,236 INFO L226 Difference]: Without dead ends: 45 [2025-03-08 05:17:21,238 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2025-03-08 05:17:21,239 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 39 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 05:17:21,240 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 110 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 05:17:21,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-03-08 05:17:21,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 31. [2025-03-08 05:17:21,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 25 states have internal predecessors, (28), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-08 05:17:21,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2025-03-08 05:17:21,251 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 16 [2025-03-08 05:17:21,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:17:21,251 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2025-03-08 05:17:21,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 05:17:21,252 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2025-03-08 05:17:21,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-08 05:17:21,252 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:17:21,252 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:17:21,259 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 05:17:21,452 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 05:17:21,453 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:17:21,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:17:21,453 INFO L85 PathProgramCache]: Analyzing trace with hash 57485371, now seen corresponding path program 1 times [2025-03-08 05:17:21,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:17:21,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876219617] [2025-03-08 05:17:21,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:17:21,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:17:21,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-08 05:17:21,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-08 05:17:21,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:17:21,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 05:17:21,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [429167072] [2025-03-08 05:17:21,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:17:21,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:17:21,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:17:21,493 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 05:17:21,494 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 05:17:21,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-08 05:17:21,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-08 05:17:21,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:17:21,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:17:21,532 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-08 05:17:21,534 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:17:21,833 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:17:21,834 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:17:22,618 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:17:22,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:17:22,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876219617] [2025-03-08 05:17:22,619 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 05:17:22,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [429167072] [2025-03-08 05:17:22,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [429167072] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:17:22,619 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 05:17:22,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 16 [2025-03-08 05:17:22,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225727167] [2025-03-08 05:17:22,619 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 05:17:22,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-08 05:17:22,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:17:22,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-08 05:17:22,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2025-03-08 05:17:22,621 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand has 16 states, 16 states have (on average 1.6875) internal successors, (27), 15 states have internal predecessors, (27), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 05:17:23,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:17:23,208 INFO L93 Difference]: Finished difference Result 61 states and 86 transitions. [2025-03-08 05:17:23,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 05:17:23,209 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.6875) internal successors, (27), 15 states have internal predecessors, (27), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2025-03-08 05:17:23,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:17:23,210 INFO L225 Difference]: With dead ends: 61 [2025-03-08 05:17:23,210 INFO L226 Difference]: Without dead ends: 59 [2025-03-08 05:17:23,210 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2025-03-08 05:17:23,211 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 107 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 05:17:23,211 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 106 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 05:17:23,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-03-08 05:17:23,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 30. [2025-03-08 05:17:23,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 24 states have internal predecessors, (28), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 05:17:23,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2025-03-08 05:17:23,223 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 19 [2025-03-08 05:17:23,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:17:23,223 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2025-03-08 05:17:23,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.6875) internal successors, (27), 15 states have internal predecessors, (27), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 05:17:23,223 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2025-03-08 05:17:23,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-08 05:17:23,224 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:17:23,224 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:17:23,234 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 05:17:23,424 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 05:17:23,425 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:17:23,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:17:23,425 INFO L85 PathProgramCache]: Analyzing trace with hash 58349310, now seen corresponding path program 1 times [2025-03-08 05:17:23,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:17:23,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348955928] [2025-03-08 05:17:23,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:17:23,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:17:23,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-08 05:17:23,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-08 05:17:23,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:17:23,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:17:23,524 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:17:23,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:17:23,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348955928] [2025-03-08 05:17:23,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348955928] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:17:23,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [791906511] [2025-03-08 05:17:23,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:17:23,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:17:23,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:17:23,526 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 05:17:23,528 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 05:17:23,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-08 05:17:23,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-08 05:17:23,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:17:23,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:17:23,568 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 05:17:23,568 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:17:23,594 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:17:23,594 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:17:23,623 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:17:23,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [791906511] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:17:23,624 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:17:23,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 5] total 10 [2025-03-08 05:17:23,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284101474] [2025-03-08 05:17:23,624 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:17:23,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 05:17:23,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:17:23,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 05:17:23,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-08 05:17:23,625 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 05:17:23,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:17:23,698 INFO L93 Difference]: Finished difference Result 107 states and 124 transitions. [2025-03-08 05:17:23,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 05:17:23,699 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 19 [2025-03-08 05:17:23,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:17:23,700 INFO L225 Difference]: With dead ends: 107 [2025-03-08 05:17:23,701 INFO L226 Difference]: Without dead ends: 93 [2025-03-08 05:17:23,701 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2025-03-08 05:17:23,702 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 45 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:17:23,702 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 120 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:17:23,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-03-08 05:17:23,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 71. [2025-03-08 05:17:23,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 54 states have (on average 1.3333333333333333) internal successors, (72), 56 states have internal predecessors, (72), 9 states have call successors, (9), 8 states have call predecessors, (9), 7 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-08 05:17:23,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 88 transitions. [2025-03-08 05:17:23,719 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 88 transitions. Word has length 19 [2025-03-08 05:17:23,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:17:23,719 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 88 transitions. [2025-03-08 05:17:23,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 05:17:23,719 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 88 transitions. [2025-03-08 05:17:23,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-08 05:17:23,720 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:17:23,720 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:17:23,726 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 05:17:23,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:17:23,920 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:17:23,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:17:23,921 INFO L85 PathProgramCache]: Analyzing trace with hash 296845472, now seen corresponding path program 1 times [2025-03-08 05:17:23,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:17:23,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555206255] [2025-03-08 05:17:23,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:17:23,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:17:23,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-08 05:17:23,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-08 05:17:23,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:17:23,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 05:17:23,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [584563353] [2025-03-08 05:17:23,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:17:23,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:17:23,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:17:23,935 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 05:17:23,937 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 05:17:23,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-08 05:17:23,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-08 05:17:23,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:17:23,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:17:23,969 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 05:17:23,971 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:17:23,994 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 05:17:23,995 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:17:23,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:17:23,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555206255] [2025-03-08 05:17:23,995 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 05:17:23,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [584563353] [2025-03-08 05:17:23,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [584563353] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:17:23,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:17:23,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:17:23,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8646864] [2025-03-08 05:17:23,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:17:23,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:17:23,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:17:23,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:17:23,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:17:23,997 INFO L87 Difference]: Start difference. First operand 71 states and 88 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 05:17:24,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:17:24,037 INFO L93 Difference]: Finished difference Result 78 states and 94 transitions. [2025-03-08 05:17:24,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:17:24,037 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2025-03-08 05:17:24,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:17:24,038 INFO L225 Difference]: With dead ends: 78 [2025-03-08 05:17:24,038 INFO L226 Difference]: Without dead ends: 58 [2025-03-08 05:17:24,038 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 17 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 05:17:24,038 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 3 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:17:24,039 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 86 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:17:24,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-03-08 05:17:24,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2025-03-08 05:17:24,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 46 states have (on average 1.3043478260869565) internal successors, (60), 47 states have internal predecessors, (60), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-08 05:17:24,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 71 transitions. [2025-03-08 05:17:24,048 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 71 transitions. Word has length 21 [2025-03-08 05:17:24,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:17:24,049 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 71 transitions. [2025-03-08 05:17:24,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 05:17:24,049 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 71 transitions. [2025-03-08 05:17:24,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-08 05:17:24,049 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:17:24,049 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:17:24,055 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 05:17:24,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:17:24,250 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:17:24,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:17:24,250 INFO L85 PathProgramCache]: Analyzing trace with hash -726392136, now seen corresponding path program 2 times [2025-03-08 05:17:24,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:17:24,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193183634] [2025-03-08 05:17:24,251 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 05:17:24,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:17:24,256 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 46 statements into 2 equivalence classes. [2025-03-08 05:17:24,267 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 46 of 46 statements. [2025-03-08 05:17:24,268 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 05:17:24,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:17:24,517 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 8 proven. 38 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-08 05:17:24,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:17:24,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193183634] [2025-03-08 05:17:24,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193183634] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:17:24,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1318920143] [2025-03-08 05:17:24,519 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 05:17:24,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:17:24,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:17:24,520 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 05:17:24,522 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 05:17:24,548 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 46 statements into 2 equivalence classes. [2025-03-08 05:17:24,567 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 46 of 46 statements. [2025-03-08 05:17:24,567 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 05:17:24,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:17:24,568 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-08 05:17:24,569 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:17:24,619 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 8 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:17:24,620 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:17:24,687 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 8 proven. 38 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-08 05:17:24,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1318920143] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:17:24,688 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:17:24,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 8] total 11 [2025-03-08 05:17:24,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172619176] [2025-03-08 05:17:24,688 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:17:24,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 05:17:24,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:17:24,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 05:17:24,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2025-03-08 05:17:24,690 INFO L87 Difference]: Start difference. First operand 58 states and 71 transitions. Second operand has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 5 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-08 05:17:24,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:17:24,757 INFO L93 Difference]: Finished difference Result 77 states and 94 transitions. [2025-03-08 05:17:24,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 05:17:24,757 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 5 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 46 [2025-03-08 05:17:24,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:17:24,759 INFO L225 Difference]: With dead ends: 77 [2025-03-08 05:17:24,759 INFO L226 Difference]: Without dead ends: 69 [2025-03-08 05:17:24,759 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 85 SyntacticMatches, 6 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2025-03-08 05:17:24,760 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 25 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:17:24,760 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 151 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:17:24,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-03-08 05:17:24,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2025-03-08 05:17:24,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 55 states have (on average 1.309090909090909) internal successors, (72), 56 states have internal predecessors, (72), 7 states have call successors, (7), 6 states have call predecessors, (7), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-08 05:17:24,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 85 transitions. [2025-03-08 05:17:24,772 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 85 transitions. Word has length 46 [2025-03-08 05:17:24,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:17:24,772 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 85 transitions. [2025-03-08 05:17:24,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 5 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-08 05:17:24,772 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 85 transitions. [2025-03-08 05:17:24,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-08 05:17:24,773 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:17:24,773 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:17:24,779 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 05:17:24,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:17:24,977 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:17:24,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:17:24,978 INFO L85 PathProgramCache]: Analyzing trace with hash 895908222, now seen corresponding path program 3 times [2025-03-08 05:17:24,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:17:24,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653031808] [2025-03-08 05:17:24,978 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 05:17:24,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:17:24,985 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 55 statements into 6 equivalence classes. [2025-03-08 05:17:25,039 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 55 of 55 statements. [2025-03-08 05:17:25,039 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-08 05:17:25,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 05:17:25,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [776083256] [2025-03-08 05:17:25,041 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 05:17:25,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:17:25,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:17:25,043 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 05:17:25,045 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 05:17:25,069 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 55 statements into 6 equivalence classes. [2025-03-08 05:17:25,128 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 55 of 55 statements. [2025-03-08 05:17:25,128 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-08 05:17:25,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 05:17:25,128 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 05:17:25,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-08 05:17:25,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-08 05:17:25,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:17:25,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 05:17:25,171 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 05:17:25,171 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 05:17:25,172 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 05:17:25,181 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 05:17:25,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:17:25,378 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1] [2025-03-08 05:17:25,400 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 05:17:25,402 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 05:17:25 BoogieIcfgContainer [2025-03-08 05:17:25,403 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 05:17:25,403 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 05:17:25,403 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 05:17:25,403 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 05:17:25,404 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:17:19" (3/4) ... [2025-03-08 05:17:25,404 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-08 05:17:25,448 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 43. [2025-03-08 05:17:25,509 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 05:17:25,510 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 05:17:25,510 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 05:17:25,510 INFO L158 Benchmark]: Toolchain (without parser) took 6425.82ms. Allocated memory is still 167.8MB. Free memory was 124.2MB in the beginning and 52.8MB in the end (delta: 71.4MB). Peak memory consumption was 67.4MB. Max. memory is 16.1GB. [2025-03-08 05:17:25,510 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 201.3MB. Free memory is still 117.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 05:17:25,510 INFO L158 Benchmark]: CACSL2BoogieTranslator took 179.63ms. Allocated memory is still 167.8MB. Free memory was 123.6MB in the beginning and 112.1MB in the end (delta: 11.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 05:17:25,511 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.64ms. Allocated memory is still 167.8MB. Free memory was 112.1MB in the beginning and 110.9MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 05:17:25,511 INFO L158 Benchmark]: Boogie Preprocessor took 31.25ms. Allocated memory is still 167.8MB. Free memory was 110.9MB in the beginning and 110.2MB in the end (delta: 626.4kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 05:17:25,511 INFO L158 Benchmark]: IcfgBuilder took 216.81ms. Allocated memory is still 167.8MB. Free memory was 110.0MB in the beginning and 96.6MB in the end (delta: 13.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 05:17:25,511 INFO L158 Benchmark]: TraceAbstraction took 5856.59ms. Allocated memory is still 167.8MB. Free memory was 96.0MB in the beginning and 60.8MB in the end (delta: 35.2MB). Peak memory consumption was 33.9MB. Max. memory is 16.1GB. [2025-03-08 05:17:25,511 INFO L158 Benchmark]: Witness Printer took 106.64ms. Allocated memory is still 167.8MB. Free memory was 60.8MB in the beginning and 52.8MB in the end (delta: 8.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 05:17:25,512 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.24ms. Allocated memory is still 201.3MB. Free memory is still 117.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 179.63ms. Allocated memory is still 167.8MB. Free memory was 123.6MB in the beginning and 112.1MB in the end (delta: 11.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.64ms. Allocated memory is still 167.8MB. Free memory was 112.1MB in the beginning and 110.9MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 31.25ms. Allocated memory is still 167.8MB. Free memory was 110.9MB in the beginning and 110.2MB in the end (delta: 626.4kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 216.81ms. Allocated memory is still 167.8MB. Free memory was 110.0MB in the beginning and 96.6MB in the end (delta: 13.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 5856.59ms. Allocated memory is still 167.8MB. Free memory was 96.0MB in the beginning and 60.8MB in the end (delta: 35.2MB). Peak memory consumption was 33.9MB. Max. memory is 16.1GB. * Witness Printer took 106.64ms. Allocated memory is still 167.8MB. Free memory was 60.8MB in the beginning and 52.8MB in the end (delta: 8.0MB). 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 - CounterExampleResult [Line: 14]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L19] int counter = 0; VAL [counter=0] [L21] int x, y; [L22] long long a, b, p, q; [L24] x = __VERIFIER_nondet_int() [L25] y = __VERIFIER_nondet_int() [L26] CALL assume_abort_if_not(y >= 1) [L9] COND FALSE !(!cond) VAL [counter=0] [L26] RET assume_abort_if_not(y >= 1) [L28] a = x [L29] b = y [L30] p = 1 [L31] q = 0 VAL [a=32, b=32, counter=0, p=1, q=0, x=32, y=32] [L33] COND TRUE counter++<5 [L33] EXPR counter++ VAL [a=32, b=32, counter=1, p=1, q=0, x=32, y=32] [L33] COND TRUE counter++<5 [L34] CALL __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [\old(cond)=1, counter=1] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=1] [L34] RET __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [a=32, b=32, counter=1, p=1, q=0, x=32, y=32] [L36] COND FALSE !(!(a != 0 && b != 0)) VAL [a=32, b=32, counter=1, p=1, q=0, x=32, y=32] [L39] COND TRUE a % 2 == 0 && b % 2 == 0 [L40] a = a / 2 [L41] b = b / 2 [L42] p = 4 * p VAL [a=16, b=16, counter=1, p=4, q=0, x=32, y=32] [L33] COND TRUE counter++<5 [L33] EXPR counter++ VAL [a=16, b=16, counter=2, p=4, q=0, x=32, y=32] [L33] COND TRUE counter++<5 [L34] CALL __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [\old(cond)=1, counter=2] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=2] [L34] RET __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [a=16, b=16, counter=2, p=4, q=0, x=32, y=32] [L36] COND FALSE !(!(a != 0 && b != 0)) VAL [a=16, b=16, counter=2, p=4, q=0, x=32, y=32] [L39] COND TRUE a % 2 == 0 && b % 2 == 0 [L40] a = a / 2 [L41] b = b / 2 [L42] p = 4 * p VAL [a=8, b=8, counter=2, p=16, q=0, x=32, y=32] [L33] COND TRUE counter++<5 [L33] EXPR counter++ VAL [a=8, b=8, counter=3, p=16, q=0, x=32, y=32] [L33] COND TRUE counter++<5 [L34] CALL __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [\old(cond)=1, counter=3] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=3] [L34] RET __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [a=8, b=8, counter=3, p=16, q=0, x=32, y=32] [L36] COND FALSE !(!(a != 0 && b != 0)) VAL [a=8, b=8, counter=3, p=16, q=0, x=32, y=32] [L39] COND TRUE a % 2 == 0 && b % 2 == 0 [L40] a = a / 2 [L41] b = b / 2 [L42] p = 4 * p VAL [a=4, b=4, counter=3, p=64, q=0, x=32, y=32] [L33] COND TRUE counter++<5 [L33] EXPR counter++ VAL [a=4, b=4, counter=4, p=64, q=0, x=32, y=32] [L33] COND TRUE counter++<5 [L34] CALL __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [\old(cond)=1, counter=4] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=4] [L34] RET __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [a=4, b=4, counter=4, p=64, q=0, x=32, y=32] [L36] COND FALSE !(!(a != 0 && b != 0)) VAL [a=4, b=4, counter=4, p=64, q=0, x=32, y=32] [L39] COND TRUE a % 2 == 0 && b % 2 == 0 [L40] a = a / 2 [L41] b = b / 2 [L42] p = 4 * p VAL [a=2, b=2, counter=4, p=256, q=0, x=32, y=32] [L33] COND TRUE counter++<5 [L33] EXPR counter++ VAL [a=2, b=2, counter=5, p=256, q=0, x=32, y=32] [L33] COND TRUE counter++<5 [L34] CALL __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [\old(cond)=1, counter=5] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=5] [L34] RET __VERIFIER_assert(q + a * b * p == (long long) x * y) VAL [a=2, b=2, counter=5, p=256, q=0, x=32, y=32] [L36] COND FALSE !(!(a != 0 && b != 0)) VAL [a=2, b=2, counter=5, p=256, q=0, x=32, y=32] [L39] COND TRUE a % 2 == 0 && b % 2 == 0 [L40] a = a / 2 [L41] b = b / 2 [L42] p = 4 * p VAL [a=1, b=1, counter=5, p=1024, q=0, x=32, y=32] [L33] COND TRUE counter++<5 [L33] EXPR counter++ VAL [a=1, b=1, counter=6, p=1024, q=0, x=32, y=32] [L33] COND FALSE !(counter++<5) [L56] CALL __VERIFIER_assert(q == (long long) x * y) VAL [\old(cond)=0, counter=6] [L12] COND TRUE !(cond) VAL [\old(cond)=0, counter=6] [L14] reach_error() VAL [\old(cond)=0, counter=6] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 23 locations, 35 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.8s, OverallIterations: 9, TraceHistogramMax: 6, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 257 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 247 mSDsluCounter, 718 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 555 mSDsCounter, 74 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 545 IncrementalHoareTripleChecker+Invalid, 619 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 74 mSolverCounterUnsat, 163 mSDtfsCounter, 545 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 256 GetRequests, 180 SyntacticMatches, 10 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71occurred in iteration=6, 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, 8 MinimizatonAttempts, 71 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 391 NumberOfCodeBlocks, 391 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 301 ConstructedInterpolants, 3 QuantifiedInterpolants, 1337 SizeOfPredicates, 17 NumberOfNonLiveVariables, 509 ConjunctsInSsa, 81 ConjunctsInUnsatCore, 14 InterpolantComputations, 4 PerfectInterpolantSequences, 90/244 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 RESULT: Ultimate proved your program to be incorrect! [2025-03-08 05:17:25,530 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE