./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_unwindbound20.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 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/cohencu-ll_unwindbound20.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 820aaba80b9c7e4ca2ad4a6a908bac2e6f59545dc6a131cb9fae6306b993a9eb --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 13:44:19,167 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 13:44:19,218 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 13:44:19,223 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 13:44:19,223 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 13:44:19,243 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 13:44:19,245 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 13:44:19,245 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 13:44:19,245 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 13:44:19,245 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 13:44:19,245 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 13:44:19,246 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 13:44:19,246 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 13:44:19,246 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 13:44:19,246 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 13:44:19,246 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 13:44:19,246 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 13:44:19,246 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 13:44:19,246 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 13:44:19,246 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 13:44:19,246 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 13:44:19,246 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 13:44:19,246 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 13:44:19,246 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 13:44:19,246 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 13:44:19,248 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 13:44:19,248 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 13:44:19,248 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 13:44:19,248 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 13:44:19,248 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 13:44:19,248 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 13:44:19,248 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 13:44:19,248 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 13:44:19,248 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 13:44:19,248 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 13:44:19,249 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 13:44:19,249 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 13:44:19,249 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 13:44:19,249 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 13:44:19,249 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 13:44:19,249 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 13:44:19,249 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 13:44:19,249 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 13:44:19,249 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 -> 820aaba80b9c7e4ca2ad4a6a908bac2e6f59545dc6a131cb9fae6306b993a9eb [2025-03-03 13:44:19,451 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 13:44:19,460 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 13:44:19,462 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 13:44:19,463 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 13:44:19,463 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 13:44:19,463 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_unwindbound20.c [2025-03-03 13:44:20,558 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f53d0bcc/8bcaf01369bd4714bcd2f1e9dcee8cc9/FLAG233b99249 [2025-03-03 13:44:20,820 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 13:44:20,820 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_unwindbound20.c [2025-03-03 13:44:20,826 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f53d0bcc/8bcaf01369bd4714bcd2f1e9dcee8cc9/FLAG233b99249 [2025-03-03 13:44:21,142 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f53d0bcc/8bcaf01369bd4714bcd2f1e9dcee8cc9 [2025-03-03 13:44:21,143 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 13:44:21,145 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 13:44:21,146 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 13:44:21,146 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 13:44:21,149 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 13:44:21,150 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 01:44:21" (1/1) ... [2025-03-03 13:44:21,151 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73040acf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:44:21, skipping insertion in model container [2025-03-03 13:44:21,151 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 01:44:21" (1/1) ... [2025-03-03 13:44:21,160 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 13:44:21,255 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/cohencu-ll_unwindbound20.c[588,601] [2025-03-03 13:44:21,276 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 13:44:21,284 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 13:44:21,292 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/cohencu-ll_unwindbound20.c[588,601] [2025-03-03 13:44:21,300 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 13:44:21,309 INFO L204 MainTranslator]: Completed translation [2025-03-03 13:44:21,310 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:44:21 WrapperNode [2025-03-03 13:44:21,310 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 13:44:21,311 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 13:44:21,312 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 13:44:21,312 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 13:44:21,318 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:44:21" (1/1) ... [2025-03-03 13:44:21,325 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:44:21" (1/1) ... [2025-03-03 13:44:21,340 INFO L138 Inliner]: procedures = 14, calls = 18, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 48 [2025-03-03 13:44:21,341 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 13:44:21,342 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 13:44:21,342 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 13:44:21,342 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 13:44:21,347 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:44:21" (1/1) ... [2025-03-03 13:44:21,347 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:44:21" (1/1) ... [2025-03-03 13:44:21,350 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:44:21" (1/1) ... [2025-03-03 13:44:21,360 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-03 13:44:21,360 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:44:21" (1/1) ... [2025-03-03 13:44:21,360 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:44:21" (1/1) ... [2025-03-03 13:44:21,365 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:44:21" (1/1) ... [2025-03-03 13:44:21,366 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:44:21" (1/1) ... [2025-03-03 13:44:21,366 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:44:21" (1/1) ... [2025-03-03 13:44:21,369 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:44:21" (1/1) ... [2025-03-03 13:44:21,370 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 13:44:21,370 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 13:44:21,371 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 13:44:21,371 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 13:44:21,371 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:44:21" (1/1) ... [2025-03-03 13:44:21,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 13:44:21,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:44:21,400 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-03 13:44:21,403 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-03 13:44:21,420 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 13:44:21,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 13:44:21,420 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 13:44:21,420 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 13:44:21,420 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-03 13:44:21,420 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-03 13:44:21,456 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 13:44:21,457 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 13:44:21,570 INFO L? ?]: Removed 4 outVars from TransFormulas that were not future-live. [2025-03-03 13:44:21,571 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 13:44:21,576 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 13:44:21,576 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 13:44:21,577 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 01:44:21 BoogieIcfgContainer [2025-03-03 13:44:21,577 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 13:44:21,578 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 13:44:21,578 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 13:44:21,581 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 13:44:21,582 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 01:44:21" (1/3) ... [2025-03-03 13:44:21,582 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e20db2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 01:44:21, skipping insertion in model container [2025-03-03 13:44:21,582 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:44:21" (2/3) ... [2025-03-03 13:44:21,582 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e20db2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 01:44:21, skipping insertion in model container [2025-03-03 13:44:21,582 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 01:44:21" (3/3) ... [2025-03-03 13:44:21,583 INFO L128 eAbstractionObserver]: Analyzing ICFG cohencu-ll_unwindbound20.c [2025-03-03 13:44:21,592 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 13:44:21,593 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG cohencu-ll_unwindbound20.c that has 2 procedures, 26 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 13:44:21,620 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 13:44:21,627 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;@30d75bf5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 13:44:21,627 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 13:44:21,630 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-03 13:44:21,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-03 13:44:21,633 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:44:21,633 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:44:21,633 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:44:21,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:44:21,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1331043944, now seen corresponding path program 1 times [2025-03-03 13:44:21,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:44:21,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230980111] [2025-03-03 13:44:21,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:44:21,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:44:21,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-03 13:44:21,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-03 13:44:21,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:44:21,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:44:21,721 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-03 13:44:21,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:44:21,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230980111] [2025-03-03 13:44:21,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230980111] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:44:21,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:44:21,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 13:44:21,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917016656] [2025-03-03 13:44:21,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:44:21,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 13:44:21,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:44:21,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 13:44:21,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 13:44:21,739 INFO L87 Difference]: Start difference. First operand has 26 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-03 13:44:21,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:44:21,750 INFO L93 Difference]: Finished difference Result 50 states and 87 transitions. [2025-03-03 13:44:21,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 13:44:21,752 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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 7 [2025-03-03 13:44:21,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:44:21,755 INFO L225 Difference]: With dead ends: 50 [2025-03-03 13:44:21,755 INFO L226 Difference]: Without dead ends: 22 [2025-03-03 13:44:21,757 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-03 13:44:21,759 INFO L435 NwaCegarLoop]: 37 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, 37 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-03 13:44:21,759 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:44:21,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2025-03-03 13:44:21,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2025-03-03 13:44:21,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-03 13:44:21,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 33 transitions. [2025-03-03 13:44:21,781 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 33 transitions. Word has length 7 [2025-03-03 13:44:21,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:44:21,782 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 33 transitions. [2025-03-03 13:44:21,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-03 13:44:21,782 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 33 transitions. [2025-03-03 13:44:21,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-03 13:44:21,782 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:44:21,782 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:44:21,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 13:44:21,783 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:44:21,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:44:21,783 INFO L85 PathProgramCache]: Analyzing trace with hash -1736523449, now seen corresponding path program 1 times [2025-03-03 13:44:21,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:44:21,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621418283] [2025-03-03 13:44:21,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:44:21,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:44:21,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-03 13:44:21,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-03 13:44:21,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:44:21,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:44:21,968 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-03 13:44:21,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:44:21,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621418283] [2025-03-03 13:44:21,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621418283] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:44:21,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:44:21,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 13:44:21,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653812283] [2025-03-03 13:44:21,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:44:21,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 13:44:21,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:44:21,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 13:44:21,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 13:44:21,970 INFO L87 Difference]: Start difference. First operand 22 states and 33 transitions. Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 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-03 13:44:22,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:44:22,042 INFO L93 Difference]: Finished difference Result 28 states and 38 transitions. [2025-03-03 13:44:22,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 13:44:22,043 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 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 8 [2025-03-03 13:44:22,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:44:22,043 INFO L225 Difference]: With dead ends: 28 [2025-03-03 13:44:22,044 INFO L226 Difference]: Without dead ends: 26 [2025-03-03 13:44:22,044 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-03 13:44:22,045 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 5 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:44:22,045 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 85 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:44:22,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-03-03 13:44:22,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2025-03-03 13:44:22,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-03 13:44:22,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 36 transitions. [2025-03-03 13:44:22,052 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 36 transitions. Word has length 8 [2025-03-03 13:44:22,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:44:22,052 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 36 transitions. [2025-03-03 13:44:22,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 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-03 13:44:22,053 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 36 transitions. [2025-03-03 13:44:22,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-03 13:44:22,054 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:44:22,054 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:44:22,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 13:44:22,054 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:44:22,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:44:22,055 INFO L85 PathProgramCache]: Analyzing trace with hash 359075189, now seen corresponding path program 1 times [2025-03-03 13:44:22,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:44:22,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798580422] [2025-03-03 13:44:22,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:44:22,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:44:22,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-03 13:44:22,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-03 13:44:22,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:44:22,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 13:44:22,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1961939298] [2025-03-03 13:44:22,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:44:22,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:44:22,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:44:22,079 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-03 13:44:22,081 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-03 13:44:22,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-03 13:44:22,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-03 13:44:22,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:44:22,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:44:22,125 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-03 13:44:22,127 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:44:22,192 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:44:22,193 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 13:44:22,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:44:22,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798580422] [2025-03-03 13:44:22,193 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 13:44:22,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1961939298] [2025-03-03 13:44:22,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1961939298] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:44:22,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:44:22,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 13:44:22,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451375361] [2025-03-03 13:44:22,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:44:22,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 13:44:22,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:44:22,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 13:44:22,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 13:44:22,197 INFO L87 Difference]: Start difference. First operand 26 states and 36 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-03 13:44:22,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:44:22,258 INFO L93 Difference]: Finished difference Result 46 states and 67 transitions. [2025-03-03 13:44:22,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 13:44:22,258 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2025-03-03 13:44:22,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:44:22,259 INFO L225 Difference]: With dead ends: 46 [2025-03-03 13:44:22,260 INFO L226 Difference]: Without dead ends: 44 [2025-03-03 13:44:22,260 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 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-03 13:44:22,260 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 5 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:44:22,261 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 108 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:44:22,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-03-03 13:44:22,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 34. [2025-03-03 13:44:22,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 19 states have internal predecessors, (21), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-03 13:44:22,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 46 transitions. [2025-03-03 13:44:22,275 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 46 transitions. Word has length 13 [2025-03-03 13:44:22,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:44:22,275 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 46 transitions. [2025-03-03 13:44:22,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-03 13:44:22,275 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 46 transitions. [2025-03-03 13:44:22,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-03 13:44:22,276 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:44:22,276 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:44:22,283 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-03 13:44:22,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:44:22,481 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:44:22,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:44:22,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1047704010, now seen corresponding path program 1 times [2025-03-03 13:44:22,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:44:22,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316136332] [2025-03-03 13:44:22,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:44:22,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:44:22,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-03 13:44:22,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-03 13:44:22,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:44:22,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:44:22,540 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:44:22,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:44:22,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316136332] [2025-03-03 13:44:22,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316136332] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:44:22,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:44:22,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 13:44:22,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162385298] [2025-03-03 13:44:22,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:44:22,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 13:44:22,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:44:22,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 13:44:22,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 13:44:22,542 INFO L87 Difference]: Start difference. First operand 34 states and 46 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-03 13:44:22,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:44:22,564 INFO L93 Difference]: Finished difference Result 50 states and 65 transitions. [2025-03-03 13:44:22,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 13:44:22,564 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2025-03-03 13:44:22,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:44:22,566 INFO L225 Difference]: With dead ends: 50 [2025-03-03 13:44:22,566 INFO L226 Difference]: Without dead ends: 34 [2025-03-03 13:44:22,567 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-03 13:44:22,567 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 89 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-03 13:44:22,567 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 89 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:44:22,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-03-03 13:44:22,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2025-03-03 13:44:22,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 19 states have internal predecessors, (20), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-03 13:44:22,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions. [2025-03-03 13:44:22,577 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 45 transitions. Word has length 13 [2025-03-03 13:44:22,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:44:22,577 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 45 transitions. [2025-03-03 13:44:22,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-03 13:44:22,577 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2025-03-03 13:44:22,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-03 13:44:22,577 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:44:22,577 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:44:22,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 13:44:22,578 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:44:22,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:44:22,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1747981895, now seen corresponding path program 1 times [2025-03-03 13:44:22,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:44:22,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190018930] [2025-03-03 13:44:22,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:44:22,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:44:22,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-03 13:44:22,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-03 13:44:22,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:44:22,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 13:44:22,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [936561559] [2025-03-03 13:44:22,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:44:22,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:44:22,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:44:22,592 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-03 13:44:22,593 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-03 13:44:22,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-03 13:44:22,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-03 13:44:22,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:44:22,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:44:22,631 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-03 13:44:22,631 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:44:22,685 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-03 13:44:22,685 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 13:44:22,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:44:22,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190018930] [2025-03-03 13:44:22,685 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 13:44:22,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [936561559] [2025-03-03 13:44:22,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [936561559] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:44:22,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:44:22,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 13:44:22,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053586327] [2025-03-03 13:44:22,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:44:22,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 13:44:22,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:44:22,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 13:44:22,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 13:44:22,688 INFO L87 Difference]: Start difference. First operand 34 states and 45 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 13:44:22,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:44:22,752 INFO L93 Difference]: Finished difference Result 50 states and 69 transitions. [2025-03-03 13:44:22,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 13:44:22,752 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2025-03-03 13:44:22,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:44:22,753 INFO L225 Difference]: With dead ends: 50 [2025-03-03 13:44:22,754 INFO L226 Difference]: Without dead ends: 48 [2025-03-03 13:44:22,754 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 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-03 13:44:22,754 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 4 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:44:22,756 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 123 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:44:22,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-03-03 13:44:22,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2025-03-03 13:44:22,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 23 states have internal predecessors, (25), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-03 13:44:22,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 60 transitions. [2025-03-03 13:44:22,768 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 60 transitions. Word has length 18 [2025-03-03 13:44:22,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:44:22,768 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 60 transitions. [2025-03-03 13:44:22,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 13:44:22,768 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 60 transitions. [2025-03-03 13:44:22,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-03 13:44:22,768 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:44:22,768 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:44:22,776 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 13:44:22,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:44:22,969 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:44:22,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:44:22,970 INFO L85 PathProgramCache]: Analyzing trace with hash 2013833461, now seen corresponding path program 1 times [2025-03-03 13:44:22,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:44:22,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144043960] [2025-03-03 13:44:22,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:44:22,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:44:22,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-03 13:44:22,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-03 13:44:22,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:44:22,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 13:44:22,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [982141166] [2025-03-03 13:44:22,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:44:22,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:44:22,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:44:22,990 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-03 13:44:22,992 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-03 13:44:23,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-03 13:44:23,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-03 13:44:23,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:44:23,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:44:23,038 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-03 13:44:23,040 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:44:23,115 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 13:44:23,116 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 13:44:23,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:44:23,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144043960] [2025-03-03 13:44:23,116 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 13:44:23,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [982141166] [2025-03-03 13:44:23,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [982141166] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:44:23,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:44:23,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 13:44:23,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670076438] [2025-03-03 13:44:23,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:44:23,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 13:44:23,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:44:23,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 13:44:23,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 13:44:23,117 INFO L87 Difference]: Start difference. First operand 44 states and 60 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 13:44:23,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:44:23,197 INFO L93 Difference]: Finished difference Result 58 states and 75 transitions. [2025-03-03 13:44:23,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 13:44:23,197 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2025-03-03 13:44:23,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:44:23,198 INFO L225 Difference]: With dead ends: 58 [2025-03-03 13:44:23,199 INFO L226 Difference]: Without dead ends: 46 [2025-03-03 13:44:23,199 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 13:44:23,200 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 4 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 13:44:23,200 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 127 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 13:44:23,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-03-03 13:44:23,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2025-03-03 13:44:23,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 24 states have (on average 1.125) internal successors, (27), 25 states have internal predecessors, (27), 16 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-03 13:44:23,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 58 transitions. [2025-03-03 13:44:23,214 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 58 transitions. Word has length 23 [2025-03-03 13:44:23,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:44:23,214 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 58 transitions. [2025-03-03 13:44:23,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 13:44:23,215 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 58 transitions. [2025-03-03 13:44:23,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-03 13:44:23,216 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:44:23,216 INFO L218 NwaCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:44:23,221 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 13:44:23,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:44:23,420 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:44:23,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:44:23,420 INFO L85 PathProgramCache]: Analyzing trace with hash 2015639435, now seen corresponding path program 1 times [2025-03-03 13:44:23,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:44:23,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558844248] [2025-03-03 13:44:23,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:44:23,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:44:23,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-03 13:44:23,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-03 13:44:23,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:44:23,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 13:44:23,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [710887182] [2025-03-03 13:44:23,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:44:23,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:44:23,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:44:23,447 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-03 13:44:23,449 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-03 13:44:23,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-03 13:44:23,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-03 13:44:23,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:44:23,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:44:23,488 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-03 13:44:23,489 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:44:23,602 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 11 proven. 20 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-03 13:44:23,602 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:44:23,754 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 14 proven. 17 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-03 13:44:23,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:44:23,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558844248] [2025-03-03 13:44:23,756 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 13:44:23,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [710887182] [2025-03-03 13:44:23,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [710887182] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:44:23,756 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 13:44:23,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2025-03-03 13:44:23,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928575353] [2025-03-03 13:44:23,757 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 13:44:23,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 13:44:23,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:44:23,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 13:44:23,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2025-03-03 13:44:23,758 INFO L87 Difference]: Start difference. First operand 46 states and 58 transitions. Second operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 11 states have internal predecessors, (26), 5 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 4 states have call predecessors, (12), 5 states have call successors, (12) [2025-03-03 13:44:23,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:44:23,993 INFO L93 Difference]: Finished difference Result 70 states and 92 transitions. [2025-03-03 13:44:23,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 13:44:23,994 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 11 states have internal predecessors, (26), 5 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 4 states have call predecessors, (12), 5 states have call successors, (12) Word has length 41 [2025-03-03 13:44:23,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:44:23,994 INFO L225 Difference]: With dead ends: 70 [2025-03-03 13:44:23,994 INFO L226 Difference]: Without dead ends: 68 [2025-03-03 13:44:23,995 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2025-03-03 13:44:23,995 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 17 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 13:44:23,995 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 164 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 13:44:23,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-03-03 13:44:24,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 54. [2025-03-03 13:44:24,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 30 states have (on average 1.1) internal successors, (33), 31 states have internal predecessors, (33), 16 states have call successors, (16), 7 states have call predecessors, (16), 7 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-03 13:44:24,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 64 transitions. [2025-03-03 13:44:24,007 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 64 transitions. Word has length 41 [2025-03-03 13:44:24,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:44:24,007 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 64 transitions. [2025-03-03 13:44:24,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 11 states have internal predecessors, (26), 5 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 4 states have call predecessors, (12), 5 states have call successors, (12) [2025-03-03 13:44:24,007 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 64 transitions. [2025-03-03 13:44:24,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-03 13:44:24,008 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:44:24,008 INFO L218 NwaCegarLoop]: trace histogram [7, 6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:44:24,014 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-03 13:44:24,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:44:24,208 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:44:24,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:44:24,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1590699040, now seen corresponding path program 1 times [2025-03-03 13:44:24,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:44:24,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918863899] [2025-03-03 13:44:24,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:44:24,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:44:24,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-03 13:44:24,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-03 13:44:24,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:44:24,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:44:24,331 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-03 13:44:24,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:44:24,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918863899] [2025-03-03 13:44:24,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918863899] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:44:24,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1770988191] [2025-03-03 13:44:24,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:44:24,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:44:24,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:44:24,334 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-03 13:44:24,336 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-03 13:44:24,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-03 13:44:24,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-03 13:44:24,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:44:24,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:44:24,373 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 13:44:24,374 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:44:24,423 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 30 proven. 2 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-03-03 13:44:24,424 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:44:24,473 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-03 13:44:24,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1770988191] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:44:24,473 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:44:24,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 5] total 10 [2025-03-03 13:44:24,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895504557] [2025-03-03 13:44:24,473 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:44:24,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 13:44:24,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:44:24,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 13:44:24,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-03 13:44:24,474 INFO L87 Difference]: Start difference. First operand 54 states and 64 transitions. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 3 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-03 13:44:24,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:44:24,611 INFO L93 Difference]: Finished difference Result 136 states and 166 transitions. [2025-03-03 13:44:24,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 13:44:24,612 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 3 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 41 [2025-03-03 13:44:24,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:44:24,613 INFO L225 Difference]: With dead ends: 136 [2025-03-03 13:44:24,613 INFO L226 Difference]: Without dead ends: 116 [2025-03-03 13:44:24,614 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 78 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-03 13:44:24,614 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 51 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 13:44:24,614 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 116 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 13:44:24,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-03-03 13:44:24,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 112. [2025-03-03 13:44:24,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 59 states have (on average 1.11864406779661) internal successors, (66), 62 states have internal predecessors, (66), 38 states have call successors, (38), 14 states have call predecessors, (38), 14 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2025-03-03 13:44:24,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 139 transitions. [2025-03-03 13:44:24,642 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 139 transitions. Word has length 41 [2025-03-03 13:44:24,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:44:24,642 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 139 transitions. [2025-03-03 13:44:24,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 3 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-03 13:44:24,642 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 139 transitions. [2025-03-03 13:44:24,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-03 13:44:24,643 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:44:24,643 INFO L218 NwaCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:44:24,649 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-03 13:44:24,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:44:24,844 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:44:24,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:44:24,844 INFO L85 PathProgramCache]: Analyzing trace with hash 78105073, now seen corresponding path program 2 times [2025-03-03 13:44:24,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:44:24,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119580596] [2025-03-03 13:44:24,844 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:44:24,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:44:24,848 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 46 statements into 2 equivalence classes. [2025-03-03 13:44:24,862 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 46 of 46 statements. [2025-03-03 13:44:24,862 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:44:24,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 13:44:24,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [392826330] [2025-03-03 13:44:24,863 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:44:24,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:44:24,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:44:24,865 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-03 13:44:24,867 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-03 13:44:24,890 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 46 statements into 2 equivalence classes. [2025-03-03 13:44:24,904 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 46 of 46 statements. [2025-03-03 13:44:24,904 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:44:24,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:44:24,905 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-03 13:44:24,906 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:44:25,037 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 28 proven. 9 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-03-03 13:44:25,038 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:44:25,196 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 28 proven. 9 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-03-03 13:44:25,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:44:25,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119580596] [2025-03-03 13:44:25,197 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 13:44:25,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [392826330] [2025-03-03 13:44:25,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [392826330] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:44:25,197 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 13:44:25,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2025-03-03 13:44:25,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416166199] [2025-03-03 13:44:25,197 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 13:44:25,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 13:44:25,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:44:25,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 13:44:25,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-03-03 13:44:25,198 INFO L87 Difference]: Start difference. First operand 112 states and 139 transitions. Second operand has 14 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 11 states have internal predecessors, (26), 6 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (14), 4 states have call predecessors, (14), 6 states have call successors, (14) [2025-03-03 13:44:25,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:44:25,474 INFO L93 Difference]: Finished difference Result 127 states and 154 transitions. [2025-03-03 13:44:25,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 13:44:25,474 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 11 states have internal predecessors, (26), 6 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (14), 4 states have call predecessors, (14), 6 states have call successors, (14) Word has length 46 [2025-03-03 13:44:25,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:44:25,475 INFO L225 Difference]: With dead ends: 127 [2025-03-03 13:44:25,475 INFO L226 Difference]: Without dead ends: 122 [2025-03-03 13:44:25,476 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2025-03-03 13:44:25,477 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 11 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 13:44:25,477 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 190 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 13:44:25,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-03-03 13:44:25,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2025-03-03 13:44:25,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 68 states have (on average 1.1029411764705883) internal successors, (75), 71 states have internal predecessors, (75), 35 states have call successors, (35), 17 states have call predecessors, (35), 17 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-03 13:44:25,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 142 transitions. [2025-03-03 13:44:25,508 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 142 transitions. Word has length 46 [2025-03-03 13:44:25,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:44:25,508 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 142 transitions. [2025-03-03 13:44:25,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 11 states have internal predecessors, (26), 6 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (14), 4 states have call predecessors, (14), 6 states have call successors, (14) [2025-03-03 13:44:25,509 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 142 transitions. [2025-03-03 13:44:25,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-03 13:44:25,511 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:44:25,511 INFO L218 NwaCegarLoop]: trace histogram [12, 11, 11, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:44:25,517 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-03 13:44:25,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:44:25,712 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:44:25,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:44:25,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1836391767, now seen corresponding path program 1 times [2025-03-03 13:44:25,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:44:25,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268069799] [2025-03-03 13:44:25,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:44:25,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:44:25,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-03 13:44:25,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-03 13:44:25,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:44:25,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 13:44:25,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1413083687] [2025-03-03 13:44:25,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:44:25,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:44:25,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:44:25,738 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-03 13:44:25,740 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-03 13:44:25,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-03 13:44:25,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-03 13:44:25,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:44:25,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:44:25,778 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-03 13:44:25,780 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:44:25,907 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 22 proven. 8 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-03 13:44:25,908 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:44:26,024 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 22 proven. 8 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-03 13:44:26,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:44:26,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268069799] [2025-03-03 13:44:26,025 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 13:44:26,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1413083687] [2025-03-03 13:44:26,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1413083687] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:44:26,025 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 13:44:26,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2025-03-03 13:44:26,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307285721] [2025-03-03 13:44:26,025 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 13:44:26,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 13:44:26,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:44:26,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 13:44:26,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-03-03 13:44:26,026 INFO L87 Difference]: Start difference. First operand 121 states and 142 transitions. Second operand has 12 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 6 states have call successors, (24), 3 states have call predecessors, (24), 1 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) [2025-03-03 13:44:26,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:44:26,212 INFO L93 Difference]: Finished difference Result 135 states and 154 transitions. [2025-03-03 13:44:26,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 13:44:26,213 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 6 states have call successors, (24), 3 states have call predecessors, (24), 1 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) Word has length 67 [2025-03-03 13:44:26,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:44:26,214 INFO L225 Difference]: With dead ends: 135 [2025-03-03 13:44:26,214 INFO L226 Difference]: Without dead ends: 131 [2025-03-03 13:44:26,214 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2025-03-03 13:44:26,216 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 8 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 13:44:26,216 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 206 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 13:44:26,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-03-03 13:44:26,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2025-03-03 13:44:26,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 76 states have (on average 1.0789473684210527) internal successors, (82), 78 states have internal predecessors, (82), 35 states have call successors, (35), 20 states have call predecessors, (35), 19 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-03 13:44:26,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 149 transitions. [2025-03-03 13:44:26,246 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 149 transitions. Word has length 67 [2025-03-03 13:44:26,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:44:26,247 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 149 transitions. [2025-03-03 13:44:26,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 6 states have call successors, (24), 3 states have call predecessors, (24), 1 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) [2025-03-03 13:44:26,247 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 149 transitions. [2025-03-03 13:44:26,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-03 13:44:26,248 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:44:26,248 INFO L218 NwaCegarLoop]: trace histogram [13, 12, 12, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:44:26,255 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-03 13:44:26,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:44:26,449 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:44:26,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:44:26,449 INFO L85 PathProgramCache]: Analyzing trace with hash 44641509, now seen corresponding path program 1 times [2025-03-03 13:44:26,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:44:26,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388566787] [2025-03-03 13:44:26,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:44:26,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:44:26,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-03 13:44:26,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-03 13:44:26,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:44:26,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 13:44:26,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [946692013] [2025-03-03 13:44:26,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:44:26,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:44:26,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:44:26,471 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:44:26,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-03 13:44:26,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-03 13:44:26,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-03 13:44:26,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:44:26,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:44:26,514 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-03 13:44:26,516 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:44:26,646 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 56 proven. 9 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2025-03-03 13:44:26,646 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:44:26,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:44:26,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388566787] [2025-03-03 13:44:26,721 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 13:44:26,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [946692013] [2025-03-03 13:44:26,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [946692013] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:44:26,721 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-03 13:44:26,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2025-03-03 13:44:26,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123213411] [2025-03-03 13:44:26,721 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-03 13:44:26,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 13:44:26,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:44:26,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 13:44:26,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-03 13:44:26,722 INFO L87 Difference]: Start difference. First operand 131 states and 149 transitions. Second operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-03 13:44:26,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:44:26,876 INFO L93 Difference]: Finished difference Result 137 states and 153 transitions. [2025-03-03 13:44:26,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 13:44:26,876 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) Word has length 72 [2025-03-03 13:44:26,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:44:26,877 INFO L225 Difference]: With dead ends: 137 [2025-03-03 13:44:26,877 INFO L226 Difference]: Without dead ends: 126 [2025-03-03 13:44:26,877 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-03-03 13:44:26,878 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 4 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 13:44:26,878 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 152 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 13:44:26,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2025-03-03 13:44:26,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2025-03-03 13:44:26,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 74 states have (on average 1.0675675675675675) internal successors, (79), 76 states have internal predecessors, (79), 32 states have call successors, (32), 19 states have call predecessors, (32), 19 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-03 13:44:26,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 141 transitions. [2025-03-03 13:44:26,913 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 141 transitions. Word has length 72 [2025-03-03 13:44:26,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:44:26,914 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 141 transitions. [2025-03-03 13:44:26,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-03 13:44:26,914 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 141 transitions. [2025-03-03 13:44:26,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-03 13:44:26,914 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:44:26,915 INFO L218 NwaCegarLoop]: trace histogram [14, 13, 13, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1] [2025-03-03 13:44:26,921 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-03 13:44:27,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-03 13:44:27,119 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:44:27,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:44:27,119 INFO L85 PathProgramCache]: Analyzing trace with hash 2133039393, now seen corresponding path program 3 times [2025-03-03 13:44:27,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:44:27,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312987986] [2025-03-03 13:44:27,119 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 13:44:27,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:44:27,124 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 79 statements into 7 equivalence classes. [2025-03-03 13:44:27,145 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 79 of 79 statements. [2025-03-03 13:44:27,145 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-03-03 13:44:27,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 13:44:27,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [275885803] [2025-03-03 13:44:27,148 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 13:44:27,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:44:27,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:44:27,151 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:44:27,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-03 13:44:27,178 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 79 statements into 7 equivalence classes. [2025-03-03 13:44:27,198 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 39 of 79 statements. [2025-03-03 13:44:27,198 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-03 13:44:27,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:44:27,204 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-03-03 13:44:27,206 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:44:27,388 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 55 proven. 27 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2025-03-03 13:44:27,389 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:44:27,682 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 55 proven. 27 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2025-03-03 13:44:27,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:44:27,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312987986] [2025-03-03 13:44:27,682 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 13:44:27,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [275885803] [2025-03-03 13:44:27,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [275885803] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:44:27,682 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 13:44:27,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2025-03-03 13:44:27,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922880721] [2025-03-03 13:44:27,683 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 13:44:27,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-03 13:44:27,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:44:27,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-03 13:44:27,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2025-03-03 13:44:27,684 INFO L87 Difference]: Start difference. First operand 126 states and 141 transitions. Second operand has 16 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 13 states have internal predecessors, (32), 8 states have call successors, (28), 3 states have call predecessors, (28), 2 states have return successors, (26), 6 states have call predecessors, (26), 8 states have call successors, (26) [2025-03-03 13:44:31,920 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-03 13:44:32,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:44:32,101 INFO L93 Difference]: Finished difference Result 138 states and 154 transitions. [2025-03-03 13:44:32,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 13:44:32,101 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 13 states have internal predecessors, (32), 8 states have call successors, (28), 3 states have call predecessors, (28), 2 states have return successors, (26), 6 states have call predecessors, (26), 8 states have call successors, (26) Word has length 79 [2025-03-03 13:44:32,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:44:32,102 INFO L225 Difference]: With dead ends: 138 [2025-03-03 13:44:32,102 INFO L226 Difference]: Without dead ends: 129 [2025-03-03 13:44:32,103 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 142 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2025-03-03 13:44:32,103 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 16 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 78 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-03-03 13:44:32,103 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 207 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 241 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2025-03-03 13:44:32,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2025-03-03 13:44:32,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 127. [2025-03-03 13:44:32,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 79 states have (on average 1.0506329113924051) internal successors, (83), 80 states have internal predecessors, (83), 27 states have call successors, (27), 21 states have call predecessors, (27), 20 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-03 13:44:32,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 135 transitions. [2025-03-03 13:44:32,118 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 135 transitions. Word has length 79 [2025-03-03 13:44:32,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:44:32,119 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 135 transitions. [2025-03-03 13:44:32,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 13 states have internal predecessors, (32), 8 states have call successors, (28), 3 states have call predecessors, (28), 2 states have return successors, (26), 6 states have call predecessors, (26), 8 states have call successors, (26) [2025-03-03 13:44:32,119 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 135 transitions. [2025-03-03 13:44:32,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-03 13:44:32,119 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:44:32,120 INFO L218 NwaCegarLoop]: trace histogram [18, 17, 17, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:44:32,125 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-03 13:44:32,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:44:32,324 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:44:32,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:44:32,324 INFO L85 PathProgramCache]: Analyzing trace with hash -1451410161, now seen corresponding path program 2 times [2025-03-03 13:44:32,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:44:32,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302450500] [2025-03-03 13:44:32,324 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:44:32,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:44:32,328 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 100 statements into 2 equivalence classes. [2025-03-03 13:44:32,341 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 100 of 100 statements. [2025-03-03 13:44:32,341 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:44:32,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 13:44:32,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1998535985] [2025-03-03 13:44:32,342 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:44:32,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:44:32,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:44:32,345 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:44:32,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-03 13:44:32,376 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 100 statements into 2 equivalence classes. [2025-03-03 13:44:32,399 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 100 of 100 statements. [2025-03-03 13:44:32,399 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:44:32,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:44:32,401 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-03 13:44:32,403 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:44:32,597 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 63 proven. 43 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-03-03 13:44:32,597 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:44:32,886 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 63 proven. 35 refuted. 0 times theorem prover too weak. 504 trivial. 0 not checked. [2025-03-03 13:44:32,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:44:32,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302450500] [2025-03-03 13:44:32,887 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 13:44:32,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1998535985] [2025-03-03 13:44:32,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1998535985] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:44:32,887 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 13:44:32,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 17 [2025-03-03 13:44:32,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836339329] [2025-03-03 13:44:32,887 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 13:44:32,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-03 13:44:32,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:44:32,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-03 13:44:32,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2025-03-03 13:44:32,888 INFO L87 Difference]: Start difference. First operand 127 states and 135 transitions. Second operand has 17 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 9 states have call successors, (31), 3 states have call predecessors, (31), 2 states have return successors, (29), 7 states have call predecessors, (29), 9 states have call successors, (29) [2025-03-03 13:44:33,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:44:33,165 INFO L93 Difference]: Finished difference Result 137 states and 148 transitions. [2025-03-03 13:44:33,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 13:44:33,166 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 9 states have call successors, (31), 3 states have call predecessors, (31), 2 states have return successors, (29), 7 states have call predecessors, (29), 9 states have call successors, (29) Word has length 100 [2025-03-03 13:44:33,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:44:33,167 INFO L225 Difference]: With dead ends: 137 [2025-03-03 13:44:33,167 INFO L226 Difference]: Without dead ends: 126 [2025-03-03 13:44:33,167 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 182 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=360, Unknown=0, NotChecked=0, Total=462 [2025-03-03 13:44:33,168 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 11 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 13:44:33,168 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 225 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 13:44:33,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2025-03-03 13:44:33,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2025-03-03 13:44:33,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 77 states have (on average 1.0389610389610389) internal successors, (80), 79 states have internal predecessors, (80), 27 states have call successors, (27), 20 states have call predecessors, (27), 20 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-03 13:44:33,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 133 transitions. [2025-03-03 13:44:33,205 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 133 transitions. Word has length 100 [2025-03-03 13:44:33,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:44:33,205 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 133 transitions. [2025-03-03 13:44:33,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 9 states have call successors, (31), 3 states have call predecessors, (31), 2 states have return successors, (29), 7 states have call predecessors, (29), 9 states have call successors, (29) [2025-03-03 13:44:33,206 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 133 transitions. [2025-03-03 13:44:33,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-03 13:44:33,206 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:44:33,206 INFO L218 NwaCegarLoop]: trace histogram [22, 21, 21, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:44:33,213 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-03 13:44:33,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-03 13:44:33,407 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:44:33,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:44:33,407 INFO L85 PathProgramCache]: Analyzing trace with hash -7767165, now seen corresponding path program 2 times [2025-03-03 13:44:33,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:44:33,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822083856] [2025-03-03 13:44:33,407 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:44:33,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:44:33,412 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 123 statements into 2 equivalence classes. [2025-03-03 13:44:33,425 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 123 of 123 statements. [2025-03-03 13:44:33,426 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:44:33,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 13:44:33,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1364918509] [2025-03-03 13:44:33,427 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:44:33,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:44:33,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:44:33,429 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:44:33,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-03 13:44:33,455 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 123 statements into 2 equivalence classes. [2025-03-03 13:44:33,484 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 123 of 123 statements. [2025-03-03 13:44:33,485 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:44:33,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:44:33,489 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-03 13:44:33,491 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:44:33,634 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 86 proven. 64 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2025-03-03 13:44:33,634 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:44:33,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:44:33,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822083856] [2025-03-03 13:44:33,672 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 13:44:33,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1364918509] [2025-03-03 13:44:33,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1364918509] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:44:33,672 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-03 13:44:33,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2025-03-03 13:44:33,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715420069] [2025-03-03 13:44:33,672 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-03 13:44:33,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 13:44:33,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:44:33,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 13:44:33,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-03-03 13:44:33,673 INFO L87 Difference]: Start difference. First operand 125 states and 133 transitions. Second operand has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 5 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (21), 5 states have call predecessors, (21), 5 states have call successors, (21) [2025-03-03 13:44:33,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:44:33,862 INFO L93 Difference]: Finished difference Result 145 states and 160 transitions. [2025-03-03 13:44:33,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 13:44:33,863 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 5 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (21), 5 states have call predecessors, (21), 5 states have call successors, (21) Word has length 123 [2025-03-03 13:44:33,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:44:33,864 INFO L225 Difference]: With dead ends: 145 [2025-03-03 13:44:33,864 INFO L226 Difference]: Without dead ends: 143 [2025-03-03 13:44:33,864 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2025-03-03 13:44:33,864 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 5 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 13:44:33,865 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 286 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 13:44:33,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2025-03-03 13:44:33,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 141. [2025-03-03 13:44:33,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 84 states have (on average 1.0476190476190477) internal successors, (88), 87 states have internal predecessors, (88), 34 states have call successors, (34), 22 states have call predecessors, (34), 22 states have return successors, (33), 31 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-03 13:44:33,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 155 transitions. [2025-03-03 13:44:33,891 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 155 transitions. Word has length 123 [2025-03-03 13:44:33,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:44:33,892 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 155 transitions. [2025-03-03 13:44:33,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 5 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (21), 5 states have call predecessors, (21), 5 states have call successors, (21) [2025-03-03 13:44:33,892 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 155 transitions. [2025-03-03 13:44:33,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-03 13:44:33,893 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:44:33,893 INFO L218 NwaCegarLoop]: trace histogram [22, 21, 21, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:44:33,899 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-03 13:44:34,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-03 13:44:34,093 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:44:34,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:44:34,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1120064478, now seen corresponding path program 2 times [2025-03-03 13:44:34,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:44:34,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916138601] [2025-03-03 13:44:34,094 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:44:34,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:44:34,099 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 125 statements into 2 equivalence classes. [2025-03-03 13:44:34,111 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 125 of 125 statements. [2025-03-03 13:44:34,111 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:44:34,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:44:34,288 INFO L134 CoverageAnalysis]: Checked inductivity of 938 backedges. 42 proven. 56 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-03 13:44:34,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:44:34,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916138601] [2025-03-03 13:44:34,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916138601] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:44:34,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1078344187] [2025-03-03 13:44:34,289 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:44:34,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:44:34,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:44:34,291 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:44:34,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-03 13:44:34,317 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 125 statements into 2 equivalence classes. [2025-03-03 13:44:34,339 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 125 of 125 statements. [2025-03-03 13:44:34,340 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:44:34,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:44:34,341 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-03 13:44:34,343 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:44:34,436 INFO L134 CoverageAnalysis]: Checked inductivity of 938 backedges. 120 proven. 656 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2025-03-03 13:44:34,436 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:44:34,570 INFO L134 CoverageAnalysis]: Checked inductivity of 938 backedges. 42 proven. 56 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-03 13:44:34,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1078344187] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:44:34,571 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:44:34,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 8] total 16 [2025-03-03 13:44:34,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016972255] [2025-03-03 13:44:34,571 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:44:34,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-03 13:44:34,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:44:34,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-03 13:44:34,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=144, Unknown=0, NotChecked=0, Total=240 [2025-03-03 13:44:34,572 INFO L87 Difference]: Start difference. First operand 141 states and 155 transitions. Second operand has 16 states, 16 states have (on average 3.5) internal successors, (56), 16 states have internal predecessors, (56), 9 states have call successors, (63), 6 states have call predecessors, (63), 6 states have return successors, (62), 9 states have call predecessors, (62), 9 states have call successors, (62) [2025-03-03 13:44:34,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:44:34,867 INFO L93 Difference]: Finished difference Result 371 states and 403 transitions. [2025-03-03 13:44:34,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-03 13:44:34,867 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.5) internal successors, (56), 16 states have internal predecessors, (56), 9 states have call successors, (63), 6 states have call predecessors, (63), 6 states have return successors, (62), 9 states have call predecessors, (62), 9 states have call successors, (62) Word has length 125 [2025-03-03 13:44:34,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:44:34,869 INFO L225 Difference]: With dead ends: 371 [2025-03-03 13:44:34,869 INFO L226 Difference]: Without dead ends: 355 [2025-03-03 13:44:34,869 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=196, Invalid=356, Unknown=0, NotChecked=0, Total=552 [2025-03-03 13:44:34,869 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 149 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 13:44:34,869 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 144 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 13:44:34,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2025-03-03 13:44:34,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 299. [2025-03-03 13:44:34,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 181 states have (on average 1.0552486187845305) internal successors, (191), 188 states have internal predecessors, (191), 69 states have call successors, (69), 49 states have call predecessors, (69), 48 states have return successors, (66), 61 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-03 13:44:34,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 326 transitions. [2025-03-03 13:44:34,928 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 326 transitions. Word has length 125 [2025-03-03 13:44:34,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:44:34,928 INFO L471 AbstractCegarLoop]: Abstraction has 299 states and 326 transitions. [2025-03-03 13:44:34,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.5) internal successors, (56), 16 states have internal predecessors, (56), 9 states have call successors, (63), 6 states have call predecessors, (63), 6 states have return successors, (62), 9 states have call predecessors, (62), 9 states have call successors, (62) [2025-03-03 13:44:34,929 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 326 transitions. [2025-03-03 13:44:34,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-03 13:44:34,929 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:44:34,929 INFO L218 NwaCegarLoop]: trace histogram [24, 23, 23, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:44:34,936 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-03 13:44:35,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-03 13:44:35,130 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:44:35,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:44:35,130 INFO L85 PathProgramCache]: Analyzing trace with hash -1293998717, now seen corresponding path program 1 times [2025-03-03 13:44:35,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:44:35,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863044113] [2025-03-03 13:44:35,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:44:35,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:44:35,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-03 13:44:35,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-03 13:44:35,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:44:35,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 13:44:35,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1593901035] [2025-03-03 13:44:35,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:44:35,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:44:35,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:44:35,160 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:44:35,164 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-03 13:44:35,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-03 13:44:35,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-03 13:44:35,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:44:35,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:44:35,216 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-03-03 13:44:35,218 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:44:35,426 INFO L134 CoverageAnalysis]: Checked inductivity of 1106 backedges. 45 proven. 115 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-03-03 13:44:35,426 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:44:43,819 INFO L134 CoverageAnalysis]: Checked inductivity of 1106 backedges. 45 proven. 115 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-03-03 13:44:43,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:44:43,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863044113] [2025-03-03 13:44:43,819 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 13:44:43,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1593901035] [2025-03-03 13:44:43,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1593901035] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:44:43,819 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 13:44:43,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2025-03-03 13:44:43,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831169165] [2025-03-03 13:44:43,819 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 13:44:43,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-03 13:44:43,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:44:43,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-03 13:44:43,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=214, Unknown=1, NotChecked=0, Total=272 [2025-03-03 13:44:43,820 INFO L87 Difference]: Start difference. First operand 299 states and 326 transitions. Second operand has 17 states, 17 states have (on average 2.3529411764705883) internal successors, (40), 15 states have internal predecessors, (40), 9 states have call successors, (48), 3 states have call predecessors, (48), 2 states have return successors, (46), 8 states have call predecessors, (46), 9 states have call successors, (46) [2025-03-03 13:44:51,722 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-03 13:44:51,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:44:51,804 INFO L93 Difference]: Finished difference Result 337 states and 356 transitions. [2025-03-03 13:44:51,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 13:44:51,804 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.3529411764705883) internal successors, (40), 15 states have internal predecessors, (40), 9 states have call successors, (48), 3 states have call predecessors, (48), 2 states have return successors, (46), 8 states have call predecessors, (46), 9 states have call successors, (46) Word has length 133 [2025-03-03 13:44:51,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:44:51,806 INFO L225 Difference]: With dead ends: 337 [2025-03-03 13:44:51,806 INFO L226 Difference]: Without dead ends: 299 [2025-03-03 13:44:51,806 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 249 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=76, Invalid=264, Unknown=2, NotChecked=0, Total=342 [2025-03-03 13:44:51,807 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 15 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-03-03 13:44:51,807 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 319 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-03-03 13:44:51,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2025-03-03 13:44:51,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2025-03-03 13:44:51,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 187 states have (on average 1.0427807486631016) internal successors, (195), 193 states have internal predecessors, (195), 61 states have call successors, (61), 51 states have call predecessors, (61), 50 states have return successors, (58), 54 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-03 13:44:51,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 314 transitions. [2025-03-03 13:44:51,866 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 314 transitions. Word has length 133 [2025-03-03 13:44:51,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:44:51,866 INFO L471 AbstractCegarLoop]: Abstraction has 299 states and 314 transitions. [2025-03-03 13:44:51,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.3529411764705883) internal successors, (40), 15 states have internal predecessors, (40), 9 states have call successors, (48), 3 states have call predecessors, (48), 2 states have return successors, (46), 8 states have call predecessors, (46), 9 states have call successors, (46) [2025-03-03 13:44:51,866 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 314 transitions. [2025-03-03 13:44:51,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-03 13:44:51,867 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:44:51,867 INFO L218 NwaCegarLoop]: trace histogram [27, 26, 26, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:44:51,874 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-03 13:44:52,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-03 13:44:52,072 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:44:52,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:44:52,072 INFO L85 PathProgramCache]: Analyzing trace with hash 2137308953, now seen corresponding path program 3 times [2025-03-03 13:44:52,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:44:52,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868211829] [2025-03-03 13:44:52,072 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 13:44:52,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:44:52,077 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 151 statements into 13 equivalence classes. [2025-03-03 13:44:52,133 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) and asserted 151 of 151 statements. [2025-03-03 13:44:52,133 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2025-03-03 13:44:52,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 13:44:52,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [372972569] [2025-03-03 13:44:52,134 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 13:44:52,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:44:52,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:44:52,136 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:44:52,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-03 13:44:52,165 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 151 statements into 13 equivalence classes. [2025-03-03 13:44:52,176 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 40 of 151 statements. [2025-03-03 13:44:52,176 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-03 13:44:52,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:44:52,177 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-03 13:44:52,179 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:44:52,227 INFO L134 CoverageAnalysis]: Checked inductivity of 1432 backedges. 158 proven. 1 refuted. 0 times theorem prover too weak. 1273 trivial. 0 not checked. [2025-03-03 13:44:52,227 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:44:52,349 INFO L134 CoverageAnalysis]: Checked inductivity of 1432 backedges. 158 proven. 1 refuted. 0 times theorem prover too weak. 1273 trivial. 0 not checked. [2025-03-03 13:44:52,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:44:52,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868211829] [2025-03-03 13:44:52,349 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 13:44:52,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [372972569] [2025-03-03 13:44:52,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [372972569] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:44:52,349 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 13:44:52,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 11 [2025-03-03 13:44:52,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212072377] [2025-03-03 13:44:52,350 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 13:44:52,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 13:44:52,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:44:52,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 13:44:52,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-03 13:44:52,350 INFO L87 Difference]: Start difference. First operand 299 states and 314 transitions. Second operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 4 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-03 13:44:52,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:44:52,574 INFO L93 Difference]: Finished difference Result 305 states and 319 transitions. [2025-03-03 13:44:52,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 13:44:52,574 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 4 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 151 [2025-03-03 13:44:52,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:44:52,576 INFO L225 Difference]: With dead ends: 305 [2025-03-03 13:44:52,576 INFO L226 Difference]: Without dead ends: 289 [2025-03-03 13:44:52,576 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 289 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2025-03-03 13:44:52,576 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 4 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 13:44:52,576 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 145 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 13:44:52,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2025-03-03 13:44:52,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 289. [2025-03-03 13:44:52,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 185 states have (on average 1.0108108108108107) internal successors, (187), 186 states have internal predecessors, (187), 53 states have call successors, (53), 50 states have call predecessors, (53), 50 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-03 13:44:52,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 292 transitions. [2025-03-03 13:44:52,637 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 292 transitions. Word has length 151 [2025-03-03 13:44:52,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:44:52,637 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 292 transitions. [2025-03-03 13:44:52,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 4 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-03 13:44:52,638 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 292 transitions. [2025-03-03 13:44:52,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2025-03-03 13:44:52,640 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:44:52,640 INFO L218 NwaCegarLoop]: trace histogram [52, 51, 51, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:44:52,646 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-03 13:44:52,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:44:52,840 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:44:52,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:44:52,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1701249626, now seen corresponding path program 3 times [2025-03-03 13:44:52,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:44:52,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526949440] [2025-03-03 13:44:52,841 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 13:44:52,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:44:52,858 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 293 statements into 35 equivalence classes. [2025-03-03 13:44:53,039 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 31 check-sat command(s) and asserted 248 of 293 statements. [2025-03-03 13:44:53,040 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 31 check-sat command(s) [2025-03-03 13:44:53,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:44:53,531 INFO L134 CoverageAnalysis]: Checked inductivity of 5582 backedges. 102 proven. 380 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2025-03-03 13:44:53,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:44:53,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526949440] [2025-03-03 13:44:53,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526949440] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:44:53,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [884074385] [2025-03-03 13:44:53,532 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 13:44:53,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:44:53,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:44:53,533 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:44:53,534 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-03 13:44:53,571 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 293 statements into 35 equivalence classes. [2025-03-03 13:44:53,670 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 31 check-sat command(s) and asserted 248 of 293 statements. [2025-03-03 13:44:53,670 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 31 check-sat command(s) [2025-03-03 13:44:53,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:44:53,672 INFO L256 TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-03 13:44:53,677 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:44:53,890 INFO L134 CoverageAnalysis]: Checked inductivity of 5582 backedges. 300 proven. 4880 refuted. 0 times theorem prover too weak. 402 trivial. 0 not checked. [2025-03-03 13:44:53,890 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:44:54,174 INFO L134 CoverageAnalysis]: Checked inductivity of 5582 backedges. 102 proven. 380 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2025-03-03 13:44:54,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [884074385] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:44:54,174 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:44:54,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 14] total 26 [2025-03-03 13:44:54,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295771657] [2025-03-03 13:44:54,175 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:44:54,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-03 13:44:54,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:44:54,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-03 13:44:54,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=369, Unknown=0, NotChecked=0, Total=650 [2025-03-03 13:44:54,176 INFO L87 Difference]: Start difference. First operand 289 states and 292 transitions. Second operand has 26 states, 26 states have (on average 4.115384615384615) internal successors, (107), 26 states have internal predecessors, (107), 20 states have call successors, (148), 12 states have call predecessors, (148), 12 states have return successors, (147), 20 states have call predecessors, (147), 20 states have call successors, (147) [2025-03-03 13:44:54,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:44:54,729 INFO L93 Difference]: Finished difference Result 582 states and 595 transitions. [2025-03-03 13:44:54,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2025-03-03 13:44:54,730 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 4.115384615384615) internal successors, (107), 26 states have internal predecessors, (107), 20 states have call successors, (148), 12 states have call predecessors, (148), 12 states have return successors, (147), 20 states have call predecessors, (147), 20 states have call successors, (147) Word has length 293 [2025-03-03 13:44:54,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:44:54,732 INFO L225 Difference]: With dead ends: 582 [2025-03-03 13:44:54,732 INFO L226 Difference]: Without dead ends: 569 [2025-03-03 13:44:54,733 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 617 GetRequests, 573 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=687, Invalid=1205, Unknown=0, NotChecked=0, Total=1892 [2025-03-03 13:44:54,733 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 120 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 13:44:54,734 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 168 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 13:44:54,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2025-03-03 13:44:54,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 569. [2025-03-03 13:44:54,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 569 states, 365 states have (on average 1.0054794520547945) internal successors, (367), 366 states have internal predecessors, (367), 103 states have call successors, (103), 100 states have call predecessors, (103), 100 states have return successors, (102), 102 states have call predecessors, (102), 102 states have call successors, (102) [2025-03-03 13:44:54,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 572 transitions. [2025-03-03 13:44:54,856 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 572 transitions. Word has length 293 [2025-03-03 13:44:54,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:44:54,858 INFO L471 AbstractCegarLoop]: Abstraction has 569 states and 572 transitions. [2025-03-03 13:44:54,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 4.115384615384615) internal successors, (107), 26 states have internal predecessors, (107), 20 states have call successors, (148), 12 states have call predecessors, (148), 12 states have return successors, (147), 20 states have call predecessors, (147), 20 states have call successors, (147) [2025-03-03 13:44:54,859 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 572 transitions. [2025-03-03 13:44:54,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 574 [2025-03-03 13:44:54,867 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:44:54,867 INFO L218 NwaCegarLoop]: trace histogram [102, 101, 101, 21, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:44:54,874 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-03 13:44:55,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-03 13:44:55,068 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:44:55,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:44:55,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1810041470, now seen corresponding path program 4 times [2025-03-03 13:44:55,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:44:55,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035023295] [2025-03-03 13:44:55,068 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 13:44:55,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:44:55,081 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 573 statements into 2 equivalence classes. [2025-03-03 13:44:55,241 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 573 of 573 statements. [2025-03-03 13:44:55,241 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 13:44:55,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 13:44:55,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1891600476] [2025-03-03 13:44:55,244 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 13:44:55,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:44:55,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:44:55,246 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:44:55,247 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-03 13:44:55,300 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 573 statements into 2 equivalence classes. [2025-03-03 13:44:55,481 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 573 of 573 statements. [2025-03-03 13:44:55,481 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 13:44:55,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 13:44:55,481 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 13:44:55,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 573 statements into 1 equivalence classes. [2025-03-03 13:44:55,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 573 of 573 statements. [2025-03-03 13:44:55,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:44:55,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 13:44:55,678 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 13:44:55,678 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 13:44:55,679 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 13:44:55,687 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-03-03 13:44:55,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:44:55,884 INFO L422 BasicCegarLoop]: Path program histogram: [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:44:55,979 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 13:44:55,980 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 01:44:55 BoogieIcfgContainer [2025-03-03 13:44:55,980 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 13:44:55,981 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 13:44:55,981 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 13:44:55,981 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 13:44:55,981 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 01:44:21" (3/4) ... [2025-03-03 13:44:55,982 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-03 13:44:56,084 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 368. [2025-03-03 13:44:56,201 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-03 13:44:56,202 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-03 13:44:56,202 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 13:44:56,203 INFO L158 Benchmark]: Toolchain (without parser) took 35058.37ms. Allocated memory was 201.3MB in the beginning and 293.6MB in the end (delta: 92.3MB). Free memory was 154.5MB in the beginning and 130.5MB in the end (delta: 24.0MB). Peak memory consumption was 113.2MB. Max. memory is 16.1GB. [2025-03-03 13:44:56,203 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 201.3MB. Free memory is still 119.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 13:44:56,203 INFO L158 Benchmark]: CACSL2BoogieTranslator took 165.26ms. Allocated memory is still 201.3MB. Free memory was 154.5MB in the beginning and 143.1MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 13:44:56,203 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.10ms. Allocated memory is still 201.3MB. Free memory was 143.1MB in the beginning and 141.9MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 13:44:56,203 INFO L158 Benchmark]: Boogie Preprocessor took 28.30ms. Allocated memory is still 201.3MB. Free memory was 141.9MB in the beginning and 140.9MB in the end (delta: 1.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 13:44:56,203 INFO L158 Benchmark]: IcfgBuilder took 206.22ms. Allocated memory is still 201.3MB. Free memory was 140.5MB in the beginning and 127.9MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 13:44:56,203 INFO L158 Benchmark]: TraceAbstraction took 34402.27ms. Allocated memory was 201.3MB in the beginning and 293.6MB in the end (delta: 92.3MB). Free memory was 127.2MB in the beginning and 159.0MB in the end (delta: -31.8MB). Peak memory consumption was 62.9MB. Max. memory is 16.1GB. [2025-03-03 13:44:56,203 INFO L158 Benchmark]: Witness Printer took 221.00ms. Allocated memory is still 293.6MB. Free memory was 159.0MB in the beginning and 130.5MB in the end (delta: 28.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-03 13:44:56,204 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.13ms. Allocated memory is still 201.3MB. Free memory is still 119.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 165.26ms. Allocated memory is still 201.3MB. Free memory was 154.5MB in the beginning and 143.1MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.10ms. Allocated memory is still 201.3MB. Free memory was 143.1MB in the beginning and 141.9MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 28.30ms. Allocated memory is still 201.3MB. Free memory was 141.9MB in the beginning and 140.9MB in the end (delta: 1.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 206.22ms. Allocated memory is still 201.3MB. Free memory was 140.5MB in the beginning and 127.9MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 34402.27ms. Allocated memory was 201.3MB in the beginning and 293.6MB in the end (delta: 92.3MB). Free memory was 127.2MB in the beginning and 159.0MB in the end (delta: -31.8MB). Peak memory consumption was 62.9MB. Max. memory is 16.1GB. * Witness Printer took 221.00ms. Allocated memory is still 293.6MB. Free memory was 159.0MB in the beginning and 130.5MB in the end (delta: 28.5MB). Peak memory consumption was 25.2MB. 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: 17]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L22] int counter = 0; VAL [counter=0] [L24] short a; [L25] long long n, x, y, z; [L26] a = __VERIFIER_nondet_ushort() [L28] n = 0 [L29] x = 0 [L30] y = 1 [L31] z = 6 VAL [a=20, counter=0, n=0, x=0, y=1, z=6] [L33] COND TRUE counter++<20 [L33] EXPR counter++ VAL [a=20, counter=1, n=0, x=0, y=1, z=6] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=1] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=20, counter=1, n=0, x=0, y=1, z=6] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=1] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=20, counter=1, n=0, x=0, y=1, z=6] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=1] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=20, counter=1, n=0, x=0, y=1, z=6] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=1] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=20, counter=1, n=0, x=0, y=1, z=6] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=1] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=20, counter=1, n=0, x=0, y=1, z=6] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=20, counter=1, n=1, x=1, y=7, z=12] [L33] COND TRUE counter++<20 [L33] EXPR counter++ VAL [a=20, counter=2, n=1, x=1, y=7, z=12] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=2] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=20, counter=2, n=1, x=1, y=7, z=12] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=2] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=20, counter=2, n=1, x=1, y=7, z=12] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=2] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=20, counter=2, n=1, x=1, y=7, z=12] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=2] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=20, counter=2, n=1, x=1, y=7, z=12] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=2] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=20, counter=2, n=1, x=1, y=7, z=12] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=20, counter=2, n=2, x=8, y=19, z=18] [L33] COND TRUE counter++<20 [L33] EXPR counter++ VAL [a=20, counter=3, n=2, x=8, y=19, z=18] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=3] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=20, counter=3, n=2, x=8, y=19, z=18] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=3] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=20, counter=3, n=2, x=8, y=19, z=18] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=3] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=20, counter=3, n=2, x=8, y=19, z=18] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=3] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=20, counter=3, n=2, x=8, y=19, z=18] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=3] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=20, counter=3, n=2, x=8, y=19, z=18] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=20, counter=3, n=3, x=27, y=37, z=24] [L33] COND TRUE counter++<20 [L33] EXPR counter++ VAL [a=20, counter=4, n=3, x=27, y=37, z=24] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=4] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=20, counter=4, n=3, x=27, y=37, z=24] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=4] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=20, counter=4, n=3, x=27, y=37, z=24] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=4] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=20, counter=4, n=3, x=27, y=37, z=24] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=4] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=20, counter=4, n=3, x=27, y=37, z=24] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=4] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=20, counter=4, n=3, x=27, y=37, z=24] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=20, counter=4, n=4, x=64, y=61, z=30] [L33] COND TRUE counter++<20 [L33] EXPR counter++ VAL [a=20, counter=5, n=4, x=64, y=61, z=30] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=5] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=20, counter=5, n=4, x=64, y=61, z=30] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=5] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=20, counter=5, n=4, x=64, y=61, z=30] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=5] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=20, counter=5, n=4, x=64, y=61, z=30] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=5] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=20, counter=5, n=4, x=64, y=61, z=30] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=5] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=20, counter=5, n=4, x=64, y=61, z=30] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=20, counter=5, n=5, x=125, y=91, z=36] [L33] COND TRUE counter++<20 [L33] EXPR counter++ VAL [a=20, counter=6, n=5, x=125, y=91, z=36] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=6] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=6] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=20, counter=6, n=5, x=125, y=91, z=36] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=6] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=6] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=20, counter=6, n=5, x=125, y=91, z=36] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=6] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=6] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=20, counter=6, n=5, x=125, y=91, z=36] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=6] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=6] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=20, counter=6, n=5, x=125, y=91, z=36] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=6] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=6] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=20, counter=6, n=5, x=125, y=91, z=36] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=20, counter=6, n=6, x=216, y=127, z=42] [L33] COND TRUE counter++<20 [L33] EXPR counter++ VAL [a=20, counter=7, n=6, x=216, y=127, z=42] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=7] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=7] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=20, counter=7, n=6, x=216, y=127, z=42] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=7] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=7] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=20, counter=7, n=6, x=216, y=127, z=42] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=7] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=7] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=20, counter=7, n=6, x=216, y=127, z=42] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=7] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=7] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=20, counter=7, n=6, x=216, y=127, z=42] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=7] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=7] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=20, counter=7, n=6, x=216, y=127, z=42] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=20, counter=7, n=7, x=343, y=169, z=48] [L33] COND TRUE counter++<20 [L33] EXPR counter++ VAL [a=20, counter=8, n=7, x=343, y=169, z=48] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=8] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=8] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=20, counter=8, n=7, x=343, y=169, z=48] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=8] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=8] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=20, counter=8, n=7, x=343, y=169, z=48] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=8] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=8] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=20, counter=8, n=7, x=343, y=169, z=48] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=8] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=8] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=20, counter=8, n=7, x=343, y=169, z=48] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=8] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=8] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=20, counter=8, n=7, x=343, y=169, z=48] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=20, counter=8, n=8, x=512, y=217, z=54] [L33] COND TRUE counter++<20 [L33] EXPR counter++ VAL [a=20, counter=9, n=8, x=512, y=217, z=54] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=9] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=9] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=20, counter=9, n=8, x=512, y=217, z=54] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=9] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=9] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=20, counter=9, n=8, x=512, y=217, z=54] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=9] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=9] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=20, counter=9, n=8, x=512, y=217, z=54] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=9] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=9] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=20, counter=9, n=8, x=512, y=217, z=54] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=9] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=9] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=20, counter=9, n=8, x=512, y=217, z=54] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=20, counter=9, n=9, x=729, y=271, z=60] [L33] COND TRUE counter++<20 [L33] EXPR counter++ VAL [a=20, counter=10, n=9, x=729, y=271, z=60] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=10] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=10] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=20, counter=10, n=9, x=729, y=271, z=60] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=10] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=10] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=20, counter=10, n=9, x=729, y=271, z=60] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=10] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=10] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=20, counter=10, n=9, x=729, y=271, z=60] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=10] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=10] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=20, counter=10, n=9, x=729, y=271, z=60] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=10] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=10] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=20, counter=10, n=9, x=729, y=271, z=60] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=20, counter=10, n=10, x=1000, y=331, z=66] [L33] COND TRUE counter++<20 [L33] EXPR counter++ VAL [a=20, counter=11, n=10, x=1000, y=331, z=66] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=11] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=11] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=20, counter=11, n=10, x=1000, y=331, z=66] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=11] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=11] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=20, counter=11, n=10, x=1000, y=331, z=66] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=11] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=11] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=20, counter=11, n=10, x=1000, y=331, z=66] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=11] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=11] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=20, counter=11, n=10, x=1000, y=331, z=66] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=11] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=11] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=20, counter=11, n=10, x=1000, y=331, z=66] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=20, counter=11, n=11, x=1331, y=397, z=72] [L33] COND TRUE counter++<20 [L33] EXPR counter++ VAL [a=20, counter=12, n=11, x=1331, y=397, z=72] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=12] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=12] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=20, counter=12, n=11, x=1331, y=397, z=72] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=12] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=12] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=20, counter=12, n=11, x=1331, y=397, z=72] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=12] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=12] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=20, counter=12, n=11, x=1331, y=397, z=72] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=12] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=12] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=20, counter=12, n=11, x=1331, y=397, z=72] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=12] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=12] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=20, counter=12, n=11, x=1331, y=397, z=72] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=20, counter=12, n=12, x=1728, y=469, z=78] [L33] COND TRUE counter++<20 [L33] EXPR counter++ VAL [a=20, counter=13, n=12, x=1728, y=469, z=78] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=13] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=13] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=20, counter=13, n=12, x=1728, y=469, z=78] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=13] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=13] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=20, counter=13, n=12, x=1728, y=469, z=78] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=13] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=13] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=20, counter=13, n=12, x=1728, y=469, z=78] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=13] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=13] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=20, counter=13, n=12, x=1728, y=469, z=78] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=13] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=13] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=20, counter=13, n=12, x=1728, y=469, z=78] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=20, counter=13, n=13, x=2197, y=547, z=84] [L33] COND TRUE counter++<20 [L33] EXPR counter++ VAL [a=20, counter=14, n=13, x=2197, y=547, z=84] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=14] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=14] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=20, counter=14, n=13, x=2197, y=547, z=84] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=14] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=14] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=20, counter=14, n=13, x=2197, y=547, z=84] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=14] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=14] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=20, counter=14, n=13, x=2197, y=547, z=84] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=14] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=14] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=20, counter=14, n=13, x=2197, y=547, z=84] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=14] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=14] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=20, counter=14, n=13, x=2197, y=547, z=84] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=20, counter=14, n=14, x=2744, y=631, z=90] [L33] COND TRUE counter++<20 [L33] EXPR counter++ VAL [a=20, counter=15, n=14, x=2744, y=631, z=90] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=15] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=15] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=20, counter=15, n=14, x=2744, y=631, z=90] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=15] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=15] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=20, counter=15, n=14, x=2744, y=631, z=90] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=15] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=15] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=20, counter=15, n=14, x=2744, y=631, z=90] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=15] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=15] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=20, counter=15, n=14, x=2744, y=631, z=90] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=15] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=15] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=20, counter=15, n=14, x=2744, y=631, z=90] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=20, counter=15, n=15, x=3375, y=721, z=96] [L33] COND TRUE counter++<20 [L33] EXPR counter++ VAL [a=20, counter=16, n=15, x=3375, y=721, z=96] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=16] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=16] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=20, counter=16, n=15, x=3375, y=721, z=96] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=16] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=16] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=20, counter=16, n=15, x=3375, y=721, z=96] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=16] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=16] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=20, counter=16, n=15, x=3375, y=721, z=96] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=16] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=16] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=20, counter=16, n=15, x=3375, y=721, z=96] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=16] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=16] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=20, counter=16, n=15, x=3375, y=721, z=96] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=20, counter=16, n=16, x=4096, y=817, z=102] [L33] COND TRUE counter++<20 [L33] EXPR counter++ VAL [a=20, counter=17, n=16, x=4096, y=817, z=102] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=17] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=17] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=20, counter=17, n=16, x=4096, y=817, z=102] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=17] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=17] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=20, counter=17, n=16, x=4096, y=817, z=102] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=17] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=17] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=20, counter=17, n=16, x=4096, y=817, z=102] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=17] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=17] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=20, counter=17, n=16, x=4096, y=817, z=102] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=17] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=17] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=20, counter=17, n=16, x=4096, y=817, z=102] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=20, counter=17, n=17, x=4913, y=919, z=108] [L33] COND TRUE counter++<20 [L33] EXPR counter++ VAL [a=20, counter=18, n=17, x=4913, y=919, z=108] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=18] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=18] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=20, counter=18, n=17, x=4913, y=919, z=108] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=18] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=18] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=20, counter=18, n=17, x=4913, y=919, z=108] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=18] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=18] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=20, counter=18, n=17, x=4913, y=919, z=108] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=18] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=18] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=20, counter=18, n=17, x=4913, y=919, z=108] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=18] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=18] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=20, counter=18, n=17, x=4913, y=919, z=108] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=20, counter=18, n=18, x=5832, y=1027, z=114] [L33] COND TRUE counter++<20 [L33] EXPR counter++ VAL [a=20, counter=19, n=18, x=5832, y=1027, z=114] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=19] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=19] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=20, counter=19, n=18, x=5832, y=1027, z=114] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=19] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=19] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=20, counter=19, n=18, x=5832, y=1027, z=114] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=19] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=19] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=20, counter=19, n=18, x=5832, y=1027, z=114] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=19] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=19] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=20, counter=19, n=18, x=5832, y=1027, z=114] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=19] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=19] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=20, counter=19, n=18, x=5832, y=1027, z=114] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=20, counter=19, n=19, x=6859, y=1141, z=120] [L33] COND TRUE counter++<20 [L33] EXPR counter++ VAL [a=20, counter=20, n=19, x=6859, y=1141, z=120] [L33] COND TRUE counter++<20 [L34] CALL __VERIFIER_assert(z == 6 * n + 6) VAL [\old(cond)=1, counter=20] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=20] [L34] RET __VERIFIER_assert(z == 6 * n + 6) VAL [a=20, counter=20, n=19, x=6859, y=1141, z=120] [L35] CALL __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [\old(cond)=1, counter=20] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=20] [L35] RET __VERIFIER_assert(y == 3 * n * n + 3 * n + 1) VAL [a=20, counter=20, n=19, x=6859, y=1141, z=120] [L36] CALL __VERIFIER_assert(x == n * n * n) VAL [\old(cond)=1, counter=20] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=20] [L36] RET __VERIFIER_assert(x == n * n * n) VAL [a=20, counter=20, n=19, x=6859, y=1141, z=120] [L37] CALL __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [\old(cond)=1, counter=20] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=20] [L37] RET __VERIFIER_assert(y*z - 18*x - 12*y + 2*z - 6 == 0) VAL [a=20, counter=20, n=19, x=6859, y=1141, z=120] [L38] CALL __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [\old(cond)=1, counter=20] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=20] [L38] RET __VERIFIER_assert((z*z) - 12*y - 6*z + 12 == 0) VAL [a=20, counter=20, n=19, x=6859, y=1141, z=120] [L39] COND FALSE !(!(n <= a)) [L42] n = n + 1 [L43] x = x + y [L44] y = y + z [L45] z = z + 6 VAL [a=20, counter=20, n=20, x=8000, y=1261, z=126] [L33] COND TRUE counter++<20 [L33] EXPR counter++ VAL [a=20, counter=21, n=20, x=8000, y=1261, z=126] [L33] COND FALSE !(counter++<20) [L48] CALL __VERIFIER_assert(z == 6*n + 6) VAL [\old(cond)=1, counter=21] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=21] [L48] RET __VERIFIER_assert(z == 6*n + 6) VAL [a=20, counter=21, n=20, x=8000, y=1261, z=126] [L49] CALL __VERIFIER_assert(6*a*x - x*z + 12*x == 0) VAL [\old(cond)=0, counter=21] [L15] COND TRUE !(cond) VAL [\old(cond)=0, counter=21] [L17] reach_error() VAL [\old(cond)=0, counter=21] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 26 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 34.3s, OverallIterations: 19, TraceHistogramMax: 102, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 15.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 483 SdHoareTripleChecker+Valid, 8.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 429 mSDsluCounter, 2891 SdHoareTripleChecker+Invalid, 8.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2334 mSDsCounter, 515 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2629 IncrementalHoareTripleChecker+Invalid, 3145 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 515 mSolverCounterUnsat, 557 mSDtfsCounter, 2629 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2486 GetRequests, 2255 SyntacticMatches, 6 SemanticMatches, 225 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 591 ImplicationChecksByTransitivity, 15.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=569occurred in iteration=18, InterpolantAutomatonStates: 192, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 18 MinimizatonAttempts, 94 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 13.0s InterpolantComputationTime, 3824 NumberOfCodeBlocks, 3583 NumberOfCodeBlocksAsserted, 127 NumberOfCheckSat, 2857 ConstructedInterpolants, 0 QuantifiedInterpolants, 9378 SizeOfPredicates, 40 NumberOfNonLiveVariables, 2783 ConjunctsInSsa, 308 ConjunctsInUnsatCore, 31 InterpolantComputations, 6 PerfectInterpolantSequences, 21970/28892 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-03 13:44:56,226 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