./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-34.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-34.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 125f40803e1b985402482e09336346a774ad0c00eff4ec5b89ac9ebb2ee5c085 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 13:53:16,391 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 13:53:16,443 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 13:53:16,449 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 13:53:16,450 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 13:53:16,473 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 13:53:16,474 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 13:53:16,474 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 13:53:16,474 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 13:53:16,474 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 13:53:16,474 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 13:53:16,474 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 13:53:16,475 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 13:53:16,475 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 13:53:16,475 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 13:53:16,475 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 13:53:16,475 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 13:53:16,475 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 13:53:16,475 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 13:53:16,475 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 13:53:16,475 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 13:53:16,475 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 13:53:16,475 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 13:53:16,475 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 13:53:16,475 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 13:53:16,475 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 13:53:16,475 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 13:53:16,475 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 13:53:16,475 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 13:53:16,476 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:53:16,476 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:53:16,476 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:53:16,476 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:53:16,476 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 13:53:16,476 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:53:16,476 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:53:16,476 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:53:16,476 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:53:16,476 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 13:53:16,476 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 13:53:16,476 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 13:53:16,476 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 13:53:16,476 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 13:53:16,476 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 13:53:16,476 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 13:53:16,476 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 13:53:16,478 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 13:53:16,478 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 13:53:16,479 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-jdk21/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 -> 125f40803e1b985402482e09336346a774ad0c00eff4ec5b89ac9ebb2ee5c085 [2025-01-09 13:53:16,709 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 13:53:16,718 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 13:53:16,719 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 13:53:16,720 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 13:53:16,720 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 13:53:16,721 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-34.i [2025-01-09 13:53:17,854 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/43c63c699/07783b2b32904bdf86e2bdc33809979e/FLAGe7c8a5fa2 [2025-01-09 13:53:18,082 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 13:53:18,082 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-34.i [2025-01-09 13:53:18,117 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/43c63c699/07783b2b32904bdf86e2bdc33809979e/FLAGe7c8a5fa2 [2025-01-09 13:53:18,425 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/43c63c699/07783b2b32904bdf86e2bdc33809979e [2025-01-09 13:53:18,427 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 13:53:18,428 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 13:53:18,429 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 13:53:18,429 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 13:53:18,432 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 13:53:18,432 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:53:18" (1/1) ... [2025-01-09 13:53:18,433 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ec176d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:53:18, skipping insertion in model container [2025-01-09 13:53:18,433 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:53:18" (1/1) ... [2025-01-09 13:53:18,448 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 13:53:18,547 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-34.i[915,928] [2025-01-09 13:53:18,597 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:53:18,609 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 13:53:18,619 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-34.i[915,928] [2025-01-09 13:53:18,647 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:53:18,664 INFO L204 MainTranslator]: Completed translation [2025-01-09 13:53:18,666 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:53:18 WrapperNode [2025-01-09 13:53:18,666 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 13:53:18,667 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 13:53:18,668 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 13:53:18,668 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 13:53:18,672 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:53:18" (1/1) ... [2025-01-09 13:53:18,679 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:53:18" (1/1) ... [2025-01-09 13:53:18,710 INFO L138 Inliner]: procedures = 26, calls = 26, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 173 [2025-01-09 13:53:18,711 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 13:53:18,711 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 13:53:18,711 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 13:53:18,712 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 13:53:18,720 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:53:18" (1/1) ... [2025-01-09 13:53:18,720 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:53:18" (1/1) ... [2025-01-09 13:53:18,722 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:53:18" (1/1) ... [2025-01-09 13:53:18,739 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-01-09 13:53:18,744 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:53:18" (1/1) ... [2025-01-09 13:53:18,744 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:53:18" (1/1) ... [2025-01-09 13:53:18,753 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:53:18" (1/1) ... [2025-01-09 13:53:18,754 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:53:18" (1/1) ... [2025-01-09 13:53:18,759 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:53:18" (1/1) ... [2025-01-09 13:53:18,764 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:53:18" (1/1) ... [2025-01-09 13:53:18,765 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:53:18" (1/1) ... [2025-01-09 13:53:18,766 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 13:53:18,770 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 13:53:18,771 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 13:53:18,771 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 13:53:18,772 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:53:18" (1/1) ... [2025-01-09 13:53:18,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:53:18,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:53:18,799 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 13:53:18,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 13:53:18,823 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 13:53:18,823 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 13:53:18,823 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 13:53:18,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 13:53:18,824 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 13:53:18,824 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 13:53:18,883 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 13:53:18,884 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 13:53:19,182 INFO L? ?]: Removed 30 outVars from TransFormulas that were not future-live. [2025-01-09 13:53:19,182 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 13:53:19,192 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 13:53:19,193 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 13:53:19,193 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:53:19 BoogieIcfgContainer [2025-01-09 13:53:19,193 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 13:53:19,195 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 13:53:19,195 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 13:53:19,198 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 13:53:19,198 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 01:53:18" (1/3) ... [2025-01-09 13:53:19,199 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@198e8c2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:53:19, skipping insertion in model container [2025-01-09 13:53:19,199 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:53:18" (2/3) ... [2025-01-09 13:53:19,199 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@198e8c2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:53:19, skipping insertion in model container [2025-01-09 13:53:19,199 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:53:19" (3/3) ... [2025-01-09 13:53:19,203 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-while_file-34.i [2025-01-09 13:53:19,217 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 13:53:19,219 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_50-while_file-34.i that has 2 procedures, 70 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 13:53:19,260 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 13:53:19,268 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;@7461d3d0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 13:53:19,268 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 13:53:19,271 INFO L276 IsEmpty]: Start isEmpty. Operand has 70 states, 54 states have (on average 1.4814814814814814) internal successors, (80), 55 states have internal predecessors, (80), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-01-09 13:53:19,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-01-09 13:53:19,277 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:53:19,277 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 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, 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, 1, 1, 1, 1, 1] [2025-01-09 13:53:19,277 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:53:19,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:53:19,281 INFO L85 PathProgramCache]: Analyzing trace with hash 111534171, now seen corresponding path program 1 times [2025-01-09 13:53:19,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:53:19,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987922104] [2025-01-09 13:53:19,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:53:19,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:53:19,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-09 13:53:19,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-09 13:53:19,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:53:19,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:53:19,507 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2025-01-09 13:53:19,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:53:19,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987922104] [2025-01-09 13:53:19,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987922104] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 13:53:19,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1823264693] [2025-01-09 13:53:19,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:53:19,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:53:19,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:53:19,511 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 13:53:19,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 13:53:19,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-09 13:53:19,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-09 13:53:19,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:53:19,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:53:19,618 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 13:53:19,622 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:53:19,641 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2025-01-09 13:53:19,641 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 13:53:19,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1823264693] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:53:19,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 13:53:19,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 13:53:19,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366017706] [2025-01-09 13:53:19,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:53:19,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 13:53:19,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:53:19,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 13:53:19,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 13:53:19,660 INFO L87 Difference]: Start difference. First operand has 70 states, 54 states have (on average 1.4814814814814814) internal successors, (80), 55 states have internal predecessors, (80), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 13:53:19,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:53:19,679 INFO L93 Difference]: Finished difference Result 134 states and 220 transitions. [2025-01-09 13:53:19,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 13:53:19,681 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) Word has length 94 [2025-01-09 13:53:19,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:53:19,686 INFO L225 Difference]: With dead ends: 134 [2025-01-09 13:53:19,686 INFO L226 Difference]: Without dead ends: 67 [2025-01-09 13:53:19,689 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 95 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-01-09 13:53:19,690 INFO L435 NwaCegarLoop]: 101 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, 101 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-01-09 13:53:19,691 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 13:53:19,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-01-09 13:53:19,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2025-01-09 13:53:19,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 52 states have (on average 1.4423076923076923) internal successors, (75), 52 states have internal predecessors, (75), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-01-09 13:53:19,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 101 transitions. [2025-01-09 13:53:19,721 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 101 transitions. Word has length 94 [2025-01-09 13:53:19,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:53:19,722 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 101 transitions. [2025-01-09 13:53:19,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 13:53:19,722 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 101 transitions. [2025-01-09 13:53:19,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-01-09 13:53:19,724 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:53:19,724 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 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, 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, 1, 1, 1, 1, 1] [2025-01-09 13:53:19,732 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 13:53:19,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 13:53:19,925 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:53:19,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:53:19,926 INFO L85 PathProgramCache]: Analyzing trace with hash -16196899, now seen corresponding path program 1 times [2025-01-09 13:53:19,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:53:19,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160945908] [2025-01-09 13:53:19,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:53:19,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:53:19,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-09 13:53:20,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-09 13:53:20,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:53:20,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:53:20,346 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-01-09 13:53:20,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:53:20,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160945908] [2025-01-09 13:53:20,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160945908] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:53:20,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:53:20,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 13:53:20,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106096221] [2025-01-09 13:53:20,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:53:20,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 13:53:20,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:53:20,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 13:53:20,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 13:53:20,349 INFO L87 Difference]: Start difference. First operand 67 states and 101 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-01-09 13:53:20,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:53:20,470 INFO L93 Difference]: Finished difference Result 225 states and 342 transitions. [2025-01-09 13:53:20,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 13:53:20,471 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 94 [2025-01-09 13:53:20,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:53:20,473 INFO L225 Difference]: With dead ends: 225 [2025-01-09 13:53:20,473 INFO L226 Difference]: Without dead ends: 161 [2025-01-09 13:53:20,473 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 13:53:20,474 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 129 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 13:53:20,474 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 321 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 13:53:20,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2025-01-09 13:53:20,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 131. [2025-01-09 13:53:20,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 102 states have (on average 1.4411764705882353) internal successors, (147), 102 states have internal predecessors, (147), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-01-09 13:53:20,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 199 transitions. [2025-01-09 13:53:20,502 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 199 transitions. Word has length 94 [2025-01-09 13:53:20,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:53:20,502 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 199 transitions. [2025-01-09 13:53:20,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-01-09 13:53:20,502 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 199 transitions. [2025-01-09 13:53:20,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-01-09 13:53:20,504 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:53:20,504 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 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, 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, 1, 1, 1, 1, 1, 1] [2025-01-09 13:53:20,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 13:53:20,505 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:53:20,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:53:20,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1221993140, now seen corresponding path program 1 times [2025-01-09 13:53:20,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:53:20,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862964142] [2025-01-09 13:53:20,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:53:20,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:53:20,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-01-09 13:53:20,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-01-09 13:53:20,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:53:20,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:53:20,777 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-01-09 13:53:20,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:53:20,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862964142] [2025-01-09 13:53:20,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862964142] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:53:20,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:53:20,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 13:53:20,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972420996] [2025-01-09 13:53:20,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:53:20,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 13:53:20,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:53:20,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 13:53:20,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 13:53:20,783 INFO L87 Difference]: Start difference. First operand 131 states and 199 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-01-09 13:53:20,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:53:20,939 INFO L93 Difference]: Finished difference Result 382 states and 580 transitions. [2025-01-09 13:53:20,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 13:53:20,939 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 95 [2025-01-09 13:53:20,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:53:20,942 INFO L225 Difference]: With dead ends: 382 [2025-01-09 13:53:20,944 INFO L226 Difference]: Without dead ends: 254 [2025-01-09 13:53:20,945 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 13:53:20,946 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 158 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 13:53:20,947 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 305 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 13:53:20,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2025-01-09 13:53:20,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 135. [2025-01-09 13:53:20,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 106 states have (on average 1.4245283018867925) internal successors, (151), 106 states have internal predecessors, (151), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-01-09 13:53:20,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 203 transitions. [2025-01-09 13:53:20,969 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 203 transitions. Word has length 95 [2025-01-09 13:53:20,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:53:20,969 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 203 transitions. [2025-01-09 13:53:20,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-01-09 13:53:20,969 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 203 transitions. [2025-01-09 13:53:20,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-01-09 13:53:20,973 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:53:20,973 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 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, 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, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:53:20,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 13:53:20,973 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:53:20,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:53:20,973 INFO L85 PathProgramCache]: Analyzing trace with hash 1901123941, now seen corresponding path program 1 times [2025-01-09 13:53:20,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:53:20,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60779270] [2025-01-09 13:53:20,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:53:20,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:53:20,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-01-09 13:53:21,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-01-09 13:53:21,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:53:21,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:53:23,805 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-01-09 13:53:23,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:53:23,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60779270] [2025-01-09 13:53:23,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60779270] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:53:23,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:53:23,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 13:53:23,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703617546] [2025-01-09 13:53:23,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:53:23,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 13:53:23,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:53:23,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 13:53:23,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-01-09 13:53:23,808 INFO L87 Difference]: Start difference. First operand 135 states and 203 transitions. Second operand has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 13:53:24,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:53:24,694 INFO L93 Difference]: Finished difference Result 489 states and 730 transitions. [2025-01-09 13:53:24,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 13:53:24,695 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 96 [2025-01-09 13:53:24,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:53:24,698 INFO L225 Difference]: With dead ends: 489 [2025-01-09 13:53:24,699 INFO L226 Difference]: Without dead ends: 357 [2025-01-09 13:53:24,700 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2025-01-09 13:53:24,701 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 521 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 521 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 13:53:24,701 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [521 Valid, 333 Invalid, 446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 13:53:24,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2025-01-09 13:53:24,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 201. [2025-01-09 13:53:24,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 158 states have (on average 1.4303797468354431) internal successors, (226), 158 states have internal predecessors, (226), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-01-09 13:53:24,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 304 transitions. [2025-01-09 13:53:24,739 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 304 transitions. Word has length 96 [2025-01-09 13:53:24,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:53:24,739 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 304 transitions. [2025-01-09 13:53:24,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 13:53:24,740 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 304 transitions. [2025-01-09 13:53:24,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-01-09 13:53:24,743 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:53:24,744 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 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, 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, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:53:24,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 13:53:24,744 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:53:24,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:53:24,745 INFO L85 PathProgramCache]: Analyzing trace with hash 126116579, now seen corresponding path program 1 times [2025-01-09 13:53:24,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:53:24,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135714428] [2025-01-09 13:53:24,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:53:24,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:53:24,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-01-09 13:53:24,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-01-09 13:53:24,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:53:24,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:53:27,317 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-01-09 13:53:27,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:53:27,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135714428] [2025-01-09 13:53:27,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135714428] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:53:27,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:53:27,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 13:53:27,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776850349] [2025-01-09 13:53:27,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:53:27,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 13:53:27,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:53:27,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 13:53:27,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-01-09 13:53:27,319 INFO L87 Difference]: Start difference. First operand 201 states and 304 transitions. Second operand has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-01-09 13:53:30,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:53:30,237 INFO L93 Difference]: Finished difference Result 544 states and 794 transitions. [2025-01-09 13:53:30,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 13:53:30,237 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 96 [2025-01-09 13:53:30,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:53:30,240 INFO L225 Difference]: With dead ends: 544 [2025-01-09 13:53:30,240 INFO L226 Difference]: Without dead ends: 412 [2025-01-09 13:53:30,240 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=125, Invalid=255, Unknown=0, NotChecked=0, Total=380 [2025-01-09 13:53:30,241 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 424 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 424 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 13:53:30,241 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [424 Valid, 359 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 13:53:30,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2025-01-09 13:53:30,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 279. [2025-01-09 13:53:30,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 224 states have (on average 1.4017857142857142) internal successors, (314), 226 states have internal predecessors, (314), 49 states have call successors, (49), 5 states have call predecessors, (49), 5 states have return successors, (49), 47 states have call predecessors, (49), 49 states have call successors, (49) [2025-01-09 13:53:30,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 412 transitions. [2025-01-09 13:53:30,261 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 412 transitions. Word has length 96 [2025-01-09 13:53:30,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:53:30,261 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 412 transitions. [2025-01-09 13:53:30,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-01-09 13:53:30,262 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 412 transitions. [2025-01-09 13:53:30,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-01-09 13:53:30,263 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:53:30,263 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 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, 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, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:53:30,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 13:53:30,263 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:53:30,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:53:30,263 INFO L85 PathProgramCache]: Analyzing trace with hash 806174949, now seen corresponding path program 1 times [2025-01-09 13:53:30,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:53:30,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121701438] [2025-01-09 13:53:30,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:53:30,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:53:30,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-01-09 13:53:30,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-01-09 13:53:30,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:53:30,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:53:34,814 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-01-09 13:53:34,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:53:34,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121701438] [2025-01-09 13:53:34,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121701438] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:53:34,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:53:34,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 13:53:34,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317793228] [2025-01-09 13:53:34,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:53:34,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 13:53:34,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:53:34,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 13:53:34,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-01-09 13:53:34,815 INFO L87 Difference]: Start difference. First operand 279 states and 412 transitions. Second operand has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-01-09 13:53:35,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:53:35,807 INFO L93 Difference]: Finished difference Result 815 states and 1185 transitions. [2025-01-09 13:53:35,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 13:53:35,808 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 96 [2025-01-09 13:53:35,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:53:35,811 INFO L225 Difference]: With dead ends: 815 [2025-01-09 13:53:35,811 INFO L226 Difference]: Without dead ends: 572 [2025-01-09 13:53:35,812 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2025-01-09 13:53:35,812 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 271 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 13:53:35,813 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 406 Invalid, 562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 512 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 13:53:35,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2025-01-09 13:53:35,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 432. [2025-01-09 13:53:35,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 432 states, 377 states have (on average 1.427055702917772) internal successors, (538), 379 states have internal predecessors, (538), 49 states have call successors, (49), 5 states have call predecessors, (49), 5 states have return successors, (49), 47 states have call predecessors, (49), 49 states have call successors, (49) [2025-01-09 13:53:35,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 636 transitions. [2025-01-09 13:53:35,837 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 636 transitions. Word has length 96 [2025-01-09 13:53:35,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:53:35,838 INFO L471 AbstractCegarLoop]: Abstraction has 432 states and 636 transitions. [2025-01-09 13:53:35,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-01-09 13:53:35,838 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 636 transitions. [2025-01-09 13:53:35,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-01-09 13:53:35,839 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:53:35,839 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 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, 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, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:53:35,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 13:53:35,839 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:53:35,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:53:35,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1144016492, now seen corresponding path program 1 times [2025-01-09 13:53:35,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:53:35,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638484427] [2025-01-09 13:53:35,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:53:35,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:53:35,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-01-09 13:53:35,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-01-09 13:53:35,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:53:35,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:53:37,013 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-01-09 13:53:37,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:53:37,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638484427] [2025-01-09 13:53:37,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638484427] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:53:37,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:53:37,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 13:53:37,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769932560] [2025-01-09 13:53:37,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:53:37,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 13:53:37,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:53:37,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 13:53:37,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 13:53:37,015 INFO L87 Difference]: Start difference. First operand 432 states and 636 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-01-09 13:53:37,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:53:37,326 INFO L93 Difference]: Finished difference Result 854 states and 1244 transitions. [2025-01-09 13:53:37,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 13:53:37,329 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 96 [2025-01-09 13:53:37,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:53:37,332 INFO L225 Difference]: With dead ends: 854 [2025-01-09 13:53:37,332 INFO L226 Difference]: Without dead ends: 608 [2025-01-09 13:53:37,335 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2025-01-09 13:53:37,336 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 162 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 13:53:37,337 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 339 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 13:53:37,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2025-01-09 13:53:37,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 438. [2025-01-09 13:53:37,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 383 states have (on average 1.4151436031331592) internal successors, (542), 385 states have internal predecessors, (542), 49 states have call successors, (49), 5 states have call predecessors, (49), 5 states have return successors, (49), 47 states have call predecessors, (49), 49 states have call successors, (49) [2025-01-09 13:53:37,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 640 transitions. [2025-01-09 13:53:37,372 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 640 transitions. Word has length 96 [2025-01-09 13:53:37,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:53:37,373 INFO L471 AbstractCegarLoop]: Abstraction has 438 states and 640 transitions. [2025-01-09 13:53:37,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-01-09 13:53:37,373 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 640 transitions. [2025-01-09 13:53:37,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-01-09 13:53:37,375 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:53:37,375 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 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, 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, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:53:37,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 13:53:37,375 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:53:37,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:53:37,376 INFO L85 PathProgramCache]: Analyzing trace with hash 890006691, now seen corresponding path program 1 times [2025-01-09 13:53:37,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:53:37,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027855358] [2025-01-09 13:53:37,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:53:37,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:53:37,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-01-09 13:53:37,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-01-09 13:53:37,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:53:37,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:53:37,804 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-01-09 13:53:37,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:53:37,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027855358] [2025-01-09 13:53:37,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027855358] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:53:37,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:53:37,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 13:53:37,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878887761] [2025-01-09 13:53:37,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:53:37,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 13:53:37,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:53:37,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 13:53:37,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 13:53:37,806 INFO L87 Difference]: Start difference. First operand 438 states and 640 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-01-09 13:53:38,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:53:38,273 INFO L93 Difference]: Finished difference Result 942 states and 1367 transitions. [2025-01-09 13:53:38,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 13:53:38,273 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 96 [2025-01-09 13:53:38,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:53:38,277 INFO L225 Difference]: With dead ends: 942 [2025-01-09 13:53:38,278 INFO L226 Difference]: Without dead ends: 710 [2025-01-09 13:53:38,279 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-01-09 13:53:38,279 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 263 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 13:53:38,279 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 350 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 13:53:38,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2025-01-09 13:53:38,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 436. [2025-01-09 13:53:38,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 436 states, 381 states have (on average 1.4120734908136483) internal successors, (538), 383 states have internal predecessors, (538), 49 states have call successors, (49), 5 states have call predecessors, (49), 5 states have return successors, (49), 47 states have call predecessors, (49), 49 states have call successors, (49) [2025-01-09 13:53:38,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 636 transitions. [2025-01-09 13:53:38,309 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 636 transitions. Word has length 96 [2025-01-09 13:53:38,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:53:38,309 INFO L471 AbstractCegarLoop]: Abstraction has 436 states and 636 transitions. [2025-01-09 13:53:38,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-01-09 13:53:38,310 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 636 transitions. [2025-01-09 13:53:38,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-01-09 13:53:38,311 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:53:38,311 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 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, 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, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:53:38,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 13:53:38,311 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:53:38,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:53:38,312 INFO L85 PathProgramCache]: Analyzing trace with hash -204942301, now seen corresponding path program 1 times [2025-01-09 13:53:38,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:53:38,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741658860] [2025-01-09 13:53:38,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:53:38,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:53:38,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-01-09 13:53:38,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-01-09 13:53:38,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:53:38,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:53:38,480 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-01-09 13:53:38,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:53:38,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741658860] [2025-01-09 13:53:38,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741658860] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:53:38,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:53:38,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 13:53:38,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213730119] [2025-01-09 13:53:38,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:53:38,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 13:53:38,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:53:38,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 13:53:38,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 13:53:38,482 INFO L87 Difference]: Start difference. First operand 436 states and 636 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-01-09 13:53:38,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:53:38,646 INFO L93 Difference]: Finished difference Result 786 states and 1137 transitions. [2025-01-09 13:53:38,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 13:53:38,646 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 96 [2025-01-09 13:53:38,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:53:38,648 INFO L225 Difference]: With dead ends: 786 [2025-01-09 13:53:38,648 INFO L226 Difference]: Without dead ends: 450 [2025-01-09 13:53:38,649 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 13:53:38,649 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 81 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 13:53:38,651 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 230 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 13:53:38,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2025-01-09 13:53:38,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 396. [2025-01-09 13:53:38,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 341 states have (on average 1.3782991202346042) internal successors, (470), 343 states have internal predecessors, (470), 49 states have call successors, (49), 5 states have call predecessors, (49), 5 states have return successors, (49), 47 states have call predecessors, (49), 49 states have call successors, (49) [2025-01-09 13:53:38,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 568 transitions. [2025-01-09 13:53:38,673 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 568 transitions. Word has length 96 [2025-01-09 13:53:38,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:53:38,675 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 568 transitions. [2025-01-09 13:53:38,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-01-09 13:53:38,675 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 568 transitions. [2025-01-09 13:53:38,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-01-09 13:53:38,675 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:53:38,676 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:53:38,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 13:53:38,676 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:53:38,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:53:38,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1115899161, now seen corresponding path program 1 times [2025-01-09 13:53:38,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:53:38,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358781533] [2025-01-09 13:53:38,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:53:38,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:53:38,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-01-09 13:53:38,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-01-09 13:53:38,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:53:38,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:53:40,511 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-01-09 13:53:40,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:53:40,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358781533] [2025-01-09 13:53:40,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358781533] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:53:40,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:53:40,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 13:53:40,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815286317] [2025-01-09 13:53:40,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:53:40,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 13:53:40,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:53:40,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 13:53:40,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-01-09 13:53:40,512 INFO L87 Difference]: Start difference. First operand 396 states and 568 transitions. Second operand has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-01-09 13:53:41,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:53:41,579 INFO L93 Difference]: Finished difference Result 804 states and 1149 transitions. [2025-01-09 13:53:41,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 13:53:41,580 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 97 [2025-01-09 13:53:41,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:53:41,581 INFO L225 Difference]: With dead ends: 804 [2025-01-09 13:53:41,582 INFO L226 Difference]: Without dead ends: 604 [2025-01-09 13:53:41,582 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2025-01-09 13:53:41,582 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 251 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 13:53:41,583 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 545 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 13:53:41,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2025-01-09 13:53:41,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 326. [2025-01-09 13:53:41,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 281 states have (on average 1.3736654804270463) internal successors, (386), 281 states have internal predecessors, (386), 39 states have call successors, (39), 5 states have call predecessors, (39), 5 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-01-09 13:53:41,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 464 transitions. [2025-01-09 13:53:41,604 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 464 transitions. Word has length 97 [2025-01-09 13:53:41,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:53:41,605 INFO L471 AbstractCegarLoop]: Abstraction has 326 states and 464 transitions. [2025-01-09 13:53:41,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-01-09 13:53:41,606 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 464 transitions. [2025-01-09 13:53:41,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-01-09 13:53:41,609 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:53:41,609 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:53:41,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 13:53:41,610 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:53:41,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:53:41,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1270932643, now seen corresponding path program 1 times [2025-01-09 13:53:41,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:53:41,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826690099] [2025-01-09 13:53:41,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:53:41,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:53:41,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-01-09 13:53:41,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-01-09 13:53:41,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:53:41,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:53:46,160 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-01-09 13:53:46,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:53:46,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826690099] [2025-01-09 13:53:46,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826690099] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:53:46,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:53:46,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-09 13:53:46,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915026367] [2025-01-09 13:53:46,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:53:46,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 13:53:46,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:53:46,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 13:53:46,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2025-01-09 13:53:46,161 INFO L87 Difference]: Start difference. First operand 326 states and 464 transitions. Second operand has 14 states, 14 states have (on average 2.5) internal successors, (35), 14 states have internal predecessors, (35), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-01-09 13:53:47,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:53:47,726 INFO L93 Difference]: Finished difference Result 734 states and 1026 transitions. [2025-01-09 13:53:47,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 13:53:47,726 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.5) internal successors, (35), 14 states have internal predecessors, (35), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 97 [2025-01-09 13:53:47,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:53:47,728 INFO L225 Difference]: With dead ends: 734 [2025-01-09 13:53:47,728 INFO L226 Difference]: Without dead ends: 485 [2025-01-09 13:53:47,728 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=145, Invalid=505, Unknown=0, NotChecked=0, Total=650 [2025-01-09 13:53:47,729 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 239 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 843 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 651 SdHoareTripleChecker+Invalid, 897 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 843 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 13:53:47,729 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 651 Invalid, 897 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 843 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 13:53:47,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2025-01-09 13:53:47,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 363. [2025-01-09 13:53:47,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 318 states have (on average 1.3742138364779874) internal successors, (437), 318 states have internal predecessors, (437), 39 states have call successors, (39), 5 states have call predecessors, (39), 5 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-01-09 13:53:47,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 515 transitions. [2025-01-09 13:53:47,751 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 515 transitions. Word has length 97 [2025-01-09 13:53:47,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:53:47,752 INFO L471 AbstractCegarLoop]: Abstraction has 363 states and 515 transitions. [2025-01-09 13:53:47,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.5) internal successors, (35), 14 states have internal predecessors, (35), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-01-09 13:53:47,752 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 515 transitions. [2025-01-09 13:53:47,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-01-09 13:53:47,753 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:53:47,753 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:53:47,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 13:53:47,753 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:53:47,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:53:47,753 INFO L85 PathProgramCache]: Analyzing trace with hash -143447346, now seen corresponding path program 1 times [2025-01-09 13:53:47,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:53:47,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439271194] [2025-01-09 13:53:47,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:53:47,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:53:47,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-09 13:53:47,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-09 13:53:47,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:53:47,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:53:50,854 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-01-09 13:53:50,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:53:50,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439271194] [2025-01-09 13:53:50,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439271194] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:53:50,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:53:50,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 13:53:50,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739089757] [2025-01-09 13:53:50,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:53:50,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 13:53:50,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:53:50,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 13:53:50,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-01-09 13:53:50,856 INFO L87 Difference]: Start difference. First operand 363 states and 515 transitions. Second operand has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-01-09 13:53:52,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:53:52,454 INFO L93 Difference]: Finished difference Result 671 states and 954 transitions. [2025-01-09 13:53:52,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 13:53:52,454 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 98 [2025-01-09 13:53:52,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:53:52,456 INFO L225 Difference]: With dead ends: 671 [2025-01-09 13:53:52,456 INFO L226 Difference]: Without dead ends: 521 [2025-01-09 13:53:52,457 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=116, Invalid=390, Unknown=0, NotChecked=0, Total=506 [2025-01-09 13:53:52,457 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 330 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 635 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 13:53:52,457 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 455 Invalid, 676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 635 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 13:53:52,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2025-01-09 13:53:52,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 353. [2025-01-09 13:53:52,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 308 states have (on average 1.37987012987013) internal successors, (425), 308 states have internal predecessors, (425), 39 states have call successors, (39), 5 states have call predecessors, (39), 5 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-01-09 13:53:52,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 503 transitions. [2025-01-09 13:53:52,483 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 503 transitions. Word has length 98 [2025-01-09 13:53:52,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:53:52,484 INFO L471 AbstractCegarLoop]: Abstraction has 353 states and 503 transitions. [2025-01-09 13:53:52,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-01-09 13:53:52,485 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 503 transitions. [2025-01-09 13:53:52,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-01-09 13:53:52,485 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:53:52,485 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:53:52,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 13:53:52,486 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:53:52,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:53:52,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1368282238, now seen corresponding path program 1 times [2025-01-09 13:53:52,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:53:52,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766485589] [2025-01-09 13:53:52,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:53:52,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:53:52,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-09 13:53:52,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-09 13:53:52,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:53:52,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:53:55,436 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-01-09 13:53:55,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:53:55,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766485589] [2025-01-09 13:53:55,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766485589] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:53:55,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:53:55,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-01-09 13:53:55,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675848336] [2025-01-09 13:53:55,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:53:55,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 13:53:55,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:53:55,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 13:53:55,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2025-01-09 13:53:55,438 INFO L87 Difference]: Start difference. First operand 353 states and 503 transitions. Second operand has 15 states, 15 states have (on average 2.4) internal successors, (36), 15 states have internal predecessors, (36), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-01-09 13:53:56,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:53:56,434 INFO L93 Difference]: Finished difference Result 601 states and 851 transitions. [2025-01-09 13:53:56,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 13:53:56,435 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.4) internal successors, (36), 15 states have internal predecessors, (36), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 98 [2025-01-09 13:53:56,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:53:56,436 INFO L225 Difference]: With dead ends: 601 [2025-01-09 13:53:56,436 INFO L226 Difference]: Without dead ends: 451 [2025-01-09 13:53:56,437 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=160, Invalid=440, Unknown=0, NotChecked=0, Total=600 [2025-01-09 13:53:56,437 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 327 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 628 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 628 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 13:53:56,437 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 461 Invalid, 684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 628 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 13:53:56,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2025-01-09 13:53:56,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 353. [2025-01-09 13:53:56,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 308 states have (on average 1.37987012987013) internal successors, (425), 308 states have internal predecessors, (425), 39 states have call successors, (39), 5 states have call predecessors, (39), 5 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-01-09 13:53:56,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 503 transitions. [2025-01-09 13:53:56,457 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 503 transitions. Word has length 98 [2025-01-09 13:53:56,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:53:56,458 INFO L471 AbstractCegarLoop]: Abstraction has 353 states and 503 transitions. [2025-01-09 13:53:56,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.4) internal successors, (36), 15 states have internal predecessors, (36), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-01-09 13:53:56,458 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 503 transitions. [2025-01-09 13:53:56,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-01-09 13:53:56,461 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:53:56,461 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:53:56,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 13:53:56,461 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:53:56,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:53:56,461 INFO L85 PathProgramCache]: Analyzing trace with hash -688223868, now seen corresponding path program 1 times [2025-01-09 13:53:56,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:53:56,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663263336] [2025-01-09 13:53:56,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:53:56,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:53:56,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-09 13:53:56,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-09 13:53:56,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:53:56,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:54:00,160 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-01-09 13:54:00,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:54:00,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663263336] [2025-01-09 13:54:00,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663263336] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:54:00,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:54:00,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-01-09 13:54:00,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381031684] [2025-01-09 13:54:00,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:54:00,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 13:54:00,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:54:00,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 13:54:00,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2025-01-09 13:54:00,161 INFO L87 Difference]: Start difference. First operand 353 states and 503 transitions. Second operand has 15 states, 15 states have (on average 2.4) internal successors, (36), 15 states have internal predecessors, (36), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-01-09 13:54:01,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:54:01,997 INFO L93 Difference]: Finished difference Result 600 states and 851 transitions. [2025-01-09 13:54:01,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 13:54:01,998 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.4) internal successors, (36), 15 states have internal predecessors, (36), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 98 [2025-01-09 13:54:01,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:54:02,000 INFO L225 Difference]: With dead ends: 600 [2025-01-09 13:54:02,000 INFO L226 Difference]: Without dead ends: 450 [2025-01-09 13:54:02,000 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=163, Invalid=487, Unknown=0, NotChecked=0, Total=650 [2025-01-09 13:54:02,001 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 242 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 726 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 814 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 726 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 13:54:02,001 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 531 Invalid, 814 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 726 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 13:54:02,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2025-01-09 13:54:02,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 345. [2025-01-09 13:54:02,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 300 states have (on average 1.3766666666666667) internal successors, (413), 300 states have internal predecessors, (413), 39 states have call successors, (39), 5 states have call predecessors, (39), 5 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-01-09 13:54:02,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 491 transitions. [2025-01-09 13:54:02,023 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 491 transitions. Word has length 98 [2025-01-09 13:54:02,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:54:02,023 INFO L471 AbstractCegarLoop]: Abstraction has 345 states and 491 transitions. [2025-01-09 13:54:02,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.4) internal successors, (36), 15 states have internal predecessors, (36), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-01-09 13:54:02,024 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 491 transitions. [2025-01-09 13:54:02,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-01-09 13:54:02,025 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:54:02,025 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:54:02,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 13:54:02,025 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:54:02,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:54:02,026 INFO L85 PathProgramCache]: Analyzing trace with hash 26941537, now seen corresponding path program 1 times [2025-01-09 13:54:02,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:54:02,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380603318] [2025-01-09 13:54:02,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:54:02,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:54:02,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 13:54:02,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 13:54:02,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:54:02,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat