./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound50.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/fermat1-ll_unwindbound50.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 ca2134f8a32f49a0943527ee47fd89b4eb01286294fd09a8197c7c707de74c1d --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 13:53:06,544 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 13:53:06,596 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 13:53:06,599 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 13:53:06,600 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 13:53:06,621 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 13:53:06,622 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 13:53:06,622 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 13:53:06,623 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 13:53:06,623 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 13:53:06,623 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 13:53:06,623 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 13:53:06,624 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 13:53:06,624 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 13:53:06,624 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 13:53:06,624 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 13:53:06,624 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 13:53:06,625 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 13:53:06,625 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 13:53:06,625 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 13:53:06,625 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 13:53:06,625 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 13:53:06,625 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 13:53:06,625 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 13:53:06,625 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 13:53:06,625 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 13:53:06,625 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 13:53:06,625 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 13:53:06,626 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 13:53:06,626 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 13:53:06,626 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 13:53:06,626 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 13:53:06,626 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 13:53:06,626 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 13:53:06,627 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 13:53:06,627 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 13:53:06,627 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 13:53:06,627 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 13:53:06,627 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 13:53:06,627 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 13:53:06,627 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 13:53:06,627 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 13:53:06,627 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 13:53:06,627 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 -> ca2134f8a32f49a0943527ee47fd89b4eb01286294fd09a8197c7c707de74c1d [2025-03-03 13:53:06,838 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 13:53:06,844 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 13:53:06,846 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 13:53:06,846 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 13:53:06,846 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 13:53:06,847 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound50.c [2025-03-03 13:53:07,967 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c23f30752/c78ab8bb37f94bf595bff0239c61d90e/FLAG1cd063273 [2025-03-03 13:53:08,179 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 13:53:08,181 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound50.c [2025-03-03 13:53:08,190 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c23f30752/c78ab8bb37f94bf595bff0239c61d90e/FLAG1cd063273 [2025-03-03 13:53:08,529 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c23f30752/c78ab8bb37f94bf595bff0239c61d90e [2025-03-03 13:53:08,531 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 13:53:08,532 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 13:53:08,532 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 13:53:08,533 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 13:53:08,536 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 13:53:08,536 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 01:53:08" (1/1) ... [2025-03-03 13:53:08,537 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d58bc37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:53:08, skipping insertion in model container [2025-03-03 13:53:08,537 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 01:53:08" (1/1) ... [2025-03-03 13:53:08,545 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 13:53:08,642 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/fermat1-ll_unwindbound50.c[535,548] [2025-03-03 13:53:08,666 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 13:53:08,673 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 13:53:08,679 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/fermat1-ll_unwindbound50.c[535,548] [2025-03-03 13:53:08,689 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 13:53:08,700 INFO L204 MainTranslator]: Completed translation [2025-03-03 13:53:08,701 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:53:08 WrapperNode [2025-03-03 13:53:08,701 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 13:53:08,702 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 13:53:08,702 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 13:53:08,702 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 13:53:08,706 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:53:08" (1/1) ... [2025-03-03 13:53:08,713 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:53:08" (1/1) ... [2025-03-03 13:53:08,721 INFO L138 Inliner]: procedures = 14, calls = 13, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 65 [2025-03-03 13:53:08,722 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 13:53:08,722 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 13:53:08,722 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 13:53:08,722 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 13:53:08,727 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:53:08" (1/1) ... [2025-03-03 13:53:08,727 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:53:08" (1/1) ... [2025-03-03 13:53:08,728 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:53:08" (1/1) ... [2025-03-03 13:53:08,737 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:53:08,737 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:53:08" (1/1) ... [2025-03-03 13:53:08,737 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:53:08" (1/1) ... [2025-03-03 13:53:08,739 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:53:08" (1/1) ... [2025-03-03 13:53:08,739 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:53:08" (1/1) ... [2025-03-03 13:53:08,740 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:53:08" (1/1) ... [2025-03-03 13:53:08,740 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:53:08" (1/1) ... [2025-03-03 13:53:08,741 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 13:53:08,742 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 13:53:08,742 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 13:53:08,742 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 13:53:08,742 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:53:08" (1/1) ... [2025-03-03 13:53:08,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 13:53:08,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:53:08,762 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:53:08,764 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:53:08,778 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 13:53:08,778 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 13:53:08,778 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 13:53:08,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 13:53:08,778 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 13:53:08,778 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 13:53:08,778 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-03 13:53:08,778 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-03 13:53:08,818 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 13:53:08,820 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 13:53:08,944 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2025-03-03 13:53:08,944 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 13:53:08,951 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 13:53:08,952 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 13:53:08,952 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 01:53:08 BoogieIcfgContainer [2025-03-03 13:53:08,952 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 13:53:08,953 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 13:53:08,953 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 13:53:08,956 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 13:53:08,956 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 01:53:08" (1/3) ... [2025-03-03 13:53:08,957 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2afe7521 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 01:53:08, skipping insertion in model container [2025-03-03 13:53:08,957 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:53:08" (2/3) ... [2025-03-03 13:53:08,957 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2afe7521 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 01:53:08, skipping insertion in model container [2025-03-03 13:53:08,957 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 01:53:08" (3/3) ... [2025-03-03 13:53:08,958 INFO L128 eAbstractionObserver]: Analyzing ICFG fermat1-ll_unwindbound50.c [2025-03-03 13:53:08,966 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 13:53:08,967 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG fermat1-ll_unwindbound50.c that has 3 procedures, 32 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-03-03 13:53:09,001 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 13:53:09,008 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;@5ce37a35, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 13:53:09,008 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 13:53:09,012 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 23 states have internal predecessors, (34), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-03 13:53:09,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-03 13:53:09,017 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:53:09,017 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:53:09,018 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:53:09,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:53:09,021 INFO L85 PathProgramCache]: Analyzing trace with hash -758256744, now seen corresponding path program 1 times [2025-03-03 13:53:09,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:53:09,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654020395] [2025-03-03 13:53:09,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:53:09,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:53:09,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-03 13:53:09,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-03 13:53:09,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:53:09,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:53:09,113 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 13:53:09,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:53:09,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654020395] [2025-03-03 13:53:09,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654020395] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:53:09,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [390829631] [2025-03-03 13:53:09,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:53:09,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:53:09,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:53:09,117 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:53:09,118 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:53:09,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-03 13:53:09,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-03 13:53:09,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:53:09,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:53:09,164 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 13:53:09,166 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:53:09,173 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 13:53:09,174 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 13:53:09,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [390829631] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:53:09,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 13:53:09,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 13:53:09,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178730104] [2025-03-03 13:53:09,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:53:09,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 13:53:09,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:53:09,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 13:53:09,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 13:53:09,192 INFO L87 Difference]: Start difference. First operand has 32 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 23 states have internal predecessors, (34), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 13:53:09,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:53:09,203 INFO L93 Difference]: Finished difference Result 61 states and 94 transitions. [2025-03-03 13:53:09,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 13:53:09,204 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2025-03-03 13:53:09,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:53:09,208 INFO L225 Difference]: With dead ends: 61 [2025-03-03 13:53:09,208 INFO L226 Difference]: Without dead ends: 28 [2025-03-03 13:53:09,210 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 19 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:53:09,214 INFO L435 NwaCegarLoop]: 41 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, 41 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:53:09,215 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:53:09,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-03-03 13:53:09,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2025-03-03 13:53:09,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-03 13:53:09,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2025-03-03 13:53:09,240 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 37 transitions. Word has length 18 [2025-03-03 13:53:09,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:53:09,240 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 37 transitions. [2025-03-03 13:53:09,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 13:53:09,241 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2025-03-03 13:53:09,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-03 13:53:09,241 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:53:09,241 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:53:09,248 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 13:53:09,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 13:53:09,442 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:53:09,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:53:09,443 INFO L85 PathProgramCache]: Analyzing trace with hash -766943530, now seen corresponding path program 1 times [2025-03-03 13:53:09,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:53:09,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653602332] [2025-03-03 13:53:09,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:53:09,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:53:09,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-03 13:53:09,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-03 13:53:09,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:53:09,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 13:53:09,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1979744126] [2025-03-03 13:53:09,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:53:09,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:53:09,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:53:09,475 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:53:09,478 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:53:09,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-03 13:53:09,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-03 13:53:09,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:53:09,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:53:09,513 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-03 13:53:09,515 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:53:09,688 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 13:53:09,688 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 13:53:09,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:53:09,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653602332] [2025-03-03 13:53:09,689 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 13:53:09,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1979744126] [2025-03-03 13:53:09,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1979744126] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:53:09,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:53:09,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 13:53:09,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144534240] [2025-03-03 13:53:09,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:53:09,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 13:53:09,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:53:09,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 13:53:09,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 13:53:09,692 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 13:53:11,399 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-03 13:53:11,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:53:11,419 INFO L93 Difference]: Finished difference Result 47 states and 64 transitions. [2025-03-03 13:53:11,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 13:53:11,420 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2025-03-03 13:53:11,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:53:11,420 INFO L225 Difference]: With dead ends: 47 [2025-03-03 13:53:11,420 INFO L226 Difference]: Without dead ends: 45 [2025-03-03 13:53:11,421 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 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:53:11,421 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 13 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-03 13:53:11,421 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 101 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-03 13:53:11,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-03-03 13:53:11,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2025-03-03 13:53:11,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 31 states have (on average 1.4193548387096775) internal successors, (44), 32 states have internal predecessors, (44), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-03 13:53:11,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 61 transitions. [2025-03-03 13:53:11,430 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 61 transitions. Word has length 19 [2025-03-03 13:53:11,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:53:11,431 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 61 transitions. [2025-03-03 13:53:11,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 13:53:11,431 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 61 transitions. [2025-03-03 13:53:11,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-03 13:53:11,431 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:53:11,432 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:53:11,438 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 13:53:11,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-03-03 13:53:11,636 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:53:11,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:53:11,637 INFO L85 PathProgramCache]: Analyzing trace with hash -766198755, now seen corresponding path program 1 times [2025-03-03 13:53:11,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:53:11,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286287814] [2025-03-03 13:53:11,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:53:11,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:53:11,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-03 13:53:11,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-03 13:53:11,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:53:11,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:53:11,697 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 13:53:11,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:53:11,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286287814] [2025-03-03 13:53:11,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286287814] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:53:11,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:53:11,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 13:53:11,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512363243] [2025-03-03 13:53:11,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:53:11,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 13:53:11,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:53:11,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 13:53:11,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 13:53:11,700 INFO L87 Difference]: Start difference. First operand 44 states and 61 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 13:53:11,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:53:11,728 INFO L93 Difference]: Finished difference Result 53 states and 70 transitions. [2025-03-03 13:53:11,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 13:53:11,729 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2025-03-03 13:53:11,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:53:11,730 INFO L225 Difference]: With dead ends: 53 [2025-03-03 13:53:11,730 INFO L226 Difference]: Without dead ends: 46 [2025-03-03 13:53:11,730 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:53:11,731 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 5 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:53:11,731 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 91 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:53:11,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-03-03 13:53:11,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2025-03-03 13:53:11,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 33 states have (on average 1.393939393939394) internal successors, (46), 34 states have internal predecessors, (46), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-03 13:53:11,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 63 transitions. [2025-03-03 13:53:11,739 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 63 transitions. Word has length 19 [2025-03-03 13:53:11,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:53:11,739 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 63 transitions. [2025-03-03 13:53:11,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 13:53:11,739 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 63 transitions. [2025-03-03 13:53:11,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-03 13:53:11,740 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:53:11,740 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:53:11,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 13:53:11,740 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:53:11,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:53:11,741 INFO L85 PathProgramCache]: Analyzing trace with hash -1891524392, now seen corresponding path program 1 times [2025-03-03 13:53:11,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:53:11,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849408012] [2025-03-03 13:53:11,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:53:11,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:53:11,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-03 13:53:11,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-03 13:53:11,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:53:11,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:53:11,998 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 13:53:11,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:53:11,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849408012] [2025-03-03 13:53:11,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849408012] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:53:11,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1102570956] [2025-03-03 13:53:11,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:53:11,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:53:11,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:53:12,001 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:53:12,002 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:53:12,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-03 13:53:12,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-03 13:53:12,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:53:12,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:53:12,033 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-03 13:53:12,034 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:53:12,094 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 13:53:12,094 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:53:12,181 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 13:53:12,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1102570956] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:53:12,182 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:53:12,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 12 [2025-03-03 13:53:12,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845851844] [2025-03-03 13:53:12,182 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:53:12,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 13:53:12,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:53:12,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 13:53:12,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-03-03 13:53:12,183 INFO L87 Difference]: Start difference. First operand 46 states and 63 transitions. Second operand has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 4 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-03 13:53:12,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:53:12,263 INFO L93 Difference]: Finished difference Result 53 states and 69 transitions. [2025-03-03 13:53:12,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 13:53:12,263 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 4 states have call predecessors, (5), 1 states have call successors, (5) Word has length 25 [2025-03-03 13:53:12,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:53:12,264 INFO L225 Difference]: With dead ends: 53 [2025-03-03 13:53:12,264 INFO L226 Difference]: Without dead ends: 48 [2025-03-03 13:53:12,266 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-03-03 13:53:12,267 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 16 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 13:53:12,267 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 133 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 13:53:12,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-03-03 13:53:12,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 32. [2025-03-03 13:53:12,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-03 13:53:12,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2025-03-03 13:53:12,283 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 25 [2025-03-03 13:53:12,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:53:12,283 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2025-03-03 13:53:12,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 4 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-03 13:53:12,284 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2025-03-03 13:53:12,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-03 13:53:12,284 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:53:12,285 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:53:12,296 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 13:53:12,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:53:12,485 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:53:12,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:53:12,486 INFO L85 PathProgramCache]: Analyzing trace with hash -2058223402, now seen corresponding path program 1 times [2025-03-03 13:53:12,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:53:12,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994206102] [2025-03-03 13:53:12,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:53:12,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:53:12,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-03 13:53:12,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-03 13:53:12,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:53:12,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:53:12,547 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:53:12,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:53:12,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994206102] [2025-03-03 13:53:12,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994206102] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:53:12,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:53:12,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 13:53:12,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521793427] [2025-03-03 13:53:12,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:53:12,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 13:53:12,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:53:12,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 13:53:12,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 13:53:12,548 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-03 13:53:12,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:53:12,585 INFO L93 Difference]: Finished difference Result 61 states and 75 transitions. [2025-03-03 13:53:12,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 13:53:12,585 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 31 [2025-03-03 13:53:12,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:53:12,586 INFO L225 Difference]: With dead ends: 61 [2025-03-03 13:53:12,586 INFO L226 Difference]: Without dead ends: 40 [2025-03-03 13:53:12,586 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 13:53:12,587 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 12 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:53:12,587 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 91 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:53:12,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-03-03 13:53:12,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2025-03-03 13:53:12,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-03 13:53:12,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 47 transitions. [2025-03-03 13:53:12,596 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 47 transitions. Word has length 31 [2025-03-03 13:53:12,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:53:12,596 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 47 transitions. [2025-03-03 13:53:12,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-03 13:53:12,597 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2025-03-03 13:53:12,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-03 13:53:12,597 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:53:12,597 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:53:12,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 13:53:12,598 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:53:12,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:53:12,598 INFO L85 PathProgramCache]: Analyzing trace with hash -1717573043, now seen corresponding path program 1 times [2025-03-03 13:53:12,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:53:12,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27722666] [2025-03-03 13:53:12,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:53:12,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:53:12,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-03 13:53:12,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-03 13:53:12,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:53:12,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:53:12,686 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-03 13:53:12,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:53:12,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27722666] [2025-03-03 13:53:12,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27722666] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:53:12,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:53:12,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 13:53:12,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528414210] [2025-03-03 13:53:12,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:53:12,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 13:53:12,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:53:12,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 13:53:12,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 13:53:12,687 INFO L87 Difference]: Start difference. First operand 40 states and 47 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-03 13:53:12,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:53:12,730 INFO L93 Difference]: Finished difference Result 70 states and 85 transitions. [2025-03-03 13:53:12,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 13:53:12,731 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 37 [2025-03-03 13:53:12,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:53:12,732 INFO L225 Difference]: With dead ends: 70 [2025-03-03 13:53:12,732 INFO L226 Difference]: Without dead ends: 49 [2025-03-03 13:53:12,733 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 13:53:12,733 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 23 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:53:12,734 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 95 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:53:12,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-03-03 13:53:12,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2025-03-03 13:53:12,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 35 states have internal predecessors, (41), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-03 13:53:12,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 56 transitions. [2025-03-03 13:53:12,747 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 56 transitions. Word has length 37 [2025-03-03 13:53:12,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:53:12,748 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 56 transitions. [2025-03-03 13:53:12,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-03 13:53:12,748 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 56 transitions. [2025-03-03 13:53:12,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-03 13:53:12,748 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:53:12,748 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:53:12,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 13:53:12,749 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:53:12,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:53:12,749 INFO L85 PathProgramCache]: Analyzing trace with hash -1141283122, now seen corresponding path program 1 times [2025-03-03 13:53:12,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:53:12,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399074490] [2025-03-03 13:53:12,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:53:12,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:53:12,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-03 13:53:12,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-03 13:53:12,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:53:12,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:53:12,838 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-03 13:53:12,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:53:12,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399074490] [2025-03-03 13:53:12,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399074490] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:53:12,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1656766757] [2025-03-03 13:53:12,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:53:12,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:53:12,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:53:12,842 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:53:12,842 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:53:12,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-03 13:53:12,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-03 13:53:12,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:53:12,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:53:12,881 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-03 13:53:12,882 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:53:12,917 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 13:53:12,918 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:53:12,970 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-03 13:53:12,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1656766757] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:53:12,970 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:53:12,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 10 [2025-03-03 13:53:12,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793162795] [2025-03-03 13:53:12,970 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:53:12,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 13:53:12,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:53:12,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 13:53:12,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-03 13:53:12,971 INFO L87 Difference]: Start difference. First operand 48 states and 56 transitions. Second operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 7 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2025-03-03 13:53:13,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:53:13,107 INFO L93 Difference]: Finished difference Result 125 states and 156 transitions. [2025-03-03 13:53:13,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 13:53:13,107 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 7 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) Word has length 39 [2025-03-03 13:53:13,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:53:13,109 INFO L225 Difference]: With dead ends: 125 [2025-03-03 13:53:13,110 INFO L226 Difference]: Without dead ends: 104 [2025-03-03 13:53:13,111 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2025-03-03 13:53:13,111 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 64 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 13:53:13,112 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 141 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 13:53:13,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-03-03 13:53:13,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 91. [2025-03-03 13:53:13,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 67 states have (on average 1.2238805970149254) internal successors, (82), 68 states have internal predecessors, (82), 16 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-03 13:53:13,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 113 transitions. [2025-03-03 13:53:13,140 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 113 transitions. Word has length 39 [2025-03-03 13:53:13,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:53:13,141 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 113 transitions. [2025-03-03 13:53:13,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 7 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2025-03-03 13:53:13,141 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 113 transitions. [2025-03-03 13:53:13,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-03 13:53:13,143 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:53:13,143 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:53:13,149 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-03 13:53:13,348 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:53:13,348 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:53:13,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:53:13,348 INFO L85 PathProgramCache]: Analyzing trace with hash 318935871, now seen corresponding path program 1 times [2025-03-03 13:53:13,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:53:13,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038977017] [2025-03-03 13:53:13,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:53:13,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:53:13,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-03 13:53:13,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-03 13:53:13,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:53:13,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:53:13,393 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-03 13:53:13,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:53:13,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038977017] [2025-03-03 13:53:13,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038977017] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:53:13,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:53:13,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 13:53:13,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859078876] [2025-03-03 13:53:13,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:53:13,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 13:53:13,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:53:13,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 13:53:13,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 13:53:13,394 INFO L87 Difference]: Start difference. First operand 91 states and 113 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-03 13:53:13,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:53:13,444 INFO L93 Difference]: Finished difference Result 154 states and 198 transitions. [2025-03-03 13:53:13,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 13:53:13,444 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 43 [2025-03-03 13:53:13,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:53:13,446 INFO L225 Difference]: With dead ends: 154 [2025-03-03 13:53:13,446 INFO L226 Difference]: Without dead ends: 115 [2025-03-03 13:53:13,446 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 13:53:13,446 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 20 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:53:13,447 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 86 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:53:13,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2025-03-03 13:53:13,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 105. [2025-03-03 13:53:13,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 78 states have (on average 1.2307692307692308) internal successors, (96), 79 states have internal predecessors, (96), 19 states have call successors, (19), 8 states have call predecessors, (19), 7 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-03 13:53:13,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 133 transitions. [2025-03-03 13:53:13,477 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 133 transitions. Word has length 43 [2025-03-03 13:53:13,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:53:13,477 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 133 transitions. [2025-03-03 13:53:13,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-03 13:53:13,477 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 133 transitions. [2025-03-03 13:53:13,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-03 13:53:13,478 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:53:13,478 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:53:13,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 13:53:13,478 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:53:13,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:53:13,478 INFO L85 PathProgramCache]: Analyzing trace with hash 191952453, now seen corresponding path program 1 times [2025-03-03 13:53:13,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:53:13,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240253923] [2025-03-03 13:53:13,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:53:13,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:53:13,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-03 13:53:13,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-03 13:53:13,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:53:13,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:53:13,567 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-03 13:53:13,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:53:13,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240253923] [2025-03-03 13:53:13,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240253923] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:53:13,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1499235894] [2025-03-03 13:53:13,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:53:13,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:53:13,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:53:13,570 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:53:13,571 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:53:13,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-03 13:53:13,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-03 13:53:13,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:53:13,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:53:13,604 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-03 13:53:13,605 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:53:13,651 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 8 proven. 16 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 13:53:13,652 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:53:13,735 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-03 13:53:13,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1499235894] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:53:13,735 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:53:13,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 12 [2025-03-03 13:53:13,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121200349] [2025-03-03 13:53:13,736 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:53:13,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 13:53:13,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:53:13,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 13:53:13,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2025-03-03 13:53:13,737 INFO L87 Difference]: Start difference. First operand 105 states and 133 transitions. Second operand has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 9 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (15), 8 states have call predecessors, (15), 8 states have call successors, (15) [2025-03-03 13:53:13,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:53:13,917 INFO L93 Difference]: Finished difference Result 215 states and 279 transitions. [2025-03-03 13:53:13,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 13:53:13,918 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 9 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (15), 8 states have call predecessors, (15), 8 states have call successors, (15) Word has length 45 [2025-03-03 13:53:13,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:53:13,919 INFO L225 Difference]: With dead ends: 215 [2025-03-03 13:53:13,919 INFO L226 Difference]: Without dead ends: 168 [2025-03-03 13:53:13,919 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2025-03-03 13:53:13,920 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 74 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 13:53:13,920 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 162 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 13:53:13,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2025-03-03 13:53:13,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 149. [2025-03-03 13:53:13,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 111 states have (on average 1.2432432432432432) internal successors, (138), 112 states have internal predecessors, (138), 28 states have call successors, (28), 10 states have call predecessors, (28), 9 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-03 13:53:13,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 193 transitions. [2025-03-03 13:53:13,958 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 193 transitions. Word has length 45 [2025-03-03 13:53:13,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:53:13,958 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 193 transitions. [2025-03-03 13:53:13,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 9 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (15), 8 states have call predecessors, (15), 8 states have call successors, (15) [2025-03-03 13:53:13,958 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 193 transitions. [2025-03-03 13:53:13,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-03 13:53:13,961 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:53:13,961 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:53:13,968 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-03 13:53:14,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:53:14,162 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:53:14,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:53:14,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1202242871, now seen corresponding path program 1 times [2025-03-03 13:53:14,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:53:14,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004073574] [2025-03-03 13:53:14,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:53:14,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:53:14,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-03 13:53:14,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-03 13:53:14,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:53:14,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:53:14,263 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-03 13:53:14,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:53:14,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004073574] [2025-03-03 13:53:14,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004073574] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:53:14,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1695502473] [2025-03-03 13:53:14,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:53:14,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:53:14,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:53:14,265 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:53:14,266 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:53:14,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-03 13:53:14,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-03 13:53:14,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:53:14,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:53:14,303 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-03 13:53:14,304 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:53:14,360 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 8 proven. 30 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 13:53:14,360 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:53:14,448 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-03 13:53:14,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1695502473] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:53:14,448 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:53:14,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 14 [2025-03-03 13:53:14,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803634706] [2025-03-03 13:53:14,448 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:53:14,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 13:53:14,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:53:14,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 13:53:14,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2025-03-03 13:53:14,449 INFO L87 Difference]: Start difference. First operand 149 states and 193 transitions. Second operand has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 11 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (18), 10 states have call predecessors, (18), 10 states have call successors, (18) [2025-03-03 13:53:14,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:53:14,683 INFO L93 Difference]: Finished difference Result 207 states and 274 transitions. [2025-03-03 13:53:14,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-03 13:53:14,684 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 11 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (18), 10 states have call predecessors, (18), 10 states have call successors, (18) Word has length 51 [2025-03-03 13:53:14,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:53:14,685 INFO L225 Difference]: With dead ends: 207 [2025-03-03 13:53:14,685 INFO L226 Difference]: Without dead ends: 202 [2025-03-03 13:53:14,685 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=130, Invalid=250, Unknown=0, NotChecked=0, Total=380 [2025-03-03 13:53:14,686 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 143 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 13:53:14,686 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 171 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 13:53:14,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2025-03-03 13:53:14,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 194. [2025-03-03 13:53:14,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 144 states have (on average 1.2361111111111112) internal successors, (178), 148 states have internal predecessors, (178), 38 states have call successors, (38), 12 states have call predecessors, (38), 11 states have return successors, (37), 33 states have call predecessors, (37), 37 states have call successors, (37) [2025-03-03 13:53:14,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 253 transitions. [2025-03-03 13:53:14,719 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 253 transitions. Word has length 51 [2025-03-03 13:53:14,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:53:14,719 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 253 transitions. [2025-03-03 13:53:14,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 11 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (18), 10 states have call predecessors, (18), 10 states have call successors, (18) [2025-03-03 13:53:14,719 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 253 transitions. [2025-03-03 13:53:14,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-03 13:53:14,720 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:53:14,720 INFO L218 NwaCegarLoop]: trace histogram [9, 8, 8, 8, 7, 7, 7, 7, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:53:14,726 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:53:14,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:53:14,921 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:53:14,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:53:14,921 INFO L85 PathProgramCache]: Analyzing trace with hash -760810850, now seen corresponding path program 2 times [2025-03-03 13:53:14,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:53:14,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776376091] [2025-03-03 13:53:14,922 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:53:14,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:53:14,927 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 87 statements into 2 equivalence classes. [2025-03-03 13:53:14,938 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 87 of 87 statements. [2025-03-03 13:53:14,939 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:53:14,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:53:15,153 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 18 proven. 98 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2025-03-03 13:53:15,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:53:15,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776376091] [2025-03-03 13:53:15,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776376091] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:53:15,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2032741080] [2025-03-03 13:53:15,154 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:53:15,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:53:15,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:53:15,156 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:53:15,157 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:53:15,183 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 87 statements into 2 equivalence classes. [2025-03-03 13:53:15,205 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 87 of 87 statements. [2025-03-03 13:53:15,205 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:53:15,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:53:15,206 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-03 13:53:15,208 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:53:15,288 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 18 proven. 210 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 13:53:15,289 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:53:15,498 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 18 proven. 98 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2025-03-03 13:53:15,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2032741080] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:53:15,499 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:53:15,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 12] total 22 [2025-03-03 13:53:15,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941929367] [2025-03-03 13:53:15,499 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:53:15,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-03 13:53:15,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:53:15,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-03 13:53:15,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=267, Unknown=0, NotChecked=0, Total=462 [2025-03-03 13:53:15,500 INFO L87 Difference]: Start difference. First operand 194 states and 253 transitions. Second operand has 22 states, 22 states have (on average 4.454545454545454) internal successors, (98), 22 states have internal predecessors, (98), 19 states have call successors, (31), 11 states have call predecessors, (31), 10 states have return successors, (30), 18 states have call predecessors, (30), 18 states have call successors, (30) [2025-03-03 13:53:16,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:53:16,048 INFO L93 Difference]: Finished difference Result 549 states and 749 transitions. [2025-03-03 13:53:16,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-03-03 13:53:16,049 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 4.454545454545454) internal successors, (98), 22 states have internal predecessors, (98), 19 states have call successors, (31), 11 states have call predecessors, (31), 10 states have return successors, (30), 18 states have call predecessors, (30), 18 states have call successors, (30) Word has length 87 [2025-03-03 13:53:16,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:53:16,051 INFO L225 Difference]: With dead ends: 549 [2025-03-03 13:53:16,051 INFO L226 Difference]: Without dead ends: 491 [2025-03-03 13:53:16,052 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=507, Invalid=899, Unknown=0, NotChecked=0, Total=1406 [2025-03-03 13:53:16,053 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 364 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 13:53:16,054 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [364 Valid, 318 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 13:53:16,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2025-03-03 13:53:16,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 449. [2025-03-03 13:53:16,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 336 states have (on average 1.2470238095238095) internal successors, (419), 339 states have internal predecessors, (419), 93 states have call successors, (93), 20 states have call predecessors, (93), 19 states have return successors, (92), 89 states have call predecessors, (92), 92 states have call successors, (92) [2025-03-03 13:53:16,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 604 transitions. [2025-03-03 13:53:16,134 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 604 transitions. Word has length 87 [2025-03-03 13:53:16,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:53:16,134 INFO L471 AbstractCegarLoop]: Abstraction has 449 states and 604 transitions. [2025-03-03 13:53:16,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 4.454545454545454) internal successors, (98), 22 states have internal predecessors, (98), 19 states have call successors, (31), 11 states have call predecessors, (31), 10 states have return successors, (30), 18 states have call predecessors, (30), 18 states have call successors, (30) [2025-03-03 13:53:16,134 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 604 transitions. [2025-03-03 13:53:16,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-03 13:53:16,135 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:53:16,135 INFO L218 NwaCegarLoop]: trace histogram [10, 9, 9, 8, 8, 8, 8, 7, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:53:16,142 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:53:16,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:53:16,337 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:53:16,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:53:16,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1449499115, now seen corresponding path program 2 times [2025-03-03 13:53:16,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:53:16,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48647831] [2025-03-03 13:53:16,338 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:53:16,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:53:16,344 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 93 statements into 2 equivalence classes. [2025-03-03 13:53:16,353 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 93 of 93 statements. [2025-03-03 13:53:16,353 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:53:16,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:53:16,552 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 20 proven. 112 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2025-03-03 13:53:16,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:53:16,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48647831] [2025-03-03 13:53:16,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48647831] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:53:16,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2091879483] [2025-03-03 13:53:16,552 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:53:16,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:53:16,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:53:16,554 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:53:16,556 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:53:16,582 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 93 statements into 2 equivalence classes. [2025-03-03 13:53:16,604 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 93 of 93 statements. [2025-03-03 13:53:16,604 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:53:16,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:53:16,605 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-03 13:53:16,607 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:53:16,707 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 20 proven. 256 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 13:53:16,707 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:53:16,930 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 20 proven. 112 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2025-03-03 13:53:16,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2091879483] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:53:16,930 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:53:16,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 13] total 24 [2025-03-03 13:53:16,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281082635] [2025-03-03 13:53:16,931 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:53:16,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-03 13:53:16,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:53:16,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-03 13:53:16,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2025-03-03 13:53:16,932 INFO L87 Difference]: Start difference. First operand 449 states and 604 transitions. Second operand has 24 states, 24 states have (on average 4.375) internal successors, (105), 24 states have internal predecessors, (105), 21 states have call successors, (34), 12 states have call predecessors, (34), 11 states have return successors, (33), 20 states have call predecessors, (33), 20 states have call successors, (33) [2025-03-03 13:53:17,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:53:17,577 INFO L93 Difference]: Finished difference Result 746 states and 991 transitions. [2025-03-03 13:53:17,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-03-03 13:53:17,577 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 4.375) internal successors, (105), 24 states have internal predecessors, (105), 21 states have call successors, (34), 12 states have call predecessors, (34), 11 states have return successors, (33), 20 states have call predecessors, (33), 20 states have call successors, (33) Word has length 93 [2025-03-03 13:53:17,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:53:17,580 INFO L225 Difference]: With dead ends: 746 [2025-03-03 13:53:17,581 INFO L226 Difference]: Without dead ends: 486 [2025-03-03 13:53:17,583 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=584, Invalid=1056, Unknown=0, NotChecked=0, Total=1640 [2025-03-03 13:53:17,584 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 456 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 204 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 456 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 204 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 13:53:17,584 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [456 Valid, 337 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [204 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 13:53:17,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2025-03-03 13:53:17,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 437. [2025-03-03 13:53:17,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 437 states, 327 states have (on average 1.2110091743119267) internal successors, (396), 328 states have internal predecessors, (396), 88 states have call successors, (88), 22 states have call predecessors, (88), 21 states have return successors, (87), 86 states have call predecessors, (87), 87 states have call successors, (87) [2025-03-03 13:53:17,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 571 transitions. [2025-03-03 13:53:17,647 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 571 transitions. Word has length 93 [2025-03-03 13:53:17,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:53:17,647 INFO L471 AbstractCegarLoop]: Abstraction has 437 states and 571 transitions. [2025-03-03 13:53:17,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 4.375) internal successors, (105), 24 states have internal predecessors, (105), 21 states have call successors, (34), 12 states have call predecessors, (34), 11 states have return successors, (33), 20 states have call predecessors, (33), 20 states have call successors, (33) [2025-03-03 13:53:17,648 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 571 transitions. [2025-03-03 13:53:17,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-03 13:53:17,649 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:53:17,651 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 8, 8, 8, 8, 7, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:53:17,673 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:53:17,855 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,SelfDestructingSolverStorable11 [2025-03-03 13:53:17,855 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:53:17,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:53:17,856 INFO L85 PathProgramCache]: Analyzing trace with hash -1311565561, now seen corresponding path program 2 times [2025-03-03 13:53:17,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:53:17,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183419] [2025-03-03 13:53:17,856 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:53:17,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:53:17,860 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 99 statements into 2 equivalence classes. [2025-03-03 13:53:17,868 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 99 of 99 statements. [2025-03-03 13:53:17,868 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:53:17,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:53:18,131 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 20 proven. 114 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2025-03-03 13:53:18,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:53:18,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183419] [2025-03-03 13:53:18,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183419] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:53:18,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1082412542] [2025-03-03 13:53:18,132 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:53:18,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:53:18,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:53:18,134 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:53:18,135 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:53:18,158 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 99 statements into 2 equivalence classes. [2025-03-03 13:53:18,181 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 99 of 99 statements. [2025-03-03 13:53:18,181 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:53:18,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:53:18,182 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-03 13:53:18,186 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:53:18,301 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 20 proven. 294 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 13:53:18,302 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:53:18,556 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 20 proven. 114 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2025-03-03 13:53:18,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1082412542] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:53:18,557 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:53:18,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 14] total 26 [2025-03-03 13:53:18,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905512837] [2025-03-03 13:53:18,557 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:53:18,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-03 13:53:18,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:53:18,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-03 13:53:18,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=369, Unknown=0, NotChecked=0, Total=650 [2025-03-03 13:53:18,558 INFO L87 Difference]: Start difference. First operand 437 states and 571 transitions. Second operand has 26 states, 26 states have (on average 4.3076923076923075) internal successors, (112), 26 states have internal predecessors, (112), 23 states have call successors, (37), 13 states have call predecessors, (37), 12 states have return successors, (36), 22 states have call predecessors, (36), 22 states have call successors, (36) [2025-03-03 13:53:19,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:53:19,150 INFO L93 Difference]: Finished difference Result 495 states and 652 transitions. [2025-03-03 13:53:19,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2025-03-03 13:53:19,150 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 4.3076923076923075) internal successors, (112), 26 states have internal predecessors, (112), 23 states have call successors, (37), 13 states have call predecessors, (37), 12 states have return successors, (36), 22 states have call predecessors, (36), 22 states have call successors, (36) Word has length 99 [2025-03-03 13:53:19,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:53:19,153 INFO L225 Difference]: With dead ends: 495 [2025-03-03 13:53:19,153 INFO L226 Difference]: Without dead ends: 490 [2025-03-03 13:53:19,154 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=670, Invalid=1222, Unknown=0, NotChecked=0, Total=1892 [2025-03-03 13:53:19,154 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 415 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 197 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 415 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 197 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 13:53:19,154 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [415 Valid, 339 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [197 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 13:53:19,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2025-03-03 13:53:19,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 482. [2025-03-03 13:53:19,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 482 states, 360 states have (on average 1.1944444444444444) internal successors, (430), 364 states have internal predecessors, (430), 98 states have call successors, (98), 24 states have call predecessors, (98), 23 states have return successors, (97), 93 states have call predecessors, (97), 97 states have call successors, (97) [2025-03-03 13:53:19,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 625 transitions. [2025-03-03 13:53:19,222 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 625 transitions. Word has length 99 [2025-03-03 13:53:19,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:53:19,222 INFO L471 AbstractCegarLoop]: Abstraction has 482 states and 625 transitions. [2025-03-03 13:53:19,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 4.3076923076923075) internal successors, (112), 26 states have internal predecessors, (112), 23 states have call successors, (37), 13 states have call predecessors, (37), 12 states have return successors, (36), 22 states have call predecessors, (36), 22 states have call successors, (36) [2025-03-03 13:53:19,223 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 625 transitions. [2025-03-03 13:53:19,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-03-03 13:53:19,224 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:53:19,224 INFO L218 NwaCegarLoop]: trace histogram [21, 20, 20, 20, 19, 19, 19, 19, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:53:19,230 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:53:19,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-03 13:53:19,425 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:53:19,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:53:19,426 INFO L85 PathProgramCache]: Analyzing trace with hash -897357250, now seen corresponding path program 3 times [2025-03-03 13:53:19,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:53:19,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63602827] [2025-03-03 13:53:19,426 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 13:53:19,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:53:19,432 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 183 statements into 21 equivalence classes. [2025-03-03 13:53:19,491 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) and asserted 183 of 183 statements. [2025-03-03 13:53:19,491 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2025-03-03 13:53:19,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:53:20,085 INFO L134 CoverageAnalysis]: Checked inductivity of 1528 backedges. 42 proven. 722 refuted. 0 times theorem prover too weak. 764 trivial. 0 not checked. [2025-03-03 13:53:20,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:53:20,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63602827] [2025-03-03 13:53:20,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63602827] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:53:20,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [84522388] [2025-03-03 13:53:20,086 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 13:53:20,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:53:20,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:53:20,088 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:53:20,089 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:53:20,128 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 183 statements into 21 equivalence classes. [2025-03-03 13:53:20,474 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) and asserted 183 of 183 statements. [2025-03-03 13:53:20,475 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2025-03-03 13:53:20,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:53:20,480 INFO L256 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-03-03 13:53:20,483 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:53:20,663 INFO L134 CoverageAnalysis]: Checked inductivity of 1528 backedges. 42 proven. 1482 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 13:53:20,664 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:53:21,270 INFO L134 CoverageAnalysis]: Checked inductivity of 1528 backedges. 42 proven. 722 refuted. 0 times theorem prover too weak. 764 trivial. 0 not checked. [2025-03-03 13:53:21,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [84522388] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:53:21,270 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:53:21,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 24] total 46 [2025-03-03 13:53:21,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691160700] [2025-03-03 13:53:21,270 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:53:21,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-03-03 13:53:21,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:53:21,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-03-03 13:53:21,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=951, Invalid=1119, Unknown=0, NotChecked=0, Total=2070 [2025-03-03 13:53:21,273 INFO L87 Difference]: Start difference. First operand 482 states and 625 transitions. Second operand has 46 states, 46 states have (on average 4.478260869565218) internal successors, (206), 46 states have internal predecessors, (206), 43 states have call successors, (67), 23 states have call predecessors, (67), 22 states have return successors, (66), 42 states have call predecessors, (66), 42 states have call successors, (66) [2025-03-03 13:53:22,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:53:22,831 INFO L93 Difference]: Finished difference Result 1281 states and 1745 transitions. [2025-03-03 13:53:22,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2025-03-03 13:53:22,832 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 4.478260869565218) internal successors, (206), 46 states have internal predecessors, (206), 43 states have call successors, (67), 23 states have call predecessors, (67), 22 states have return successors, (66), 42 states have call predecessors, (66), 42 states have call successors, (66) Word has length 183 [2025-03-03 13:53:22,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:53:22,836 INFO L225 Difference]: With dead ends: 1281 [2025-03-03 13:53:22,836 INFO L226 Difference]: Without dead ends: 1223 [2025-03-03 13:53:22,838 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 428 GetRequests, 344 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1031 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=2691, Invalid=4619, Unknown=0, NotChecked=0, Total=7310 [2025-03-03 13:53:22,838 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 1042 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 453 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1042 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 920 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 453 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 13:53:22,839 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1042 Valid, 628 Invalid, 920 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [453 Valid, 467 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 13:53:22,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1223 states. [2025-03-03 13:53:22,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1223 to 1121. [2025-03-03 13:53:22,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1121 states, 840 states have (on average 1.2416666666666667) internal successors, (1043), 843 states have internal predecessors, (1043), 237 states have call successors, (237), 44 states have call predecessors, (237), 43 states have return successors, (236), 233 states have call predecessors, (236), 236 states have call successors, (236) [2025-03-03 13:53:22,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1121 states to 1121 states and 1516 transitions. [2025-03-03 13:53:22,971 INFO L78 Accepts]: Start accepts. Automaton has 1121 states and 1516 transitions. Word has length 183 [2025-03-03 13:53:22,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:53:22,971 INFO L471 AbstractCegarLoop]: Abstraction has 1121 states and 1516 transitions. [2025-03-03 13:53:22,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 4.478260869565218) internal successors, (206), 46 states have internal predecessors, (206), 43 states have call successors, (67), 23 states have call predecessors, (67), 22 states have return successors, (66), 42 states have call predecessors, (66), 42 states have call successors, (66) [2025-03-03 13:53:22,972 INFO L276 IsEmpty]: Start isEmpty. Operand 1121 states and 1516 transitions. [2025-03-03 13:53:22,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2025-03-03 13:53:22,973 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:53:22,973 INFO L218 NwaCegarLoop]: trace histogram [22, 21, 21, 20, 20, 20, 20, 19, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:53:22,978 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-03 13:53:23,174 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,SelfDestructingSolverStorable13 [2025-03-03 13:53:23,174 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:53:23,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:53:23,174 INFO L85 PathProgramCache]: Analyzing trace with hash 1642505653, now seen corresponding path program 3 times [2025-03-03 13:53:23,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:53:23,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076362492] [2025-03-03 13:53:23,175 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 13:53:23,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:53:23,182 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 189 statements into 22 equivalence classes. [2025-03-03 13:53:23,256 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) and asserted 189 of 189 statements. [2025-03-03 13:53:23,256 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2025-03-03 13:53:23,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:53:23,918 INFO L134 CoverageAnalysis]: Checked inductivity of 1648 backedges. 44 proven. 760 refuted. 0 times theorem prover too weak. 844 trivial. 0 not checked. [2025-03-03 13:53:23,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:53:23,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076362492] [2025-03-03 13:53:23,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076362492] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:53:23,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [64657785] [2025-03-03 13:53:23,919 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 13:53:23,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:53:23,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:53:23,921 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:53:23,923 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:53:23,954 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 189 statements into 22 equivalence classes. [2025-03-03 13:53:24,209 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) and asserted 189 of 189 statements. [2025-03-03 13:53:24,209 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2025-03-03 13:53:24,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:53:24,211 INFO L256 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-03-03 13:53:24,214 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:53:24,369 INFO L134 CoverageAnalysis]: Checked inductivity of 1648 backedges. 44 proven. 1600 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 13:53:24,370 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:53:24,976 INFO L134 CoverageAnalysis]: Checked inductivity of 1648 backedges. 44 proven. 760 refuted. 0 times theorem prover too weak. 844 trivial. 0 not checked. [2025-03-03 13:53:24,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [64657785] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:53:24,976 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:53:24,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 24, 25] total 49 [2025-03-03 13:53:24,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474791125] [2025-03-03 13:53:24,976 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:53:24,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2025-03-03 13:53:24,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:53:24,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2025-03-03 13:53:24,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1065, Invalid=1287, Unknown=0, NotChecked=0, Total=2352 [2025-03-03 13:53:24,978 INFO L87 Difference]: Start difference. First operand 1121 states and 1516 transitions. Second operand has 49 states, 49 states have (on average 4.387755102040816) internal successors, (215), 49 states have internal predecessors, (215), 45 states have call successors, (70), 24 states have call predecessors, (70), 23 states have return successors, (69), 44 states have call predecessors, (69), 44 states have call successors, (69) [2025-03-03 13:53:26,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:53:26,709 INFO L93 Difference]: Finished difference Result 1766 states and 2359 transitions. [2025-03-03 13:53:26,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2025-03-03 13:53:26,711 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 4.387755102040816) internal successors, (215), 49 states have internal predecessors, (215), 45 states have call successors, (70), 24 states have call predecessors, (70), 23 states have return successors, (69), 44 states have call predecessors, (69), 44 states have call successors, (69) Word has length 189 [2025-03-03 13:53:26,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:53:26,716 INFO L225 Difference]: With dead ends: 1766 [2025-03-03 13:53:26,717 INFO L226 Difference]: Without dead ends: 1122 [2025-03-03 13:53:26,721 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 462 GetRequests, 355 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2064 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=3744, Invalid=8028, Unknown=0, NotChecked=0, Total=11772 [2025-03-03 13:53:26,722 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 1325 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 672 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1325 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 1161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 672 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 13:53:26,723 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1325 Valid, 569 Invalid, 1161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [672 Valid, 489 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 13:53:26,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1122 states. [2025-03-03 13:53:26,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1122 to 1013. [2025-03-03 13:53:26,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1013 states, 759 states have (on average 1.2015810276679841) internal successors, (912), 760 states have internal predecessors, (912), 208 states have call successors, (208), 46 states have call predecessors, (208), 45 states have return successors, (207), 206 states have call predecessors, (207), 207 states have call successors, (207) [2025-03-03 13:53:26,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1013 states to 1013 states and 1327 transitions. [2025-03-03 13:53:26,850 INFO L78 Accepts]: Start accepts. Automaton has 1013 states and 1327 transitions. Word has length 189 [2025-03-03 13:53:26,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:53:26,851 INFO L471 AbstractCegarLoop]: Abstraction has 1013 states and 1327 transitions. [2025-03-03 13:53:26,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 4.387755102040816) internal successors, (215), 49 states have internal predecessors, (215), 45 states have call successors, (70), 24 states have call predecessors, (70), 23 states have return successors, (69), 44 states have call predecessors, (69), 44 states have call successors, (69) [2025-03-03 13:53:26,851 INFO L276 IsEmpty]: Start isEmpty. Operand 1013 states and 1327 transitions. [2025-03-03 13:53:26,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-03-03 13:53:26,855 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:53:26,855 INFO L218 NwaCegarLoop]: trace histogram [23, 22, 22, 20, 20, 20, 20, 19, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:53:26,860 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:53:27,056 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,SelfDestructingSolverStorable14 [2025-03-03 13:53:27,056 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:53:27,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:53:27,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1181146969, now seen corresponding path program 3 times [2025-03-03 13:53:27,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:53:27,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950110925] [2025-03-03 13:53:27,056 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 13:53:27,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:53:27,062 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 195 statements into 23 equivalence classes. [2025-03-03 13:53:27,069 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 35 of 195 statements. [2025-03-03 13:53:27,069 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-03 13:53:27,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:53:27,154 INFO L134 CoverageAnalysis]: Checked inductivity of 1734 backedges. 108 proven. 1 refuted. 0 times theorem prover too weak. 1625 trivial. 0 not checked. [2025-03-03 13:53:27,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:53:27,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950110925] [2025-03-03 13:53:27,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950110925] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:53:27,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [794483105] [2025-03-03 13:53:27,155 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 13:53:27,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:53:27,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:53:27,157 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:53:27,159 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:53:27,196 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 195 statements into 23 equivalence classes. [2025-03-03 13:53:27,207 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 35 of 195 statements. [2025-03-03 13:53:27,207 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-03 13:53:27,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:53:27,209 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-03 13:53:27,211 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:53:36,053 INFO L134 CoverageAnalysis]: Checked inductivity of 1734 backedges. 111 proven. 1 refuted. 0 times theorem prover too weak. 1622 trivial. 0 not checked. [2025-03-03 13:53:36,053 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:53:40,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [794483105] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:53:40,156 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 13:53:40,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12] total 16 [2025-03-03 13:53:40,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399863801] [2025-03-03 13:53:40,156 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 13:53:40,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-03 13:53:40,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:53:40,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-03 13:53:40,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=253, Unknown=1, NotChecked=0, Total=306 [2025-03-03 13:53:40,157 INFO L87 Difference]: Start difference. First operand 1013 states and 1327 transitions. Second operand has 16 states, 16 states have (on average 2.8125) internal successors, (45), 13 states have internal predecessors, (45), 6 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-03 13:53:43,616 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.35s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-03 13:53:44,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:53:44,999 INFO L93 Difference]: Finished difference Result 2447 states and 3173 transitions. [2025-03-03 13:53:45,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 13:53:45,000 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.8125) internal successors, (45), 13 states have internal predecessors, (45), 6 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 195 [2025-03-03 13:53:45,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:53:45,007 INFO L225 Difference]: With dead ends: 2447 [2025-03-03 13:53:45,007 INFO L226 Difference]: Without dead ends: 1205 [2025-03-03 13:53:45,011 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=70, Invalid=309, Unknown=1, NotChecked=0, Total=380 [2025-03-03 13:53:45,011 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 64 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2025-03-03 13:53:45,012 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 367 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2025-03-03 13:53:45,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1205 states. [2025-03-03 13:53:45,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1205 to 879. [2025-03-03 13:53:45,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 879 states, 658 states have (on average 1.1732522796352585) internal successors, (772), 661 states have internal predecessors, (772), 174 states have call successors, (174), 47 states have call predecessors, (174), 46 states have return successors, (173), 170 states have call predecessors, (173), 173 states have call successors, (173) [2025-03-03 13:53:45,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 1119 transitions. [2025-03-03 13:53:45,127 INFO L78 Accepts]: Start accepts. Automaton has 879 states and 1119 transitions. Word has length 195 [2025-03-03 13:53:45,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:53:45,128 INFO L471 AbstractCegarLoop]: Abstraction has 879 states and 1119 transitions. [2025-03-03 13:53:45,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.8125) internal successors, (45), 13 states have internal predecessors, (45), 6 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-03 13:53:45,128 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 1119 transitions. [2025-03-03 13:53:45,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-03-03 13:53:45,130 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:53:45,130 INFO L218 NwaCegarLoop]: trace histogram [23, 22, 22, 19, 19, 19, 19, 18, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:53:45,136 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:53:45,330 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,SelfDestructingSolverStorable15 [2025-03-03 13:53:45,330 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:53:45,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:53:45,331 INFO L85 PathProgramCache]: Analyzing trace with hash -239440702, now seen corresponding path program 1 times [2025-03-03 13:53:45,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:53:45,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261157039] [2025-03-03 13:53:45,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:53:45,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:53:45,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-03-03 13:53:45,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-03-03 13:53:45,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:53:45,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:53:46,054 INFO L134 CoverageAnalysis]: Checked inductivity of 1662 backedges. 44 proven. 690 refuted. 0 times theorem prover too weak. 928 trivial. 0 not checked. [2025-03-03 13:53:46,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:53:46,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261157039] [2025-03-03 13:53:46,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261157039] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:53:46,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [300817748] [2025-03-03 13:53:46,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:53:46,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:53:46,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:53:46,057 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:53:46,059 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:53:46,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-03-03 13:53:46,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-03-03 13:53:46,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:53:46,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:53:46,132 INFO L256 TraceCheckSpWp]: Trace formula consists of 471 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-03-03 13:53:46,135 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:53:46,300 INFO L134 CoverageAnalysis]: Checked inductivity of 1662 backedges. 44 proven. 1614 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 13:53:46,300 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:53:46,952 INFO L134 CoverageAnalysis]: Checked inductivity of 1662 backedges. 44 proven. 690 refuted. 0 times theorem prover too weak. 928 trivial. 0 not checked. [2025-03-03 13:53:46,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [300817748] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:53:46,952 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:53:46,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 26] total 50 [2025-03-03 13:53:46,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143926087] [2025-03-03 13:53:46,952 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:53:46,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2025-03-03 13:53:46,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:53:46,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2025-03-03 13:53:46,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1133, Invalid=1317, Unknown=0, NotChecked=0, Total=2450 [2025-03-03 13:53:46,954 INFO L87 Difference]: Start difference. First operand 879 states and 1119 transitions. Second operand has 50 states, 50 states have (on average 4.4) internal successors, (220), 50 states have internal predecessors, (220), 47 states have call successors, (73), 25 states have call predecessors, (73), 24 states have return successors, (72), 46 states have call predecessors, (72), 46 states have call successors, (72) [2025-03-03 13:53:48,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:53:48,578 INFO L93 Difference]: Finished difference Result 928 states and 1185 transitions. [2025-03-03 13:53:48,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2025-03-03 13:53:48,579 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 4.4) internal successors, (220), 50 states have internal predecessors, (220), 47 states have call successors, (73), 25 states have call predecessors, (73), 24 states have return successors, (72), 46 states have call predecessors, (72), 46 states have call successors, (72) Word has length 195 [2025-03-03 13:53:48,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:53:48,585 INFO L225 Difference]: With dead ends: 928 [2025-03-03 13:53:48,585 INFO L226 Difference]: Without dead ends: 923 [2025-03-03 13:53:48,587 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 456 GetRequests, 366 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1159 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=3046, Invalid=5326, Unknown=0, NotChecked=0, Total=8372 [2025-03-03 13:53:48,588 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 1037 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 560 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1037 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 1022 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 560 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 13:53:48,588 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1037 Valid, 584 Invalid, 1022 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [560 Valid, 462 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 13:53:48,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2025-03-03 13:53:48,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 917. [2025-03-03 13:53:48,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 917 states, 686 states have (on average 1.1457725947521866) internal successors, (786), 691 states have internal predecessors, (786), 182 states have call successors, (182), 49 states have call predecessors, (182), 48 states have return successors, (181), 176 states have call predecessors, (181), 181 states have call successors, (181) [2025-03-03 13:53:48,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 917 states to 917 states and 1149 transitions. [2025-03-03 13:53:48,709 INFO L78 Accepts]: Start accepts. Automaton has 917 states and 1149 transitions. Word has length 195 [2025-03-03 13:53:48,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:53:48,709 INFO L471 AbstractCegarLoop]: Abstraction has 917 states and 1149 transitions. [2025-03-03 13:53:48,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 4.4) internal successors, (220), 50 states have internal predecessors, (220), 47 states have call successors, (73), 25 states have call predecessors, (73), 24 states have return successors, (72), 46 states have call predecessors, (72), 46 states have call successors, (72) [2025-03-03 13:53:48,710 INFO L276 IsEmpty]: Start isEmpty. Operand 917 states and 1149 transitions. [2025-03-03 13:53:48,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2025-03-03 13:53:48,713 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:53:48,714 INFO L218 NwaCegarLoop]: trace histogram [45, 44, 44, 44, 43, 43, 43, 43, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:53:48,720 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:53:48,918 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,SelfDestructingSolverStorable16 [2025-03-03 13:53:48,918 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:53:48,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:53:48,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1195497854, now seen corresponding path program 4 times [2025-03-03 13:53:48,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:53:48,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943492976] [2025-03-03 13:53:48,919 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 13:53:48,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:53:48,932 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 375 statements into 2 equivalence classes. [2025-03-03 13:53:49,039 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 375 of 375 statements. [2025-03-03 13:53:49,040 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 13:53:49,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:53:51,374 INFO L134 CoverageAnalysis]: Checked inductivity of 7576 backedges. 88 proven. 3700 refuted. 0 times theorem prover too weak. 3788 trivial. 0 not checked. [2025-03-03 13:53:51,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:53:51,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943492976] [2025-03-03 13:53:51,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943492976] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:53:51,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [958000485] [2025-03-03 13:53:51,374 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 13:53:51,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:53:51,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:53:51,376 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:53:51,378 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:53:51,424 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 375 statements into 2 equivalence classes. [2025-03-03 13:53:51,515 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 375 of 375 statements. [2025-03-03 13:53:51,516 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 13:53:51,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:53:51,520 INFO L256 TraceCheckSpWp]: Trace formula consists of 907 conjuncts, 91 conjuncts are in the unsatisfiable core [2025-03-03 13:53:51,524 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:53:51,826 INFO L134 CoverageAnalysis]: Checked inductivity of 7576 backedges. 90 proven. 7482 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 13:53:51,826 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:53:52,851 INFO L134 CoverageAnalysis]: Checked inductivity of 7576 backedges. 90 proven. 3698 refuted. 0 times theorem prover too weak. 3788 trivial. 0 not checked. [2025-03-03 13:53:52,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [958000485] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:53:52,851 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:53:52,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 47, 48] total 55 [2025-03-03 13:53:52,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782019031] [2025-03-03 13:53:52,851 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:53:52,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2025-03-03 13:53:52,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:53:52,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2025-03-03 13:53:52,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1333, Invalid=1637, Unknown=0, NotChecked=0, Total=2970 [2025-03-03 13:53:52,854 INFO L87 Difference]: Start difference. First operand 917 states and 1149 transitions. Second operand has 55 states, 55 states have (on average 5.6909090909090905) internal successors, (313), 55 states have internal predecessors, (313), 51 states have call successors, (101), 47 states have call predecessors, (101), 46 states have return successors, (100), 50 states have call predecessors, (100), 50 states have call successors, (100) [2025-03-03 13:53:55,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:53:55,346 INFO L93 Difference]: Finished difference Result 1129 states and 1432 transitions. [2025-03-03 13:53:55,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2025-03-03 13:53:55,346 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 5.6909090909090905) internal successors, (313), 55 states have internal predecessors, (313), 51 states have call successors, (101), 47 states have call predecessors, (101), 46 states have return successors, (100), 50 states have call predecessors, (100), 50 states have call successors, (100) Word has length 375 [2025-03-03 13:53:55,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:53:55,351 INFO L225 Difference]: With dead ends: 1129 [2025-03-03 13:53:55,351 INFO L226 Difference]: Without dead ends: 1065 [2025-03-03 13:53:55,354 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 890 GetRequests, 703 SyntacticMatches, 42 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5315 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=5984, Invalid=15478, Unknown=0, NotChecked=0, Total=21462 [2025-03-03 13:53:55,355 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 1207 mSDsluCounter, 594 mSDsCounter, 0 mSdLazyCounter, 570 mSolverCounterSat, 795 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1207 SdHoareTripleChecker+Valid, 629 SdHoareTripleChecker+Invalid, 1365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 795 IncrementalHoareTripleChecker+Valid, 570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 13:53:55,355 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1207 Valid, 629 Invalid, 1365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [795 Valid, 570 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 13:53:55,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1065 states. [2025-03-03 13:53:55,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1065 to 1046. [2025-03-03 13:53:55,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1046 states, 782 states have (on average 1.1534526854219949) internal successors, (902), 790 states have internal predecessors, (902), 208 states have call successors, (208), 56 states have call predecessors, (208), 55 states have return successors, (207), 199 states have call predecessors, (207), 207 states have call successors, (207) [2025-03-03 13:53:55,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1046 states to 1046 states and 1317 transitions. [2025-03-03 13:53:55,481 INFO L78 Accepts]: Start accepts. Automaton has 1046 states and 1317 transitions. Word has length 375 [2025-03-03 13:53:55,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:53:55,482 INFO L471 AbstractCegarLoop]: Abstraction has 1046 states and 1317 transitions. [2025-03-03 13:53:55,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 5.6909090909090905) internal successors, (313), 55 states have internal predecessors, (313), 51 states have call successors, (101), 47 states have call predecessors, (101), 46 states have return successors, (100), 50 states have call predecessors, (100), 50 states have call successors, (100) [2025-03-03 13:53:55,482 INFO L276 IsEmpty]: Start isEmpty. Operand 1046 states and 1317 transitions. [2025-03-03 13:53:55,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 390 [2025-03-03 13:53:55,487 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:53:55,487 INFO L218 NwaCegarLoop]: trace histogram [47, 46, 46, 45, 45, 45, 45, 44, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:53:55,494 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:53:55,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:53:55,688 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:53:55,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:53:55,689 INFO L85 PathProgramCache]: Analyzing trace with hash 1489275117, now seen corresponding path program 4 times [2025-03-03 13:53:55,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:53:55,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579062632] [2025-03-03 13:53:55,689 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 13:53:55,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:53:55,699 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 389 statements into 2 equivalence classes. [2025-03-03 13:53:55,790 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 389 of 389 statements. [2025-03-03 13:53:55,790 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 13:53:55,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:53:57,974 INFO L134 CoverageAnalysis]: Checked inductivity of 8198 backedges. 92 proven. 3962 refuted. 0 times theorem prover too weak. 4144 trivial. 0 not checked. [2025-03-03 13:53:57,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:53:57,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579062632] [2025-03-03 13:53:57,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579062632] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:53:57,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1023863976] [2025-03-03 13:53:57,974 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 13:53:57,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:53:57,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:53:57,976 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:53:57,977 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:53:58,021 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 389 statements into 2 equivalence classes. [2025-03-03 13:53:58,118 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 389 of 389 statements. [2025-03-03 13:53:58,119 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 13:53:58,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:53:58,123 INFO L256 TraceCheckSpWp]: Trace formula consists of 936 conjuncts, 95 conjuncts are in the unsatisfiable core [2025-03-03 13:53:58,127 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:53:58,479 INFO L134 CoverageAnalysis]: Checked inductivity of 8198 backedges. 94 proven. 8100 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 13:53:58,479 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:53:59,446 INFO L134 CoverageAnalysis]: Checked inductivity of 8198 backedges. 94 proven. 3960 refuted. 0 times theorem prover too weak. 4144 trivial. 0 not checked. [2025-03-03 13:53:59,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1023863976] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:53:59,446 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:53:59,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 49, 50] total 55 [2025-03-03 13:53:59,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23012615] [2025-03-03 13:53:59,447 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:53:59,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2025-03-03 13:53:59,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:53:59,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2025-03-03 13:53:59,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1333, Invalid=1637, Unknown=0, NotChecked=0, Total=2970 [2025-03-03 13:53:59,449 INFO L87 Difference]: Start difference. First operand 1046 states and 1317 transitions. Second operand has 55 states, 55 states have (on average 5.763636363636364) internal successors, (317), 55 states have internal predecessors, (317), 51 states have call successors, (103), 49 states have call predecessors, (103), 48 states have return successors, (102), 50 states have call predecessors, (102), 50 states have call successors, (102) [2025-03-03 13:54:02,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:54:02,084 INFO L93 Difference]: Finished difference Result 1157 states and 1459 transitions. [2025-03-03 13:54:02,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2025-03-03 13:54:02,084 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 5.763636363636364) internal successors, (317), 55 states have internal predecessors, (317), 51 states have call successors, (103), 49 states have call predecessors, (103), 48 states have return successors, (102), 50 states have call predecessors, (102), 50 states have call successors, (102) Word has length 389 [2025-03-03 13:54:02,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:54:02,089 INFO L225 Difference]: With dead ends: 1157 [2025-03-03 13:54:02,089 INFO L226 Difference]: Without dead ends: 1008 [2025-03-03 13:54:02,092 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 919 GetRequests, 729 SyntacticMatches, 45 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5409 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=5936, Invalid=15526, Unknown=0, NotChecked=0, Total=21462 [2025-03-03 13:54:02,093 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 1352 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 557 mSolverCounterSat, 955 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1352 SdHoareTripleChecker+Valid, 560 SdHoareTripleChecker+Invalid, 1512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 955 IncrementalHoareTripleChecker+Valid, 557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 13:54:02,093 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1352 Valid, 560 Invalid, 1512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [955 Valid, 557 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 13:54:02,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1008 states. [2025-03-03 13:54:02,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1008 to 1002. [2025-03-03 13:54:02,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1002 states, 751 states have (on average 1.1398135818908122) internal successors, (856), 753 states have internal predecessors, (856), 198 states have call successors, (198), 53 states have call predecessors, (198), 52 states have return successors, (197), 195 states have call predecessors, (197), 197 states have call successors, (197) [2025-03-03 13:54:02,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1002 states to 1002 states and 1251 transitions. [2025-03-03 13:54:02,241 INFO L78 Accepts]: Start accepts. Automaton has 1002 states and 1251 transitions. Word has length 389 [2025-03-03 13:54:02,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:54:02,243 INFO L471 AbstractCegarLoop]: Abstraction has 1002 states and 1251 transitions. [2025-03-03 13:54:02,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 5.763636363636364) internal successors, (317), 55 states have internal predecessors, (317), 51 states have call successors, (103), 49 states have call predecessors, (103), 48 states have return successors, (102), 50 states have call predecessors, (102), 50 states have call successors, (102) [2025-03-03 13:54:02,243 INFO L276 IsEmpty]: Start isEmpty. Operand 1002 states and 1251 transitions. [2025-03-03 13:54:02,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2025-03-03 13:54:02,248 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:54:02,248 INFO L218 NwaCegarLoop]: trace histogram [49, 48, 48, 45, 45, 45, 45, 44, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:54:02,256 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:54:02,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:54:02,449 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:54:02,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:54:02,449 INFO L85 PathProgramCache]: Analyzing trace with hash -2069587982, now seen corresponding path program 2 times [2025-03-03 13:54:02,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:54:02,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761974249] [2025-03-03 13:54:02,449 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:54:02,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:54:02,460 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 403 statements into 2 equivalence classes. [2025-03-03 13:54:02,520 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 403 of 403 statements. [2025-03-03 13:54:02,520 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:54:02,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:54:04,703 INFO L134 CoverageAnalysis]: Checked inductivity of 8578 backedges. 96 proven. 3966 refuted. 0 times theorem prover too weak. 4516 trivial. 0 not checked. [2025-03-03 13:54:04,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:54:04,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761974249] [2025-03-03 13:54:04,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761974249] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:54:04,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [639677500] [2025-03-03 13:54:04,704 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:54:04,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:54:04,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:54:04,706 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:54:04,706 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:54:04,755 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 403 statements into 2 equivalence classes. [2025-03-03 13:54:04,840 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 403 of 403 statements. [2025-03-03 13:54:04,840 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:54:04,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:54:04,845 INFO L256 TraceCheckSpWp]: Trace formula consists of 965 conjuncts, 99 conjuncts are in the unsatisfiable core [2025-03-03 13:54:04,850 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:54:05,144 INFO L134 CoverageAnalysis]: Checked inductivity of 8578 backedges. 96 proven. 8478 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 13:54:05,144 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:54:06,072 INFO L134 CoverageAnalysis]: Checked inductivity of 8578 backedges. 96 proven. 3966 refuted. 0 times theorem prover too weak. 4516 trivial. 0 not checked. [2025-03-03 13:54:06,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [639677500] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:54:06,073 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:54:06,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 51, 52] total 54 [2025-03-03 13:54:06,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530800392] [2025-03-03 13:54:06,073 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:54:06,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2025-03-03 13:54:06,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:54:06,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2025-03-03 13:54:06,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1331, Invalid=1531, Unknown=0, NotChecked=0, Total=2862 [2025-03-03 13:54:06,075 INFO L87 Difference]: Start difference. First operand 1002 states and 1251 transitions. Second operand has 54 states, 54 states have (on average 5.944444444444445) internal successors, (321), 54 states have internal predecessors, (321), 51 states have call successors, (106), 51 states have call predecessors, (106), 50 states have return successors, (105), 50 states have call predecessors, (105), 50 states have call successors, (105) [2025-03-03 13:54:07,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:54:07,787 INFO L93 Difference]: Finished difference Result 1009 states and 1258 transitions. [2025-03-03 13:54:07,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2025-03-03 13:54:07,788 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 5.944444444444445) internal successors, (321), 54 states have internal predecessors, (321), 51 states have call successors, (106), 51 states have call predecessors, (106), 50 states have return successors, (105), 50 states have call predecessors, (105), 50 states have call successors, (105) Word has length 403 [2025-03-03 13:54:07,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:54:07,792 INFO L225 Difference]: With dead ends: 1009 [2025-03-03 13:54:07,792 INFO L226 Difference]: Without dead ends: 1004 [2025-03-03 13:54:07,793 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 902 GetRequests, 756 SyntacticMatches, 48 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2308 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3634, Invalid=6266, Unknown=0, NotChecked=0, Total=9900 [2025-03-03 13:54:07,794 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 991 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 619 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 991 SdHoareTripleChecker+Valid, 600 SdHoareTripleChecker+Invalid, 1111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 619 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 13:54:07,794 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [991 Valid, 600 Invalid, 1111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [619 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 13:54:07,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1004 states. [2025-03-03 13:54:07,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1004 to 1004. [2025-03-03 13:54:07,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1004 states, 753 states have (on average 1.1381142098273573) internal successors, (857), 755 states have internal predecessors, (857), 198 states have call successors, (198), 53 states have call predecessors, (198), 52 states have return successors, (197), 195 states have call predecessors, (197), 197 states have call successors, (197) [2025-03-03 13:54:07,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1004 states to 1004 states and 1252 transitions. [2025-03-03 13:54:07,921 INFO L78 Accepts]: Start accepts. Automaton has 1004 states and 1252 transitions. Word has length 403 [2025-03-03 13:54:07,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:54:07,921 INFO L471 AbstractCegarLoop]: Abstraction has 1004 states and 1252 transitions. [2025-03-03 13:54:07,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 5.944444444444445) internal successors, (321), 54 states have internal predecessors, (321), 51 states have call successors, (106), 51 states have call predecessors, (106), 50 states have return successors, (105), 50 states have call predecessors, (105), 50 states have call successors, (105) [2025-03-03 13:54:07,922 INFO L276 IsEmpty]: Start isEmpty. Operand 1004 states and 1252 transitions. [2025-03-03 13:54:07,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 420 [2025-03-03 13:54:07,925 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:54:07,925 INFO L218 NwaCegarLoop]: trace histogram [51, 50, 50, 47, 47, 47, 47, 46, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:54:07,932 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-03-03 13:54:08,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:54:08,126 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:54:08,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:54:08,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1612229662, now seen corresponding path program 3 times [2025-03-03 13:54:08,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:54:08,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855941680] [2025-03-03 13:54:08,127 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 13:54:08,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:54:08,138 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 419 statements into 51 equivalence classes. [2025-03-03 13:54:08,270 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 51 check-sat command(s) and asserted 419 of 419 statements. [2025-03-03 13:54:08,270 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 51 check-sat command(s) [2025-03-03 13:54:08,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 13:54:08,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [187835547] [2025-03-03 13:54:08,273 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 13:54:08,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:54:08,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:54:08,275 INFO L229 MonitoredProcess]: Starting monitored process 18 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:54:08,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-03 13:54:08,322 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 419 statements into 51 equivalence classes. [2025-03-03 13:54:08,933 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 51 check-sat command(s) and asserted 419 of 419 statements. [2025-03-03 13:54:08,933 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 51 check-sat command(s) [2025-03-03 13:54:08,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 13:54:08,933 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 13:54:08,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 419 statements into 1 equivalence classes. [2025-03-03 13:54:09,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 419 of 419 statements. [2025-03-03 13:54:09,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:54:09,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 13:54:09,119 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 13:54:09,119 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 13:54:09,120 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 13:54:09,129 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2025-03-03 13:54:09,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:54:09,324 INFO L422 BasicCegarLoop]: Path program histogram: [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:54:09,391 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 13:54:09,393 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 01:54:09 BoogieIcfgContainer [2025-03-03 13:54:09,393 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 13:54:09,394 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 13:54:09,394 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 13:54:09,394 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 13:54:09,394 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 01:53:08" (3/4) ... [2025-03-03 13:54:09,395 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-03 13:54:09,491 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 311. [2025-03-03 13:54:09,667 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-03 13:54:09,667 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-03 13:54:09,667 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 13:54:09,668 INFO L158 Benchmark]: Toolchain (without parser) took 61136.13ms. Allocated memory is still 201.3MB. Free memory was 159.7MB in the beginning and 144.3MB in the end (delta: 15.4MB). Peak memory consumption was 496.1MB. Max. memory is 16.1GB. [2025-03-03 13:54:09,668 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 115.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 13:54:09,668 INFO L158 Benchmark]: CACSL2BoogieTranslator took 169.32ms. Allocated memory is still 201.3MB. Free memory was 159.7MB in the beginning and 148.4MB in the end (delta: 11.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 13:54:09,668 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.57ms. Allocated memory is still 201.3MB. Free memory was 148.4MB in the beginning and 147.3MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 13:54:09,668 INFO L158 Benchmark]: Boogie Preprocessor took 19.05ms. Allocated memory is still 201.3MB. Free memory was 147.3MB in the beginning and 146.2MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 13:54:09,669 INFO L158 Benchmark]: IcfgBuilder took 210.55ms. Allocated memory is still 201.3MB. Free memory was 146.2MB in the beginning and 133.4MB in the end (delta: 12.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 13:54:09,676 INFO L158 Benchmark]: TraceAbstraction took 60439.90ms. Allocated memory was 201.3MB in the beginning and 1.0GB in the end (delta: 805.3MB). Free memory was 133.0MB in the beginning and 486.2MB in the end (delta: -353.2MB). Peak memory consumption was 452.0MB. Max. memory is 16.1GB. [2025-03-03 13:54:09,677 INFO L158 Benchmark]: Witness Printer took 273.47ms. Allocated memory was 1.0GB in the beginning and 201.3MB in the end (delta: -805.3MB). Free memory was 486.2MB in the beginning and 144.3MB in the end (delta: 341.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2025-03-03 13:54:09,678 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.19ms. Allocated memory is still 201.3MB. Free memory is still 115.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 169.32ms. Allocated memory is still 201.3MB. Free memory was 159.7MB in the beginning and 148.4MB in the end (delta: 11.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 19.57ms. Allocated memory is still 201.3MB. Free memory was 148.4MB in the beginning and 147.3MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 19.05ms. Allocated memory is still 201.3MB. Free memory was 147.3MB in the beginning and 146.2MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 210.55ms. Allocated memory is still 201.3MB. Free memory was 146.2MB in the beginning and 133.4MB in the end (delta: 12.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 60439.90ms. Allocated memory was 201.3MB in the beginning and 1.0GB in the end (delta: 805.3MB). Free memory was 133.0MB in the beginning and 486.2MB in the end (delta: -353.2MB). Peak memory consumption was 452.0MB. Max. memory is 16.1GB. * Witness Printer took 273.47ms. Allocated memory was 1.0GB in the beginning and 201.3MB in the end (delta: -805.3MB). Free memory was 486.2MB in the beginning and 144.3MB in the end (delta: 341.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 14]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L19] int counter = 0; VAL [counter=0] [L21] int A, R; [L22] long long u, v, r; [L23] A = __VERIFIER_nondet_int() [L24] R = __VERIFIER_nondet_int() [L25] CALL assume_abort_if_not((((long long) R - 1) * ((long long) R - 1)) < A) VAL [\old(cond)=1, counter=0] [L9] COND FALSE !(!cond) VAL [\old(cond)=1, counter=0] [L25] RET assume_abort_if_not((((long long) R - 1) * ((long long) R - 1)) < A) VAL [A=1028199, R=1015, counter=0] [L27] CALL assume_abort_if_not(A % 2 == 1) VAL [\old(cond)=1, counter=0] [L9] COND FALSE !(!cond) VAL [\old(cond)=1, counter=0] [L27] RET assume_abort_if_not(A % 2 == 1) VAL [A=1028199, R=1015, counter=0] [L29] u = ((long long) 2 * R) + 1 [L30] v = 1 [L31] r = ((long long) R * R) - A VAL [A=1028199, counter=0, r=2026, u=2031, v=1] [L34] COND TRUE counter++<50 [L34] EXPR counter++ VAL [A=1028199, counter=1, r=2026, u=2031, v=1] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=1] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=1] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1028199, counter=1, r=2026, u=2031, v=1] [L36] COND FALSE !(!(r != 0)) VAL [A=1028199, counter=1, r=2026, u=2031, v=1] [L39] COND TRUE counter++<50 [L39] EXPR counter++ VAL [A=1028199, counter=2, r=2026, u=2031, v=1] [L39] COND TRUE counter++<50 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=2] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=2] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1028199, counter=2, r=2026, u=2031, v=1] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [A=1028199, counter=2, r=2025, u=2031, v=3] [L39] COND TRUE counter++<50 [L39] EXPR counter++ VAL [A=1028199, counter=3, r=2025, u=2031, v=3] [L39] COND TRUE counter++<50 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=3] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=3] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1028199, counter=3, r=2025, u=2031, v=3] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [A=1028199, counter=3, r=2022, u=2031, v=5] [L39] COND TRUE counter++<50 [L39] EXPR counter++ VAL [A=1028199, counter=4, r=2022, u=2031, v=5] [L39] COND TRUE counter++<50 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=4] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=4] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1028199, counter=4, r=2022, u=2031, v=5] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [A=1028199, counter=4, r=2017, u=2031, v=7] [L39] COND TRUE counter++<50 [L39] EXPR counter++ VAL [A=1028199, counter=5, r=2017, u=2031, v=7] [L39] COND TRUE counter++<50 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=5] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=5] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1028199, counter=5, r=2017, u=2031, v=7] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [A=1028199, counter=5, r=2010, u=2031, v=9] [L39] COND TRUE counter++<50 [L39] EXPR counter++ VAL [A=1028199, counter=6, r=2010, u=2031, v=9] [L39] COND TRUE counter++<50 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=6] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=6] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1028199, counter=6, r=2010, u=2031, v=9] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [A=1028199, counter=6, r=2001, u=2031, v=11] [L39] COND TRUE counter++<50 [L39] EXPR counter++ VAL [A=1028199, counter=7, r=2001, u=2031, v=11] [L39] COND TRUE counter++<50 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=7] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=7] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1028199, counter=7, r=2001, u=2031, v=11] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [A=1028199, counter=7, r=1990, u=2031, v=13] [L39] COND TRUE counter++<50 [L39] EXPR counter++ VAL [A=1028199, counter=8, r=1990, u=2031, v=13] [L39] COND TRUE counter++<50 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=8] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=8] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1028199, counter=8, r=1990, u=2031, v=13] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [A=1028199, counter=8, r=1977, u=2031, v=15] [L39] COND TRUE counter++<50 [L39] EXPR counter++ VAL [A=1028199, counter=9, r=1977, u=2031, v=15] [L39] COND TRUE counter++<50 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=9] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=9] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1028199, counter=9, r=1977, u=2031, v=15] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [A=1028199, counter=9, r=1962, u=2031, v=17] [L39] COND TRUE counter++<50 [L39] EXPR counter++ VAL [A=1028199, counter=10, r=1962, u=2031, v=17] [L39] COND TRUE counter++<50 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=10] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=10] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1028199, counter=10, r=1962, u=2031, v=17] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [A=1028199, counter=10, r=1945, u=2031, v=19] [L39] COND TRUE counter++<50 [L39] EXPR counter++ VAL [A=1028199, counter=11, r=1945, u=2031, v=19] [L39] COND TRUE counter++<50 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=11] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=11] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1028199, counter=11, r=1945, u=2031, v=19] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [A=1028199, counter=11, r=1926, u=2031, v=21] [L39] COND TRUE counter++<50 [L39] EXPR counter++ VAL [A=1028199, counter=12, r=1926, u=2031, v=21] [L39] COND TRUE counter++<50 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=12] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=12] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1028199, counter=12, r=1926, u=2031, v=21] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [A=1028199, counter=12, r=1905, u=2031, v=23] [L39] COND TRUE counter++<50 [L39] EXPR counter++ VAL [A=1028199, counter=13, r=1905, u=2031, v=23] [L39] COND TRUE counter++<50 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=13] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=13] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1028199, counter=13, r=1905, u=2031, v=23] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [A=1028199, counter=13, r=1882, u=2031, v=25] [L39] COND TRUE counter++<50 [L39] EXPR counter++ VAL [A=1028199, counter=14, r=1882, u=2031, v=25] [L39] COND TRUE counter++<50 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=14] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=14] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1028199, counter=14, r=1882, u=2031, v=25] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [A=1028199, counter=14, r=1857, u=2031, v=27] [L39] COND TRUE counter++<50 [L39] EXPR counter++ VAL [A=1028199, counter=15, r=1857, u=2031, v=27] [L39] COND TRUE counter++<50 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=15] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=15] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1028199, counter=15, r=1857, u=2031, v=27] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [A=1028199, counter=15, r=1830, u=2031, v=29] [L39] COND TRUE counter++<50 [L39] EXPR counter++ VAL [A=1028199, counter=16, r=1830, u=2031, v=29] [L39] COND TRUE counter++<50 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=16] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=16] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1028199, counter=16, r=1830, u=2031, v=29] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [A=1028199, counter=16, r=1801, u=2031, v=31] [L39] COND TRUE counter++<50 [L39] EXPR counter++ VAL [A=1028199, counter=17, r=1801, u=2031, v=31] [L39] COND TRUE counter++<50 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=17] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=17] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1028199, counter=17, r=1801, u=2031, v=31] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [A=1028199, counter=17, r=1770, u=2031, v=33] [L39] COND TRUE counter++<50 [L39] EXPR counter++ VAL [A=1028199, counter=18, r=1770, u=2031, v=33] [L39] COND TRUE counter++<50 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=18] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=18] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1028199, counter=18, r=1770, u=2031, v=33] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [A=1028199, counter=18, r=1737, u=2031, v=35] [L39] COND TRUE counter++<50 [L39] EXPR counter++ VAL [A=1028199, counter=19, r=1737, u=2031, v=35] [L39] COND TRUE counter++<50 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=19] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=19] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1028199, counter=19, r=1737, u=2031, v=35] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [A=1028199, counter=19, r=1702, u=2031, v=37] [L39] COND TRUE counter++<50 [L39] EXPR counter++ VAL [A=1028199, counter=20, r=1702, u=2031, v=37] [L39] COND TRUE counter++<50 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=20] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=20] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1028199, counter=20, r=1702, u=2031, v=37] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [A=1028199, counter=20, r=1665, u=2031, v=39] [L39] COND TRUE counter++<50 [L39] EXPR counter++ VAL [A=1028199, counter=21, r=1665, u=2031, v=39] [L39] COND TRUE counter++<50 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=21] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=21] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1028199, counter=21, r=1665, u=2031, v=39] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [A=1028199, counter=21, r=1626, u=2031, v=41] [L39] COND TRUE counter++<50 [L39] EXPR counter++ VAL [A=1028199, counter=22, r=1626, u=2031, v=41] [L39] COND TRUE counter++<50 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=22] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=22] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1028199, counter=22, r=1626, u=2031, v=41] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [A=1028199, counter=22, r=1585, u=2031, v=43] [L39] COND TRUE counter++<50 [L39] EXPR counter++ VAL [A=1028199, counter=23, r=1585, u=2031, v=43] [L39] COND TRUE counter++<50 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=23] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=23] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1028199, counter=23, r=1585, u=2031, v=43] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [A=1028199, counter=23, r=1542, u=2031, v=45] [L39] COND TRUE counter++<50 [L39] EXPR counter++ VAL [A=1028199, counter=24, r=1542, u=2031, v=45] [L39] COND TRUE counter++<50 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=24] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=24] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1028199, counter=24, r=1542, u=2031, v=45] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [A=1028199, counter=24, r=1497, u=2031, v=47] [L39] COND TRUE counter++<50 [L39] EXPR counter++ VAL [A=1028199, counter=25, r=1497, u=2031, v=47] [L39] COND TRUE counter++<50 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=25] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=25] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1028199, counter=25, r=1497, u=2031, v=47] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [A=1028199, counter=25, r=1450, u=2031, v=49] [L39] COND TRUE counter++<50 [L39] EXPR counter++ VAL [A=1028199, counter=26, r=1450, u=2031, v=49] [L39] COND TRUE counter++<50 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=26] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=26] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1028199, counter=26, r=1450, u=2031, v=49] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [A=1028199, counter=26, r=1401, u=2031, v=51] [L39] COND TRUE counter++<50 [L39] EXPR counter++ VAL [A=1028199, counter=27, r=1401, u=2031, v=51] [L39] COND TRUE counter++<50 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=27] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=27] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1028199, counter=27, r=1401, u=2031, v=51] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [A=1028199, counter=27, r=1350, u=2031, v=53] [L39] COND TRUE counter++<50 [L39] EXPR counter++ VAL [A=1028199, counter=28, r=1350, u=2031, v=53] [L39] COND TRUE counter++<50 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=28] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=28] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1028199, counter=28, r=1350, u=2031, v=53] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [A=1028199, counter=28, r=1297, u=2031, v=55] [L39] COND TRUE counter++<50 [L39] EXPR counter++ VAL [A=1028199, counter=29, r=1297, u=2031, v=55] [L39] COND TRUE counter++<50 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=29] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=29] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1028199, counter=29, r=1297, u=2031, v=55] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [A=1028199, counter=29, r=1242, u=2031, v=57] [L39] COND TRUE counter++<50 [L39] EXPR counter++ VAL [A=1028199, counter=30, r=1242, u=2031, v=57] [L39] COND TRUE counter++<50 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=30] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=30] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1028199, counter=30, r=1242, u=2031, v=57] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [A=1028199, counter=30, r=1185, u=2031, v=59] [L39] COND TRUE counter++<50 [L39] EXPR counter++ VAL [A=1028199, counter=31, r=1185, u=2031, v=59] [L39] COND TRUE counter++<50 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=31] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=31] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1028199, counter=31, r=1185, u=2031, v=59] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [A=1028199, counter=31, r=1126, u=2031, v=61] [L39] COND TRUE counter++<50 [L39] EXPR counter++ VAL [A=1028199, counter=32, r=1126, u=2031, v=61] [L39] COND TRUE counter++<50 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=32] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=32] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1028199, counter=32, r=1126, u=2031, v=61] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [A=1028199, counter=32, r=1065, u=2031, v=63] [L39] COND TRUE counter++<50 [L39] EXPR counter++ VAL [A=1028199, counter=33, r=1065, u=2031, v=63] [L39] COND TRUE counter++<50 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=33] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=33] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1028199, counter=33, r=1065, u=2031, v=63] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [A=1028199, counter=33, r=1002, u=2031, v=65] [L39] COND TRUE counter++<50 [L39] EXPR counter++ VAL [A=1028199, counter=34, r=1002, u=2031, v=65] [L39] COND TRUE counter++<50 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=34] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=34] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1028199, counter=34, r=1002, u=2031, v=65] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [A=1028199, counter=34, r=937, u=2031, v=67] [L39] COND TRUE counter++<50 [L39] EXPR counter++ VAL [A=1028199, counter=35, r=937, u=2031, v=67] [L39] COND TRUE counter++<50 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=35] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=35] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1028199, counter=35, r=937, u=2031, v=67] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [A=1028199, counter=35, r=870, u=2031, v=69] [L39] COND TRUE counter++<50 [L39] EXPR counter++ VAL [A=1028199, counter=36, r=870, u=2031, v=69] [L39] COND TRUE counter++<50 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=36] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=36] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1028199, counter=36, r=870, u=2031, v=69] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [A=1028199, counter=36, r=801, u=2031, v=71] [L39] COND TRUE counter++<50 [L39] EXPR counter++ VAL [A=1028199, counter=37, r=801, u=2031, v=71] [L39] COND TRUE counter++<50 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=37] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=37] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1028199, counter=37, r=801, u=2031, v=71] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [A=1028199, counter=37, r=730, u=2031, v=73] [L39] COND TRUE counter++<50 [L39] EXPR counter++ VAL [A=1028199, counter=38, r=730, u=2031, v=73] [L39] COND TRUE counter++<50 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=38] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=38] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1028199, counter=38, r=730, u=2031, v=73] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [A=1028199, counter=38, r=657, u=2031, v=75] [L39] COND TRUE counter++<50 [L39] EXPR counter++ VAL [A=1028199, counter=39, r=657, u=2031, v=75] [L39] COND TRUE counter++<50 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=39] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=39] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1028199, counter=39, r=657, u=2031, v=75] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [A=1028199, counter=39, r=582, u=2031, v=77] [L39] COND TRUE counter++<50 [L39] EXPR counter++ VAL [A=1028199, counter=40, r=582, u=2031, v=77] [L39] COND TRUE counter++<50 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=40] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=40] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1028199, counter=40, r=582, u=2031, v=77] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [A=1028199, counter=40, r=505, u=2031, v=79] [L39] COND TRUE counter++<50 [L39] EXPR counter++ VAL [A=1028199, counter=41, r=505, u=2031, v=79] [L39] COND TRUE counter++<50 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=41] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=41] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1028199, counter=41, r=505, u=2031, v=79] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [A=1028199, counter=41, r=426, u=2031, v=81] [L39] COND TRUE counter++<50 [L39] EXPR counter++ VAL [A=1028199, counter=42, r=426, u=2031, v=81] [L39] COND TRUE counter++<50 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=42] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=42] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1028199, counter=42, r=426, u=2031, v=81] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [A=1028199, counter=42, r=345, u=2031, v=83] [L39] COND TRUE counter++<50 [L39] EXPR counter++ VAL [A=1028199, counter=43, r=345, u=2031, v=83] [L39] COND TRUE counter++<50 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=43] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=43] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1028199, counter=43, r=345, u=2031, v=83] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [A=1028199, counter=43, r=262, u=2031, v=85] [L39] COND TRUE counter++<50 [L39] EXPR counter++ VAL [A=1028199, counter=44, r=262, u=2031, v=85] [L39] COND TRUE counter++<50 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=44] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=44] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1028199, counter=44, r=262, u=2031, v=85] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [A=1028199, counter=44, r=177, u=2031, v=87] [L39] COND TRUE counter++<50 [L39] EXPR counter++ VAL [A=1028199, counter=45, r=177, u=2031, v=87] [L39] COND TRUE counter++<50 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=45] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=45] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1028199, counter=45, r=177, u=2031, v=87] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [A=1028199, counter=45, r=90, u=2031, v=89] [L39] COND TRUE counter++<50 [L39] EXPR counter++ VAL [A=1028199, counter=46, r=90, u=2031, v=89] [L39] COND TRUE counter++<50 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=46] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=46] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1028199, counter=46, r=90, u=2031, v=89] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [A=1028199, counter=46, r=1, u=2031, v=91] [L39] COND TRUE counter++<50 [L39] EXPR counter++ VAL [A=1028199, counter=47, r=1, u=2031, v=91] [L39] COND TRUE counter++<50 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=47] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=47] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1028199, counter=47, r=1, u=2031, v=91] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [A=1028199, counter=47, r=-90, u=2031, v=93] [L39] COND TRUE counter++<50 [L39] EXPR counter++ VAL [A=1028199, counter=48, r=-90, u=2031, v=93] [L39] COND TRUE counter++<50 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=48] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=48] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1028199, counter=48, r=-90, u=2031, v=93] [L41] COND TRUE !(r > 0) VAL [A=1028199, counter=48, r=-90, u=2031, v=93] [L47] COND TRUE counter++<50 [L47] EXPR counter++ VAL [A=1028199, counter=49, r=-90, u=2031, v=93] [L47] COND TRUE counter++<50 [L48] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=49] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=49] [L48] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1028199, counter=49, r=-90, u=2031, v=93] [L49] COND FALSE !(!(r < 0)) [L51] r = r + u [L52] u = u + 2 VAL [A=1028199, counter=49, r=1941, u=2033, v=93] [L47] COND TRUE counter++<50 [L47] EXPR counter++ VAL [A=1028199, counter=50, r=1941, u=2033, v=93] [L47] COND TRUE counter++<50 [L48] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=50] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=50] [L48] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1028199, counter=50, r=1941, u=2033, v=93] [L49] COND TRUE !(r < 0) VAL [A=1028199, counter=50, r=1941, u=2033, v=93] [L34] COND TRUE counter++<50 [L34] EXPR counter++ VAL [A=1028199, counter=51, r=1941, u=2033, v=93] [L34] COND FALSE !(counter++<50) [L56] CALL __VERIFIER_assert(((long long) 4*A) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=0, counter=51] [L12] COND TRUE !(cond) VAL [\old(cond)=0, counter=51] [L14] reach_error() VAL [\old(cond)=0, counter=51] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 32 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 60.3s, OverallIterations: 21, TraceHistogramMax: 51, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 21.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8635 SdHoareTripleChecker+Valid, 11.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8623 mSDsluCounter, 6043 SdHoareTripleChecker+Invalid, 10.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5380 mSDsCounter, 4701 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4266 IncrementalHoareTripleChecker+Invalid, 8967 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4701 mSolverCounterUnsat, 663 mSDtfsCounter, 4266 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5328 GetRequests, 4316 SyntacticMatches, 137 SemanticMatches, 875 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18029 ImplicationChecksByTransitivity, 18.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1121occurred in iteration=14, InterpolantAutomatonStates: 887, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.3s AutomataMinimizationTime, 20 MinimizatonAttempts, 735 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 2.4s SatisfiabilityAnalysisTime, 31.0s InterpolantComputationTime, 5778 NumberOfCodeBlocks, 5458 NumberOfCodeBlocksAsserted, 236 NumberOfCheckSat, 7046 ConstructedInterpolants, 0 QuantifiedInterpolants, 16644 SizeOfPredicates, 241 NumberOfNonLiveVariables, 5544 ConjunctsInSsa, 548 ConjunctsInUnsatCore, 48 InterpolantComputations, 6 PerfectInterpolantSequences, 36023/93866 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:54:09,708 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